A Tabu Search Algorithm for a Routing and Container Loading Problem
By Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello. Transportation Science, 2006
342 citations recorded by the source corpus.
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.
Subfields: Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/dcb29765e47a1024fad169d2fe210d2aa249149f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
- Thibaut Vidal
- Teodor Gabriel Crainic
- Michel Gendreau
- Christian Prins
- Manuel Iori
- Silvano Martello
- Gilbert Laporte
- Piotr Matl
Citations in the corpus
- A concise guide to existing and emerging vehicle routing problem variants (2019, background): “2007), and 3D packing constraints (Gendreau et al. 2006), but other constraints related to fragility, orientation, or equilibrium often come into play.”
- Routing problems with loading constraints (2010, methodology): “2 is shown in Figure 3 (taken from [51]), where it is assumed that the vehicle is unloaded in the direction of the z axis.”
- Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “Path relinking was applied to the CVRP by Ho and Gendreau (2006).”