A Tabu Search Algorithm for a Routing and Container Loading Problem
Michel Gendreau (),
Manuel Iori (),
Gilbert Laporte () and
Silvano Martello ()
Additional contact information
Michel Gendreau: Centre de recherche sur les transports, Université de Montréal, C.P. 6128 succursale Centre-ville, Montréal, H3C 3J7 Canada
Manuel Iori: Dipartimento di Elettronica, Informatica e Sistemistica, Università degli Studi di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Gilbert Laporte: Centre de recherche sur les transports, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, H3T 2A7 Canada
Silvano Martello: Dipartimento di Elettronica, Informatica e Sistemistica, Università degli Studi di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Transportation Science, 2006, vol. 40, issue 3, 342-350
Abstract:
This article considers a combination of capacitated vehicle routing and three-dimensional loading, with additional constraints frequently encountered in freight transportation. It proposes a tabu search algorithm that iteratively invokes an inner tabu search procedure for the solution of the loading subproblem. The algorithm is experimentally evaluated both on instances adapted from vehicle routing instances from the literature and on new real-world instances.
Keywords: vehicle routing; three-dimensional packing; tabu search (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (60)
Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1050.0145 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:40:y:2006:i:3:p:342-350
Access Statistics for this article
More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().