Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/113954
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Moura, Ana | - |
dc.contributor.author | Pinto, Telmo | - |
dc.contributor.author | Alves, Cláudio | - |
dc.contributor.author | Valério de Carvalho, José | - |
dc.date.accessioned | 2024-03-12T12:45:15Z | - |
dc.date.available | 2024-03-12T12:45:15Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 2227-7390 | pt |
dc.identifier.uri | https://hdl.handle.net/10316/113954 | - |
dc.description.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. | pt |
dc.language.iso | eng | pt |
dc.publisher | MDPI | pt |
dc.relation | UIDB/00285/2020 | pt |
dc.relation | UIDB/00319/2020 | pt |
dc.relation | UIDB/04058/2020 | pt |
dc.relation | UIDP/04058/2020 | pt |
dc.relation | POCI-01-0247-FEDER-072638 | pt |
dc.rights | openAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt |
dc.subject | vehicle routing problem with simultaneous delivery and pickup | pt |
dc.subject | capacitated vehicle routing problem with time windows | pt |
dc.subject | three-dimensional bin packing problem | pt |
dc.title | A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup | pt |
dc.type | article | - |
degois.publication.firstPage | 713 | pt |
degois.publication.issue | 3 | pt |
degois.publication.title | Mathematics | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.3390/math11030713 | pt |
degois.publication.volume | 11 | pt |
dc.date.embargo | 2023-01-01 | * |
uc.date.periodoEmbargo | 0 | pt |
item.openairetype | article | - |
item.fulltext | Com Texto completo | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.project.grantno | Centre for Mechanical Enginnering, Materials and Processes | - |
crisitem.project.grantno | ALGORITMI Research Center | - |
crisitem.project.grantno | Research Unit on Governance, Competitiveness and Public Policy | - |
Aparece nas coleções: | FCTUC Eng.Mecânica - Artigos em Revistas Internacionais I&D CEMMPRE - Artigos em Revistas Internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
A-Matheuristic-Approach-to-the-Integration-of-ThreeDimensional-Bin-Packing-Problem-and-Vehicle-Routing-Problem-with-Simultaneous-Delivery-and-PickupMathematics.pdf | 287.42 kB | Adobe PDF | Ver/Abrir |
Visualizações de página
59
Visto em 17/jul/2024
Downloads
17
Visto em 17/jul/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Este registo está protegido por Licença Creative Commons