Abstract
The multi-pile vehicle routing problem is a particular combination of loading and routing problems, in which items have to be loaded into different piles within vehicles, and then delivered with minimum cost. The problem is motivated by a real-world timber distribution problem, and is of both theoretical and practical interest. In this paper, we first develop heuristic and exact methods to solve the loading problem. We then include these methods into a tailored combination of Variable Neighborhood Search and Branch-and-Cut, to solve the overall problem. Extensive computational results show how the resulting algorithms are capable of solving to optimality a large number of small-size instances, and of consistently outperforming previous algorithms from the literature on large-size and real-world instances.
Similar content being viewed by others
References
Alvarez-Valdes R, Parreno F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectr 31: 431–459
Ascheuer N, Fischetti M, Grötschel M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math Progr 90: 475–506
Bräysy O (2003) A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J Comput 15: 347–368
Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19: 618–632
Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315–338
Clarke G, Wright JV (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12: 568–581
Cordeau J-F, Iori M, Laporte G, Salazar González JJ (2009) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks. doi:10.1002/net.20312
Dell’Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7: 191–200
Doerner K, Fuellerer G, Gronalt M, Hartl R, Iori M (2007) Metaheuristics for vehicle routing problems with loading constraints. Networks 49: 294–307
Fuellerer G, Doerner K, Hartl R, Iori M (2007) An ant colony algorithm for vehicle routing problems with three-dimensional loading constraints. Technical Report, POM, University of Vienna
Fuellerer G, Doerner K, Hartl R, Iori M (2008) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput Oper Res 36: 655–673
Gendreau M, Iori M, Laporte G, Martello S (2006) A tabu search algorithm for a routing and container loading problem. Transp Sci 40: 342–350
Gendreau M, Iori M, Laporte G, Martello S (2007) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51: 4–18
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287–326
Hansen P, Mladenović N (2001) Variable neighborhood search: Principles and applications. Eur J Oper Res 130: 449–467
Hansen P, Mladenović N (2002) Variable neighborhood search. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, NY, pp 221–234
Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems: practical and theoretical results. J ACM 34: 144–162
Iori M (2004) Metaheuristic algorithms for combinatorial optimization problems. PhD thesis, University of Bologna, Italy
Iori M (2005) Metaheuristic algorithms for combinatorial optimization problems. 4OR 3: 163–166
Iori M, Salazar González JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41: 253–264
Ladany SP, Mehrez A (1984) Optimal routing of a single vehicle with loading constraints. Transp Plan Technol 8: 301–306
Letchford AN, Eglese RW, Lysgaard J (2002) Multistars, partial multistars and the capacitated vehicle routing problem. Math Program 94: 21–40
Lysgaard J (2004) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical Report, Department of Management Science and Logistics, Aarhus School of Business, Denmark
Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100: 423–445
Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097–1100
Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated vrp. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on discrete mathematics and applications, Philadelphia, pp 53–84
Petersen HL (2006) Heuristic solution approaches to the double TSP with multiple stacks. Technical report, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, Richard Petersens Plads, Lyngby
Petersen HL, Madsen OBG (2009) The double travelling salesman problem with multiple stacks—formulation and heuristic solution approaches. Eur J Oper Res 198(1): 139–147
Polacek M, Hartl RF, Doerner KF, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10: 613–627
Polacek M, Doerner KF, Hartl RF, Kiechle G, Reimann M (2007) Scheduling periodic customer visits for a travelling salesperson. Eur J Oper Res 179: 823–837
Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14: 405–423
Reimann M, Stummer M, Doerner KF (2002) A savings based ant system for the vehicle routing problem. In: Proceedings of the genetic and evolutionary computation conference 2002. Morgan Kaufmann, Menlo Park, pp 1317–1325
Righini G, Salani M (2006) Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim 3: 255–273
Taillard E, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31: 170–186
Toth P, Vigo D (2002) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia
Wäscher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183: 1109–1130
Zachariadis EE, Tarantilis CC, Kiranoudis CT (2007) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195: 729–743
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tricoire, F., Doerner, K.F., Hartl, R.F. et al. Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum 33, 931–959 (2011). https://doi.org/10.1007/s00291-009-0179-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-009-0179-2