A generalized shortest path tour problem with time windows
L. Di Puglia Pugliese (),
D. Ferone (),
P. Festa () and
F. Guerriero ()
Additional contact information
L. Di Puglia Pugliese: Consiglio Nazionale delle Ricerche
D. Ferone: University of Calabria
P. Festa: University of Napoli Federico II
F. Guerriero: University of Calabria
Computational Optimization and Applications, 2022, vol. 83, issue 2, No 7, 593-614
Abstract This paper studies a generalization of the shortest path tour problem with time windows (GSPTPTW). The aim is to find a single-origin single-destination shortest path, which has to pass through an ordered sequence of not necessarily disjoint node-subsets. Each node has a time window for each node-subset to which it belongs. We investigate the theoretical properties of GSPTPTW and propose a dynamic programming approach to solve it. Numerical results collected on a large set of new benchmark instances highlight the effectiveness of the proposed solution approach.
Keywords: Generalized shortest path tour problem; Disjoint subsets; Time windows; Dynamic programming (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00405-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:83:y:2022:i:2:d:10.1007_s10589-022-00405-8
Ordering information: This journal article can be ordered from
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().