A generalized shortest path tour problem with time windows

A generalized shortest path tour problem with time windows

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-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications 2022-11, Vol.83 (2), p.593-614
Hauptverfasser: Di Puglia Pugliese, L., Ferone, D., Festa, P., Guerriero, F.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Convex and Discrete Geometry
Dynamic programming
Management Science
Mathematics
Mathematics and Statistics
Network topologies
Nodes
Operations Research
Operations Research/Decision Theory
Optimization
Statistics
Windows (intervals)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-022-00405-8