Abstract
The Capacitated Vehicle Routing Problem (CVRP) is the well-known combinatorial optimization problem having numerous relevant applications in operations research. As known, CVRP is strongly NP-hard even in the Euclidean plane, APX-hard for an arbitrary metric, and can be approximated in polynomial time with any accuracy in the Euclidean spaces of any fixed dimension. In particular, for the several special cases of the planar Euclidean CVRP there are known Polynomial Time Approximation Schemes (PTAS) stemming from the seminal papers by M. Haimovich, A. Rinnooy Kan and S. Arora. Although, these results appear to be promising and make a solid contribution to the field of algorithmic analysis of routing problems, all of them are restricted to the special case of the CVRP, where all customers have splittable or even unit demand, which seems to be far from the practice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
