A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Repositório Institucional da UFOP |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/10382 https://www.sciencedirect.com/science/article/pii/S1571065318300593 |
Resumo: | Unmanned aerial vehicles (UAV), or drones, have the potential to reduce cost and time in last mile deliveries. This paper presents the scenario which a drone works in collaboration with a delivery truck to distribute parcels. This Traveling Salesman Problem (TSP) variant has some particularities that make the originals constraints insufficient. In more detail must be considered the flying time-limit of the drone that inhibits them from visiting all customers and the parcel must not exceed the payload of the drone. To solve the problem, the initial solution is created from the optimal TSP solution obtained by the Concorde solver. Next, an implementation of the Randomized Variable Neighborhood Descent (RVND) heuristic is used as a local search to obtain the problem solution. To test the proposed heuristic, 11 instances based on the well-known TSP benchmark set were created. Computational experiments show the use of drones for last mile delivery can reduce the total delivery time up to almost 20%. Moreover providing a faster delivery this system has a positive environmental impact as it reduces the truck travel distance. |
id |
UFOP_b76f8bfcfbce74131fbc809d5c7f8ca3 |
---|---|
oai_identifier_str |
oai:localhost:123456789/10382 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Freitas, Júlia Cária dePenna, Puca Huachi Vaz2018-10-16T16:19:45Z2018-10-16T16:19:45Z2018FREITAS, J. C. de; PENNA, P. H. V. A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. Electronic notes in discrete mathematics, v. 66, p. 95-102, 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300593>. Acesso em: 16 jun. 2018.15710653http://www.repositorio.ufop.br/handle/123456789/10382https://www.sciencedirect.com/science/article/pii/S1571065318300593Unmanned aerial vehicles (UAV), or drones, have the potential to reduce cost and time in last mile deliveries. This paper presents the scenario which a drone works in collaboration with a delivery truck to distribute parcels. This Traveling Salesman Problem (TSP) variant has some particularities that make the originals constraints insufficient. In more detail must be considered the flying time-limit of the drone that inhibits them from visiting all customers and the parcel must not exceed the payload of the drone. To solve the problem, the initial solution is created from the optimal TSP solution obtained by the Concorde solver. Next, an implementation of the Randomized Variable Neighborhood Descent (RVND) heuristic is used as a local search to obtain the problem solution. To test the proposed heuristic, 11 instances based on the well-known TSP benchmark set were created. Computational experiments show the use of drones for last mile delivery can reduce the total delivery time up to almost 20%. Moreover providing a faster delivery this system has a positive environmental impact as it reduces the truck travel distance.Unmanned aerial vehicleDrone deliveryLast mile deliveryA randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccessporreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/10382/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_RandomizedVariableNeighborhood.pdfARTIGO_RandomizedVariableNeighborhood.pdfapplication/pdf186099http://www.repositorio.ufop.br/bitstream/123456789/10382/1/ARTIGO_RandomizedVariableNeighborhood.pdf7218a2d4c88f620842b077454b1ef2b9MD51123456789/103822020-01-13 06:56:41.923oai:localhost:123456789/10382RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332020-01-13T11:56:41Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
title |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
spellingShingle |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. Freitas, Júlia Cária de Unmanned aerial vehicle Drone delivery Last mile delivery |
title_short |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
title_full |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
title_fullStr |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
title_full_unstemmed |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
title_sort |
A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. |
author |
Freitas, Júlia Cária de |
author_facet |
Freitas, Júlia Cária de Penna, Puca Huachi Vaz |
author_role |
author |
author2 |
Penna, Puca Huachi Vaz |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Freitas, Júlia Cária de Penna, Puca Huachi Vaz |
dc.subject.por.fl_str_mv |
Unmanned aerial vehicle Drone delivery Last mile delivery |
topic |
Unmanned aerial vehicle Drone delivery Last mile delivery |
description |
Unmanned aerial vehicles (UAV), or drones, have the potential to reduce cost and time in last mile deliveries. This paper presents the scenario which a drone works in collaboration with a delivery truck to distribute parcels. This Traveling Salesman Problem (TSP) variant has some particularities that make the originals constraints insufficient. In more detail must be considered the flying time-limit of the drone that inhibits them from visiting all customers and the parcel must not exceed the payload of the drone. To solve the problem, the initial solution is created from the optimal TSP solution obtained by the Concorde solver. Next, an implementation of the Randomized Variable Neighborhood Descent (RVND) heuristic is used as a local search to obtain the problem solution. To test the proposed heuristic, 11 instances based on the well-known TSP benchmark set were created. Computational experiments show the use of drones for last mile delivery can reduce the total delivery time up to almost 20%. Moreover providing a faster delivery this system has a positive environmental impact as it reduces the truck travel distance. |
publishDate |
2018 |
dc.date.accessioned.fl_str_mv |
2018-10-16T16:19:45Z |
dc.date.available.fl_str_mv |
2018-10-16T16:19:45Z |
dc.date.issued.fl_str_mv |
2018 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
FREITAS, J. C. de; PENNA, P. H. V. A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. Electronic notes in discrete mathematics, v. 66, p. 95-102, 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300593>. Acesso em: 16 jun. 2018. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/10382 |
dc.identifier.issn.none.fl_str_mv |
15710653 |
dc.identifier.uri2.pt_BR.fl_str_mv |
https://www.sciencedirect.com/science/article/pii/S1571065318300593 |
identifier_str_mv |
FREITAS, J. C. de; PENNA, P. H. V. A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem. Electronic notes in discrete mathematics, v. 66, p. 95-102, 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S1571065318300593>. Acesso em: 16 jun. 2018. 15710653 |
url |
http://www.repositorio.ufop.br/handle/123456789/10382 https://www.sciencedirect.com/science/article/pii/S1571065318300593 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
bitstream.url.fl_str_mv |
http://www.repositorio.ufop.br/bitstream/123456789/10382/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/10382/1/ARTIGO_RandomizedVariableNeighborhood.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae 7218a2d4c88f620842b077454b1ef2b9 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1801685718339158016 |