Abstract
The shortest route cut and fill problem proposed by Henderson et al 1 is studied in this paper where we extend the model to include multiple vehicles and a makespan objective. A new tabu search embedded simulated annealing algorithm for both models is developed. Computational experiments show that the new approach is robust and achieves better solutions when compared with those found using Henderson et al's algorithm for larger test cases within significantly shorter times.
Similar content being viewed by others
References
Henderson D et al (2003). Solving the shortest route cut and fill problem using simulated annealing. Eur J Opl Res 145: 72–84.
Laporte G (1992). The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 231–247.
Laporte G, Gendreau M, Potvin J-Y and Semet F (2000). Classical and modern heuristics for the vehicle routing problem. Int Trans Opl Res 7: 285–300.
Charikar M, Khuller S and Raghavachari B (2001). Algorithms for capacitated vehicle routing. SIAM J Comput 31: 665–682.
Anily S and Bramel J (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res Logist 46: 654–670.
Renaud J, Boctor FF and Ouenniche J (2000). A heuristic for the pickup and delivery traveling salesman problem. Comput Opns Res 27: 905–916.
Miller CE, Tucker AW and Zemlin RA (1960). Integer programming formulations and the traveling salesman problem. J Assoc Comput Mach 7: 326–329.
Held M and Karp RM (1970). The traveling salesman problem and minimum spanning trees. Opns Res 18: 1138–1162.
Held M and Karp RM (1971). The traveling salesman problem and minimum spanning trees: Part II. Math Programm 1: 6–25.
Kirkpatrick S, Gelatt Jr CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671–680.
Faigle U and Kern W (1992). Some convergence results for probabilistic tabu search. ORSA J Comput 4: 32–37.
Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533–549.
Moscato P (1993). An introduction to population approaches for optimization and heirachical objective functions: a discussion of the role of tabu search. Ann Opns Res 41: 85–121.
Fleisher MA and Jacobsen SH (1999). Information theory and finite-time behavior of the simulated annealing algorithm: experimental results. INFORMS J Comput 11: 35–43.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lim, A., Rodrigues, B. & Zhang, J. Tabu search embedded simulated annealing for the shortest route cut and fill problem. J Oper Res Soc 56, 816–824 (2005). https://doi.org/10.1057/palgrave.jors.2601900
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601900