Skip to main content
SpringerLink
Log in

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

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Article  Google Scholar 

  • Laporte G (1992). The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Opl Res 59: 231–247.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Charikar M, Khuller S and Raghavachari B (2001). Algorithms for capacitated vehicle routing. SIAM J Comput 31: 665–682.

    Article  Google Scholar 

  • Anily S and Bramel J (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res Logist 46: 654–670.

    Article  Google Scholar 

  • Renaud J, Boctor FF and Ouenniche J (2000). A heuristic for the pickup and delivery traveling salesman problem. Comput Opns Res 27: 905–916.

    Article  Google Scholar 

  • Miller CE, Tucker AW and Zemlin RA (1960). Integer programming formulations and the traveling salesman problem. J Assoc Comput Mach 7: 326–329.

    Article  Google Scholar 

  • Held M and Karp RM (1970). The traveling salesman problem and minimum spanning trees. Opns Res 18: 1138–1162.

    Article  Google Scholar 

  • Held M and Karp RM (1971). The traveling salesman problem and minimum spanning trees: Part II. Math Programm 1: 6–25.

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt Jr CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671–680.

    Article  Google Scholar 

  • Faigle U and Kern W (1992). Some convergence results for probabilistic tabu search. ORSA J Comput 4: 32–37.

    Article  Google Scholar 

  • Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533–549.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hong Kong University of Science and Technology, Kowloon, Hong Kong

    A Lim

  2. Singapore Management University, Singapore

    B Rodrigues

  3. National University of Singapore, Singapore

    J Zhang

Authors
  1. A Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B Rodrigues.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2601900

Keywords

Search

Navigation