Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem.

Simple item page
dc.contributor.authorPacheco, Toni Tiago da Silva
dc.contributor.authorPinto, Rafael Martinelli
dc.contributor.authorSubramanian, Anand
dc.contributor.authorToffolo, Túlio Ângelo Machado
dc.contributor.authorVidal, Thibaut Victor Gaston
dc.date.accessioned2023-07-24T21:31:21Z
dc.date.available2023-07-24T21:31:21Z
dc.date.issued2022pt_BR
dc.description.abstractNeighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for problems with individual services, their counterparts for one-to-one pickup-and-delivery problems have been more scarcely studied. A direct extension of classic neighborhoods is often inefficient or complex due to the necessity of jointly considering service pairs. To circumvent these issues, we introduce major improvements to existing neighborhood searches for the pickup-and-delivery traveling salesman problem and new large neighborhoods. We show that the classical Relocate-Pair neighborhood can be fully explored in O(n 2 ) instead of O(n 3 ) time. We adapt the 4-Opt and Balas-Simonetti neighborhoods to consider precedence constraints. Moreover, we introduce an exponential-size neighborhood called 2k-Opt, which includes all solutions generated by multiple nested 2-Opts and can be searched in O(n 2 ) time using dynamic programming. We conduct extensive computational experiments, highlighting the significant contribution of these new neighborhoods and speedup strategies within two classical metaheuristics. Notably, our approach permits to repeatedly solve small pickup-and-delivery problem instances to optimality or near-optimality within milliseconds, and therefore it represents a valuable tool for time-critical applications such as meal delivery or mobility on demand.pt_BR
dc.identifier.citationPACHECO, T. T. da S. et al. Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem. Transportation Science, v. 57, n. 2, 2022. Disponível em: <https://pubsonline.informs.org/doi/abs/10.1287/trsc.2022.1176?journalCode=trsc>. Acesso em: 06 jul. 2023.pt_BR
dc.identifier.doihttps://doi.org/10.1287/trsc.2022.1176pt_BR
dc.identifier.issn1526-5447
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/17054
dc.identifier.uri2https://pubsonline.informs.org/doi/abs/10.1287/trsc.2022.1176?journalCode=trscpt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectLocal searchpt_BR
dc.subjectLarge neighborhood searchpt_BR
dc.subjectDynamic programmingpt_BR
dc.subjectComputational complexitypt_BR
dc.titleExponential-size neighborhoods for the pickup-and-delivery traveling salesman problem.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_ExponentialSizeNeigborhoods.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DECOM - Artigos publicados em periódicos