The Pallet-Packing Vehicle Routing Problem

Published Online:https://doi.org/10.1287/trsc.1110.0373

References

  • Alvarenga G. B., Mateus G. R., de Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. (2007) 34:1561–1584CrossrefGoogle Scholar
  • Bischoff E. E., Ratcliff M. S. W. Loading multiple pallets. J. Oper. Res. Soc. (1995) 46:1322–1336Google Scholar
  • Chazelle B. The bottom-left bin packing heuristic: An efficient implementation. IEEE Trans. Comput. (1983) C-32:697–707CrossrefGoogle Scholar
  • Chen C. S., Lee S. M., Shen Q. S. An analytical model for the container loading problem. Eur. J. Oper. Res. (1995) 80:68–76CrossrefGoogle Scholar
  • Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi C. The vehicle routing problem. Combinatorial Optimization (1979) (Wiley, New York) 315–338Google Scholar
  • Crainic T. G., Perboli G., Tadei R. Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. (2008) 20:368–384LinkGoogle Scholar
  • Doerner K. F., Fuellerer G., Hartl R. F., Gronalt M., Iori M. Metaheuristics for the vehicle routing problem with loading constraints. Networks (2007) 49:294–307CrossrefGoogle Scholar
  • Fuellerer G., Doerner K. F., Hartl R. F., Iori M. Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput. Oper. Res. (2009) 36:655–673CrossrefGoogle Scholar
  • Fuellerer G., Doerner K. F., Hartl R. F., Iori M. Metaheuristics for vehicle routing problems with three-dimensional loading constraints. Eur. J. Oper. Res. (2010) 201:751–759CrossrefGoogle Scholar
  • Gendreau M., Tarantilis C. D. Solving large-scale vehicle routing problems with time windows: The state-of-the-art. (2010) . Working paper CIRRELT-2010-04, CIRRELT, Montréal, CanadaGoogle Scholar
  • Gendreau M., Iori M., Laporte G., Martello S. A tabu search algorithm for a routing and container loading problem. Transportation Sci. (2006) 40:342–350LinkGoogle Scholar
  • Gendreau M., Iori M., Laporte G., Martello S. A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks (2008) 51:4–18CrossrefGoogle Scholar
  • Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Dordrecht) CrossrefGoogle Scholar
  • Iori M., Martello S. Routing problems with loading constraints. TOP (2010) 18:4–27CrossrefGoogle Scholar
  • Iori M., Salazar-Gonzãlez J.-J., Vigo D. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Sci. (2007) 41:253–264LinkGoogle Scholar
  • Laporte G. Fifty years of vehicle routing. Transportation Sci. (2009) 43:408–416LinkGoogle Scholar
  • Lodi A., Martello S., Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. (1999) 11:345–357LinkGoogle Scholar
  • Malapert A., Guéret C., Jussien N., Langevin A., Rousseau L.-M. Two-dimensional pickup and delivery routing problem with loading constraints. (2008) Presented at 1st Workshop on Bin Packing and Placement Constraints (BPPC'08)ParisGoogle Scholar
  • Martello S., Pisinger D., Vigo D. The three-dimensional bin packing problem. Oper. Res. (2000) 48:256–267LinkGoogle Scholar
  • Mester D., Bräysy O. Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput. Oper. Res. (2007) 34:2964–2975CrossrefGoogle Scholar
  • Moura A., Oliveira J. F. An integrated approach to the vehicle routing and container loading problems. OR Spectrum (2009) 31:775–800CrossrefGoogle Scholar
  • Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res. (1987) 35:254–265LinkGoogle Scholar
  • Tarantilis C. D., Zachariadis E. E., Kiranoudis C. T. A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans. Intelligent Transportation Systems (2009) 10:255–271CrossrefGoogle Scholar
  • Tricoire F., Doerner K. F., Hartl R. F., Iori M. Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum (2009) (Forthcoming)Google Scholar
  • Zachariadis E. E., Kiranoudis C. T. A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput. Oper. Res. (2010) 37:2089–2105CrossrefGoogle Scholar
  • Zachariadis E. E., Tarantilis C. D., Kiranoudis C. T. A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. (2009) 195:729–743CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.