IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v9y2025i2p70-d1666570.html
   My bibliography  Save this article

Modular Coordination of Vehicle Routing and Bin Packing Problems in Last Mile Logistics

Author

Listed:
  • Nikica Perić

    (Laboratory for Renewable Energy Systems, Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia)

  • Anđelko Kolak

    (Laboratory for Renewable Energy Systems, Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia)

  • Vinko Lešić

    (Laboratory for Renewable Energy Systems, Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia)

Abstract

Background : Logistics and transport, core of many business processes, are continuously optimized to improve efficiency and market competitiveness. The paper describes a modular coordination of vehicle routing and bin packing problems that enables independent instances of the problems to be joined together, with the aim that the vehicle routing solution satisfies all the constraints from real-world applications. Methods : The vehicle routing algorithm is based on an adaptive memory procedure that also incorporates a simple, one-dimensional bin packing problem. This preliminary packing solution is refined by a complex, three dimensional bin packing for each vehicle to identify the infeasible packages. The method iteratively adjusts virtual volumes until reaching near-optimal routes that respect bin-packing constraints. Results : The coordination enables independent applications of an adaptive memory procedure to vehicle routing and a genetic algorithm approach to bin packing while joining them in a computationally tractable way. Such a coordinated approach is applied to a frequently used public benchmark and proven to provide commensurate costs while significantly lowering algorithm complexity. Conclusions : The proposed method is further validated on a real industrial case study and provided additional savings of 14.48% in average daily distance traveled compared to the current industrial standard.

Suggested Citation

  • Nikica Perić & Anđelko Kolak & Vinko Lešić, 2025. "Modular Coordination of Vehicle Routing and Bin Packing Problems in Last Mile Logistics," Logistics, MDPI, vol. 9(2), pages 1-27, May.
    • Handle: RePEc:gam:jlogis:v:9:y:2025:i:2:p:70-:d:1666570
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/9/2/70/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/9/2/70/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    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. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 2002. "Heuristic algorithms for the three-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 410-420, September.
    3. 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.
    4. Paquay, Célia & Limbourg, Sabine & Schyns, Michaël, 2018. "A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints," European Journal of Operational Research, Elsevier, vol. 267(1), pages 52-64.
    5. 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.
    6. Amira Saker & Amr Eltawil & Islam Ali, 2023. "Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers," Logistics, MDPI, vol. 7(4), pages 1-27, October.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    8. Chi, Jushang & He, Shiwei, 2023. "Pickup capacitated vehicle routing problem with three-dimensional loading constraints: Model and algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    9. J Levine & F Ducatelle, 2004. "Ant colony optimization and local search for bin packing and cutting stock problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 705-716, July.
    10. Ana Moura & Telmo Pinto & Cláudio Alves & José Valério de Carvalho, 2023. "A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(3), pages 1-16, January.
    Full references (including those not matched with items on IDEAS)

    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. Leloup, Emeline & Paquay, Célia & Pironet, Thierry & Oliveira, José Fernando, 2025. "A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows," European Journal of Operational Research, Elsevier, vol. 323(1), pages 45-61.
    2. Yiling Li & Zhiwen Yang & Si Zhang & Wenting Liu, 2024. "A Study of the Capacitated Vehicle Routing Problem with Time-Window and Three-Dimensional Loading Constraints in Land–Sea Transport," Sustainability, MDPI, vol. 16(23), pages 1-26, November.
    3. Wang, Yong & Wei, Yuanfan & Wei, Yuanhan & Zhen, Lu & Deng, Shejun, 2025. "Collaborative multidepot split delivery network design with three-dimensional loading constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    12. Ferreira, Kamyla Maria & de Queiroz, Thiago Alves & Munari, Pedro & Toledo, Franklina Maria Bragion, 2024. "A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery," European Journal of Operational Research, Elsevier, vol. 316(2), pages 597-616.
    13. 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.
    14. 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.
    15. 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.
    16. Nima Pourmohammadreza & Mohammad Reza Akbari Jokar, 2023. "A Novel Two-Phase Approach for Optimization of the Last-Mile Delivery Problem with Service Options," Sustainability, MDPI, vol. 15(10), pages 1-25, May.
    17. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    18. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    19. 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.
    20. Wei, Lijun & Zhang, Zhenzhen & Zhang, Defu & Leung, Stephen C.H., 2018. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 265(3), pages 843-859.

    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:gam:jlogis:v:9:y:2025:i:2:p:70-:d:1666570. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.