Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem

Toni Pacheco (), Rafael Martinelli (), Anand Subramanian (), Túlio A. M. Toffolo () and Thibaut Vidal ()
Additional contact information
Toni Pacheco: Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro 22541-041, Brazil
Rafael Martinelli: Departamento de Engenharia Industrial, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro 22541-041, Brazil
Anand Subramanian: Departamento de Sistemas de Computação, Centro de Informática, Universidade Federal da Paraíba, Paraíba 58051-900, Brazil
Túlio A. M. Toffolo: Department of Computing, Federal University of Ouro Preto, Ouro Preto, Minas Gerais 35400-000, Brazil
Thibaut Vidal: Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro 22541-041, Brazil; Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Québec H3T 1J4, Canada

Transportation Science, 2023, vol. 57, issue 2, 463-481

Abstract: Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. Whereas neighborhood exploration procedures are well-developed for problems with individual services, their counterparts for one-to-one pickup-and-delivery problems are more scarcely studied. A direct extension of classic neighborhoods is often inefficient or complex because of 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 classic R elocate P air neighborhood can be fully explored in O ( n 2 ) instead of O ( n 3 ) time. We adapt the 4-O pt and B alas –S imonetti neighborhoods to consider precedence constraints. Moreover, we introduce an exponential-size neighborhood called 2 k -O pt , which includes all solutions generated by multiple nested 2-O pts 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 us 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.

Keywords: local search; large neighborhood search; dynamic programming; computational complexity; pickup-and-delivery problem (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2022.1176 (application/pdf)

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:inm:ortrsc:v:57:y:2023:i:2:p:463-481

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().