Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 3264214, 11 pages
http://dx.doi.org/10.1155/2016/3264214
Research Article

Algorithms for Pallet Building and Truck Loading in an Interdepot Transportation Problem

1Department of Mathematics, University of Castilla-La Mancha, Avenida de España, 02071 Albacete, Spain
2Department of Statistics and Operations Research, University of Valencia, Doctor Moliner 50, Burjassot, 46100 Valencia, Spain

Received 15 December 2015; Accepted 15 March 2016

Academic Editor: Paolo Maria Mariano

Copyright © 2016 Maria Teresa Alonso et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Morabito, S. R. Morales, and J. A. Widmer, “Loading optimization of palletized products on trucks,” Transportation Research Part E: Logistics and Transportation Review, vol. 36, no. 4, pp. 285–296, 2000. View at Publisher · View at Google Scholar · View at Scopus
  2. R. Morabito and S. Morales, “A simple and effective recursive procedure for the manufacturer's pallet loading problem,” Journal of the Operational Research Society, vol. 49, no. 8, pp. 819–828, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. S. Takahara, “Loading problem in multiple containers and pallets using strategic search method,” in Modeling Decisions for Artificial Intelligence, V. Torra, Y. Narukawa, and S. Miyamoto, Eds., vol. 3558 of Lecture Notes in Computer Science, pp. 448–456, Springer, 2005. View at Google Scholar
  4. R. W. Haessler and F. B. Talbot, “Load planning for shipments of low density products,” European Journal of Operational Research, vol. 44, no. 2, pp. 289–299, 1990. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Moura and A. Bortfeldt, “A two-stage packing problem procedure,” International Transactions in Operational Research, 2016. View at Publisher · View at Google Scholar
  6. A. Moura and J. F. Oliveira, “A GRASP approach to the container-loading problem,” IEEE Intelligent Systems, vol. 20, no. 4, pp. 50–57, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. E. E. Zachariadis, C. D. Tarantilis, and C. T. Kiranoudis, “The pallet-packing vehicle routing problem,” Transportation Science, vol. 46, no. 3, pp. 341–358, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Alonso, R. Alvarez-Valdes, M. Iori, F. Parreño, and J. Tamarit, “Mathematical models for multi container loading problems,” Omega, 2016. View at Publisher · View at Google Scholar
  9. A. Bortfeldt and G. Wäscher, “Constraints in container loading—a state-of-the-art review,” European Journal of Operational Research, vol. 229, no. 1, pp. 1–20, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. H. Gehring and A. Bortfeldt, “A genetic algorithm for solving the container loading problem,” International Transactions in Operational Research, vol. 4, no. 5-6, pp. 401–418, 1997. View at Publisher · View at Google Scholar
  11. A. Bortfeldt, H. Gehring, and D. Mack, “A parallel tabu search algorithm for solving the container loading problem,” Parallel Computing, vol. 29, no. 5, pp. 641–662, 2003. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Terno, G. Scheithauer, U. Sommerweiß, and J. Riehme, “An efficient approach for the multi-pallet loading problem,” European Journal of Operational Research, vol. 123, no. 2, pp. 372–381, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. Egeblad, C. Garavelli, S. Lisi, and D. Pisinger, “Heuristics for container loading of furniture,” European Journal of Operational Research, vol. 200, no. 3, pp. 881–892, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. E. E. Bischoff and M. D. Marriott, “A comparative evaluation of heuristics for container loading,” European Journal of Operational Research, vol. 44, no. 2, pp. 267–276, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. A. Bortfeldt and H. Gehring, “A hybrid genetic algorithm for the container loading problem,” European Journal of Operational Research, vol. 131, no. 1, pp. 143–161, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Lim, H. Ma, C. Qiu, and W. Zhu, “The single container loading problem with axle weight constraints,” International Journal of Production Economics, vol. 144, no. 1, pp. 358–369, 2013. View at Publisher · View at Google Scholar · View at Scopus
  17. E. E. Bischoff and M. S. W. Ratcliff, “Issues in the development of approaches to container loading,” Omega, vol. 23, no. 4, pp. 377–390, 1995. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Terno, G. Scheithauer, U. Sommerweiss, and J. Riehme, “An efficient approach for the multi-pallet loading problem,” European Journal of Operational Research, vol. 123, no. 2, pp. 372–381, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. L. Junqueira, R. Morabito, and D. Sato Yamashita, “Three-dimensional container loading models with cargo stability and load bearing constraints,” Computers and Operations Research, vol. 39, no. 1, pp. 74–85, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. M. T. Alonso, R. Alvarez-Valdes, J. M. Tamarit, and F. Parreño, “A reactive GRASP algorithm for the container loading problem with load-bearing constraints,” European Journal of Industrial Engineering, vol. 8, no. 5, pp. 669–694, 2014. View at Publisher · View at Google Scholar · View at Scopus
  21. A. Ramos, J. F. Oliveira, and M. P. Lopes, “A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions,” International Transactions in Operational Research, vol. 23, no. 1-2, pp. 215–238, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. O. C. B. De Araújo and V. A. Armentano, “A multi-start random constructive heuristic for the container loading problem,” Pesquisa Operacional, vol. 27, no. 2, pp. 311–331, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. T. Fanslau and A. Bortfeldt, “A tree search algorithm for solving the container loading problem,” INFORMS Journal on Computing, vol. 22, no. 2, pp. 222–235, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. A. G. Ramos, J. F. Oliveira, J. F. Gonçalves, and M. P. Lopes, “Dynamic stability metrics for the container loading problem,” Transportation Research Part C: Emerging Technologies, vol. 60, pp. 480–497, 2015. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Iori, J.-J. Salazar-González, and D. Vigo, “An exact approach for the vehicle routing problem with two-dimensional loading constraints,” Transportation Science, vol. 41, no. 2, pp. 253–264, 2007. View at Publisher · View at Google Scholar · View at Scopus
  26. A. Bortfeldt, “A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints,” Computers and Operations Research, vol. 39, no. 9, pp. 2248–2257, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. L. Junqueira, J. F. Oliveira, M. A. Carravilla, and R. Morabito, “An optimization model for the vehicle routing problem with practical three-dimensional loading constraints,” International Transactions in Operational Research, vol. 20, no. 5, pp. 645–666, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. S. Ceschia, A. Schaerf, and T. Stützle, “Local search techniques for a routing-packing problem,” Computers and Industrial Engineering, vol. 66, no. 4, pp. 1138–1149, 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. Y. Tao and F. Wang, “An effective tabu search approach with improved loading algorithms for the 3L-CVRP,” Computers & Operations Research, vol. 55, pp. 127–140, 2015. View at Publisher · View at Google Scholar · View at Scopus
  30. L. Junqueira and R. Morabito, “Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier,” Computers and Industrial Engineering, vol. 88, pp. 110–130, 2015. View at Publisher · View at Google Scholar · View at Scopus
  31. K. F. Doerner, G. Fuellerer, R. F. Hartl, M. Gronalt, and M. Iori, “Metaheuristics for the vehicle routing problem with loading constraints,” Networks, vol. 49, no. 4, pp. 294–307, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. H. Pollaris, K. Braekers, A. Caris, G. Janssens, and S. Limbourg, “Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints,” EURO Journal on Transportation and Logistics, 2014. View at Publisher · View at Google Scholar
  33. M. Iori and S. Martello, “Routing problems with loading constraints,” TOP, vol. 18, no. 1, pp. 4–27, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. M. Iori and S. Martello, “An annotated bibliography of combined routing and loading problems,” Yugoslav Journal of Operations Research, vol. 23, no. 3, pp. 311–326, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. H. Pollaris, K. Braekers, A. Caris, G. K. Janssens, and S. Limbourg, “Vehicle routing problems with loading constraints: state-of-the-art and future directions,” OR Spectrum, vol. 37, no. 2, pp. 297–330, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. SCANIA, April 2016, https://bodybuilderhomepage.scania.com/.
  37. M. N. Arenales, A. C. Cherri, D. N. Nascimento, and A. Vianna, “A new mathematical model for the cutting stock/leftover problem,” Pesquisa Operacional, vol. 35, no. 3, pp. 509–522, 2015. View at Publisher · View at Google Scholar
  38. R. Andrade, E. G. Birgin, and R. Morabito, “Two-stage two-dimensional guillotine cutting stock problems with usable leftover,” International Transactions in Operational Research, vol. 23, no. 1-2, pp. 121–145, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. G. Wäscher, H. Haußner, and H. Schumann, “An improved typology of cutting and packing problems,” European Journal of Operational Research, vol. 183, no. 3, pp. 1109–1130, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  40. M. G. C. Resende and R. F. Werneck, “A hybrid heuristic for the p-median problem,” Journal of Heuristics, vol. 10, no. 1, pp. 59–88, 2004. View at Publisher · View at Google Scholar · View at Scopus
  41. M. Prais and C. C. Ribeiro, “Reactive grasp: an application to a matrix decomposition problem in tdma traffic assignment,” INFORMS Journal on Computing, vol. 12, no. 3, pp. 164–176, 2000. View at Publisher · View at Google Scholar · View at Scopus
  42. R. Marti and J. Moreno-Vega, “Metodos multiarranque,” Inteligencia Artificial, vol. 19, no. 2, pp. 49–60, 2003. View at Google Scholar
  43. ORTEC, February 2016, http://ortec.com/.