THE vehicle routing problem (VRP) is one of the most
intensively studied problems in operations research, and
this is due to its structural charm as well as practical
relevance. Many papers have been devoted to the development
of optimization[1-3]and approximation algorithms for vehicle
routing and scheduling problems