H. Wee Kit, J. Chin and A. Lim, “A Hybrid Search Algo- rithm for the Vehicle Routing Problem with Time Windows,” International Journal on Artificial Intelligence Tools, Vol. 10, No. 3, 2001, pp. 431-449. doi:10.1142/S021821300100060X

has been cited by the following article:

• TITLE: A Survey on the Vehicle Routing Problem and Its Variants

  AUTHORS: Suresh Nanda Kumar, Ramasamy Panneerselvam

  KEYWORDS: Vehicle Routing Problem; Exact Methods; Heuristics; Meta-heuristics; VRPTW; Optimization; Ant Colony Optimization; Genetic Algorithms

  JOURNAL NAME: Intelligent Information Management, Vol.4 No.3, May 25, 2012

  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.