A Survey on the Vehicle Routing Problem and Its Variants

Suresh Nanda Kumar, Ramasamy Panneerselvam
2012 Intelligent Information Management  
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
more » ... ry 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.
doi:10.4236/iim.2012.43010 fatcat:bhzk37ixjnevhfj3shywxc2ccq