IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v299y2022i2p706-721.html
   My bibliography  Save this article

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

Author

Listed:
  • Rajaei, Maryam
  • Moslehi, Ghasem
  • Reisi-Nafchi, Mohammad

Abstract

This paper introduces a complex real-world problem on a large scale that combines the split delivery heterogeneous vehicle routing problem with three-dimensional loading and considers new routing and loading constraints. The problem aims to find a set of routes with minimum transportation cost by satisfying the demand of all customers and loading constraints. We propose a column generation-based heuristic algorithm that employs three heuristic algorithms to solve the subproblem and a hybrid algorithm for loading. Computational experiments on the literature instances indicate that the proposed algorithm can produce very near solutions to the literature algorithm's solutions in significantly shorter running times. This paper introduces real-world instances with 230 to 850 customers, several times larger than the existing benchmarks. The results of the proposed algorithm for real-world instances are effective, and compared to the current situation, it leads to a reduction of 20% in the average total cost of transportation. Also, the average number of vehicles is reduced by 36%.

Suggested Citation

  • Rajaei, Maryam & Moslehi, Ghasem & Reisi-Nafchi, Mohammad, 2022. "The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale," European Journal of Operational Research, Elsevier, vol. 299(2), pages 706-721.
    • Handle: RePEc:eee:ejores:v:299:y:2022:i:2:p:706-721
    DOI: 10.1016/j.ejor.2021.08.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721007153
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.08.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Männel, Dirk & Bortfeldt, Andreas, 2016. "A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 254(3), pages 840-858.
    2. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    3. Bischoff, E. E. & Ratcliff, M. S. W., 1995. "Issues in the development of approaches to container loading," Omega, Elsevier, vol. 23(4), pages 377-390, August.
    4. Zhi-Hua Hu & Yingxue Zhao & Sha Tao & Zhao-Han Sheng, 2015. "Finished-vehicle transporter routing problem solved by loading pattern discovery," Annals of Operations Research, Springer, vol. 234(1), pages 37-56, November.
    5. Fuellerer, Guenther & Doerner, Karl F. & Hartl, Richard F. & Iori, Manuel, 2010. "Metaheuristics for vehicle routing problems with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 201(3), pages 751-759, March.
    6. Desrochers, Martin & Soumis, Francois, 1988. "A reoptimization algorithm for the shortest path problem with time windows," European Journal of Operational Research, Elsevier, vol. 35(2), pages 242-254, May.
    7. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    8. Michel Gendreau & Manuel Iori & Gilbert Laporte & Silvano Martello, 2006. "A Tabu Search Algorithm for a Routing and Container Loading Problem," Transportation Science, INFORMS, vol. 40(3), pages 342-350, August.
    9. Batoul Mahvash & Anjali Awasthi & Satyaveer Chauhan, 2017. "A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1730-1747, March.
    10. Reil, Sebastian & Bortfeldt, Andreas & Mönch, Lars, 2018. "Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 266(3), pages 877-894.
    11. Manuel Iori & Silvano Martello, 2010. "Rejoinder on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 41-42, July.
    12. Zhang, Zhenzhen & Wei, Lijun & Lim, Andrew, 2015. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 20-35.
    13. Ana Moura, 2008. "A Multi-Objective Genetic Algorithm for the Vehicle Routing with Time Windows and Loading Problem," Springer Books, in: Andreas Bortfeldt & Jörg Homberger & Herbert Kopfer & Giselher Pankratz & Reinhard Strangmeier (ed.), Intelligent Decision Support, pages 187-201, Springer.
    14. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    15. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    16. Teodor Gabriel Crainic & Guido Perboli & Roberto Tadei, 2008. "Extreme Point-Based Heuristics for Three-Dimensional Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 368-384, August.
    17. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2012. "The Pallet-Packing Vehicle Routing Problem," Transportation Science, INFORMS, vol. 46(3), pages 341-358, August.
    18. Junmin Yi & Andreas Bortfeldt, 2018. "The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery—A Case Study," Operations Research Proceedings, in: Andreas Fink & Armin Fügenschuh & Martin Josef Geiger (ed.), Operations Research Proceedings 2016, pages 351-356, Springer.
    19. Männel, Dirk & Bortfeldt, Andreas, 2018. "Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban," European Journal of Operational Research, Elsevier, vol. 264(1), pages 119-137.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yong Liu & Zhicheng Yue & Yong Wang & Haizhong Wang, 2023. "Logistics Distribution Vehicle Routing Problem with Time Window under Pallet 3D Loading Constraint," Sustainability, MDPI, vol. 15(4), pages 1-25, February.
    2. Li, Hongqi & Wang, Feilong & Zhan, Zhuopeng, 2024. "Drone routing problem with swarm synchronization," European Journal of Operational Research, Elsevier, vol. 314(2), pages 477-495.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    2. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    3. Xiang Song & Dylan Jones & Nasrin Asgari & Tim Pigden, 2020. "Multi-objective vehicle routing and loading with time window constraints: a real-life application," Annals of Operations Research, Springer, vol. 291(1), pages 799-825, August.
    4. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    5. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    6. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2017. "A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups," FEMM Working Papers 170005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Corinna Krebs & Jan Fabian Ehmke, 2023. "Solution validator and visualizer for (combined) vehicle routing and container loading problems," Annals of Operations Research, Springer, vol. 326(1), pages 561-579, July.
    8. Henriette Koch & Maximilian Schlögell & Andreas Bortfeldt, 2020. "A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls," Journal of Scheduling, Springer, vol. 23(1), pages 71-93, February.
    9. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    10. Männel, Dirk & Bortfeldt, Andreas, 2016. "A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 254(3), pages 840-858.
    11. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    12. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2017. "Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints," Operational Research, Springer, vol. 17(1), pages 115-143, April.
    13. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Chris T., 2013. "Designing vehicle routes for a mix of different request types, under time windows and loading constraints," European Journal of Operational Research, Elsevier, vol. 229(2), pages 303-317.
    14. Corinna Krebs & Jan Fabian Ehmke & Henriette Koch, 2021. "Advanced loading constraints for 3D vehicle routing problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 835-875, December.
    15. Dirk Männel & Andreas Bortfeldt, 2015. "A Hybrid Algorithm for the Vehicle Routing Problem with Pickup and Delivery and 3D Loading Constraints," FEMM Working Papers 150015, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    16. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.
    17. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Chris T., 2013. "Integrated distribution and loading planning via a compact metaheuristic algorithm," European Journal of Operational Research, Elsevier, vol. 228(1), pages 56-71.
    18. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    19. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2012. "The Pallet-Packing Vehicle Routing Problem," Transportation Science, INFORMS, vol. 46(3), pages 341-358, August.
    20. Bortfeldt, Andreas & Hahn, Thomas & Männel, Dirk & Mönch, Lars, 2015. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 82-96.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:299:y:2022:i:2:p:706-721. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.