Exact and heuristic approaches to truck–drone delivery problems.

dc.contributor.authorFreitas, Júlia Cária de
dc.contributor.authorPenna, Puca Huachi Vaz
dc.contributor.authorToffolo, Túlio Ângelo Machado
dc.date.accessioned2023-07-26T19:16:48Z
dc.date.available2023-07-26T19:16:48Z
dc.date.issued2023pt_BR
dc.description.abstractCollaborative delivery employing drones in last-mile delivery has been an extensively studied topic in recent years. In this paper, it is studied Truck–Drone Delivery Problems (TDDPs) in which a traditional delivery truck is gathered with a drone to cut delivery times and costs. The vehicles work together in a hybrid operation involving one drone launching from a larger vehicle that operates as a mobile depot and a recharging platform. The drone launches from the truck with a single package to deliver to a customer. Each drone must return to the truck to recharge batteries, pick up another package, and launch again to a new customer location. This work proposes a novel Mixed Integer Programming (MIP) formulation and a heuristic approach to address the problem. The proposed MIP formulation yields better linear relaxation bounds than previously proposed formulations for all instances, and was capable of optimally solving several unsolved instances from the literature. A hybrid heuristic based on the General Variable Neighborhood Search metaheuristic combining Tabu Search concepts is employed to obtain high-quality solutions for large-size instances. The efficiency of the algorithm was evaluated on 1415 benchmark instances from the literature, and over 80% of the best known solutions were improved.pt_BR
dc.identifier.citationFREITAS, J. C. de; PENNA, P. H. V.; TOFFOLO, T. A. M. Exact and heuristic approaches to truck–drone delivery problems. EURO Journal on Transportation and Logistics, v. 12, artigo 100094, 2023. Disponível em: <https://www.sciencedirect.com/science/article/pii/S219243762200019X>. Acesso em: 06 jul. 2023.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.ejtl.2022.100094pt_BR
dc.identifier.issn2192-4376
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/17066
dc.language.isoen_USpt_BR
dc.rightsabertopt_BR
dc.rights.licenseThis is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). Fonte: PDF do artigo.pt_BR
dc.subjectUnmanned aerial vehiclept_BR
dc.subjectTraveling salesman problempt_BR
dc.subjectMixed-integer programmingpt_BR
dc.subjectGeneral variable neighborhood searchpt_BR
dc.titleExact and heuristic approaches to truck–drone delivery problems.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Arquivos
Pacote Original
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
ARTIGO_ExactHeuristicApproaches.pdf
Tamanho:
1.43 MB
Formato:
Adobe Portable Document Format
Descrição:
Licença do Pacote
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: