Abstract
Metaheuristics are a class of approximate methods designed to solve hard combinatorial optimization problems arising within various different areas. The importance of metaheuristics results from their ability to continue the search beyond a local optimum so that near-optimal or optimal solutions are efficiently found. In order to solve the backhauling problem associated with mixed and simultaneous delivery and pick-ups, this paper presents a hybrid algorithm which is comprised of the two metaheuristics of tabu search and variable neighbourhood descent. The primary challenge associated with backhauling consists of creating routes in which vehicles are not only required to deliver goods, but also to perform pick-ups at customer locations. The problems associated with these two categories of problems, however, have received little attention in the literature to date. A set of examples taken from the literature with Euclidean cost matrices are presented. Finally, some numerical results are illustrated to show the effectiveness of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Toth P and Vigo D (1997). An exact algorithm for the vehicle routing with backhauls. Transport Sci 31: 372–385.
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.
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.
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.
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.
Thangiah SR et al (1996). Heuristic approaches to vehicle routing with backhauls and time windows. Computers Opns Res 23: 1043–1057.
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.
Baldacci R et al (1999). An exact method for the vehicle routing with backhauls. Transport Sci 33: 315–329.
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.
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.
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.
Reeves CR (ed) (1993). Modern Heuristic Techniques for Combinatorial Problems. John Wiley & Sons, Inc.: New York, NY, USA.
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.
Glover F (1989). Tabu search, Part I. ORSA J Comput 1: 190–206.
Glover F (1990). Tabu search, Part II. ORSA J Comput 2: 4–32.
Glover F (1993). A user's guide to tabu search. Ann Opns Res 41: 3–28.
Laguna M and Glover F (1996). What is tabu search? Colorado Bus Rev 61: 5–12.
Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston, MA.
Hansen P and Mladenovic N (1997). An introduction to variable neighborhood search. Comput Opns Res 24: 1097–1100.
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.
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.
Acknowledgements
This research was partially supported by Fundacão Para A Ciência E Technologia under the Program Praxis XXI, Project No. 3/3.1/GEG/2661/95.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Crispim, J., Brandão, J. Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J Oper Res Soc 56, 1296–1302 (2005). https://doi.org/10.1057/palgrave.jors.2601935
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601935