Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls

Journal of the Operational Research Society

Volumn 56, Issue 11, 2005, Pages 1296-1302

  Crispim, J ^a   Brandao J ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Backhauling; Metaheuristics; Tabu search; Variable neighbourhood descent; Vehicle routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COSTS; HEURISTIC METHODS; OPTIMIZATION;

COST MATRICES; METAHEURISTICS; OPTIMIZATION PROBLEMS; VEHICLE ROUTING;

PROBLEM SOLVING;

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

References (21)

1. Toth P and Vigo D (1997). An exact algorithm for the vehicle routing with backhauls. Transport Sci 31: 372-385.
2. Toth P and Vigo D (1999). A heuristic algorithm for the symmetric and asymmetric vehicle routing with backhauls. Eur J Opl Res 113: 528-543.
3. Toth P and Vigo D (1996). A heuristic algorithm for the vehicle routing with backhauls. In: Bianco L and Toth P (eds). Advance Methods in Transportation Analysis: Proceedings of the Iind TRISTAN Conference. Springer, Berlin, pp 585-608.
4. Golden BL et al (1985). The vehicle routing problem with backhauling: two approaches. In: Hammesfahr R (eds). Proceedings of the 21st Annual Meeting of S.E. TIMES. Myrtle Beach, SC, USA, pp 90-92.
5. Casco DO, Golden BL and Wasil EA (1988). Vehicle routing with backhauls: models, algorithms and case studies. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp 127-147.
6. Thangiah SR et al (1996). Heuristic approaches to vehicle routing with backhauls and time windows. Computers Opns Res 23: 1043-1057.
7. Goetschalckx M and Jacobs-Blecha C (1993). The vehicle routing problem with backhauls: properties and solution algorithms. Technical report MHRC-TR-88-13. Georgia Institute of Technology.
8. Baldacci R et al (1999). An exact method for the vehicle routing with backhauls. Transport Sci 33: 315-329.
9. Salhi S and Nagy G (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Opl Res Soc 50: 1034-1042.
10. Dethloff J (2002). Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J Opl Res Soc 53: 115-119.
11. Liu F-HF and Shen S-Y (1998). A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur J Opl Res 118: 485-504.
12. Reeves CR (ed) (1993). Modern Heuristic Techniques for Combinatorial Problems. John Wiley & Sons, Inc.: New York, NY, USA.
13. Osman IH and Kelly JP (1996). Meta-heuristics: an overview. In: Osman IH and Kelly JP (eds). Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, Boston, MA, pp 1-21.
14. Glover F (1989). Tabu search, Part I. ORSA J Comput 1: 190-206.
15. Glover F (1990). Tabu search, Part II. ORSA J Comput 2: 4-32.
16. Glover F (1993). A user's guide to tabu search. Ann Opns Res 41: 3-28.
17. Laguna M and Glover F (1996). What is tabu search? Colorado Bus Rev 61: 5-12.
18. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston, MA.
19. Hansen P and Mladenovic N (1997). An introduction to variable neighborhood search. Comput Opns Res 24: 1097-1100.
20. Hansen P and Mladenovic N (1998). Variable neighborhood search: principles and applications. Tutorials and Research Reviews, 16th European Conference on Operational Research Brussels, Belgium, July, pp 12-15.
21. Hansen P and Mladenovic N (1999). An introduction to variable neighborhood search. In Voss S et al (eds). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers: Boston, MA, pp 453-458.