Tabu search embedded simulated annealing for the shortest route cut and fill problem

Journal of the Operational Research Society

Volumn 56, Issue 7, 2005, Pages 816-824

  Lim, A ^a   Rodrigues, B ^b   Zhang, J ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Cut and fill; Simulated annealing; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GROUND VEHICLES; MATHEMATICAL MODELS; OPERATIONS RESEARCH; SIMULATED ANNEALING;

CUT AND FILL; PLANNING GOAL; TABU SEARCH; VEHICLE CAPACITY;

PROBLEM SOLVING;

EID: 20444457044     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601900     Document Type: Article

References (14)

1. Henderson D et al (2003). Solving the shortest route cut and fill problem using simulated annealing. Eur J Opl Res 145: 72-84.
2. Laporte G (1992). The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 231-247.
3. Laporte G, Gendreau M, Potvin J-Y and Semet F (2000). Classical and modern heuristics for the vehicle routing problem. Int Trans Opl Res 1: 285-300.
4. Charikar M, Khuller S and Raghavachari B (2001). Algorithms for capacitated vehicle routing. SIAM J Comput 31: 665-682.
5. Anily S and Bramel J (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res Logist 46: 654-670.
6. Renaud J, Boctor FF and Ouenniche J (2000). A heuristic for the pickup and delivery traveling salesman problem. Comput Opns Res 21: 905-916.
7. Miller CE, Tucker AW and Zemlin RA (1960). Integer programming formulations and the traveling salesman problem. J Assoc Comput Mach 7: 326-329.
8. Held M and Karp RM (1970). The traveling salesman problem and minimum spanning trees. Opns Res 18: 1138-1162.
9. Held M and Karp RM (1971). The traveling salesman problem and minimum spanning trees: Part H. Math Programm 1: 6-25.
10. Kirkpatrick S, Gelatt Jr CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671-680.
11. Faigle U and Kern W (1992). Some convergence results for probabilistic tabu search. ORSA J Comput 4: 32-37.
12. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533-549.
13. 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.
14. 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.