A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup

Ana Moura, Telmo Pinto (), Cláudio Alves and José Valério de Carvalho
Additional contact information
Ana Moura: University of Aveiro, GOVCOPP, Systems for Decision Support Research Group, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal
Telmo Pinto: University of Coimbra, CEMMPRE, Department of Mechanical Engineering, 3000-370 Coimbra, Portugal
Cláudio Alves: University of Minho, Centro ALGORITMI, Campus de Gualtar, 4710-057 Braga, Portugal
José Valério de Carvalho: University of Minho, Centro ALGORITMI, Campus de Gualtar, 4710-057 Braga, Portugal

Mathematics, 2023, vol. 11, issue 3, 1-16

Abstract: This work presents a hybrid approach to solve a distribution problem of a Portuguese company in the automotive industry. The objective is to determine the minimum cost for daily distribution operations, such as collecting and delivering goods to multiple suppliers. Additional constraints are explicitly considered, such as time windows and loading constraints due to the limited capacity of the fleet in terms of weight and volume. An exhaustive review of the state of the art was conducted, presenting different typology schemes from the literature for the pickup and delivery problems in the distribution field. Two mathematical models were integrated within a matheuristic approach. One model reflects the combination of the Vehicle Routing Problem with Simultaneous Delivery and Pickup with the Capacitated Vehicle Routing Problem with Time Windows. The second one aims to pack all the items to be delivered onto the pallets, reflecting a three-dimensional single bin size Bin Packing Problem. Both formulations proposed—a commodity-flow model and a formulation of the Three-Dimensional Packing Problem must be solved within the matheuristic. All the approaches were tested using real instances from data provided by the company. Additional computational experiments using benchmark instances were also performed.

Keywords: vehicle routing problem with simultaneous delivery and pickup; capacitated vehicle routing problem with time windows; three-dimensional bin packing problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/3/713/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/3/713/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:3:p:713-:d:1052283

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().