A Survey on the Vehicle Routing Problem and Its Variants

HTML  XML Download Download as PDF (Size: 174KB)  PP. 66-74  
DOI: 10.4236/iim.2012.43010    24,071 Downloads   45,694 Views  Citations

ABSTRACT

In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants. The VRP is classified as an NP-hard problem. Hence, the use of exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. The vehicle routing problem comes under combinatorial problem. Hence, to get solutions in determining routes which are realistic and very close to the optimal solution, we use heuristics and meta-heuristics. In this paper we discuss the various exact methods and the heuristics and meta-heuristics used to solve the VRP and its variants.

Share and Cite:

S. Kumar and R. Panneerselvam, "A Survey on the Vehicle Routing Problem and Its Variants," Intelligent Information Management, Vol. 4 No. 3, 2012, pp. 66-74. doi: 10.4236/iim.2012.43010.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.