Shortest path tour problem with time windows
Year of publication: |
2020
|
---|---|
Authors: | Di Puglia Pugliese, Luigi ; Ferone, Daniele ; Festa, Paola ; Guerriero, Francesca |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 282.2020, 1 (1.4.), p. 334-344
|
Subject: | Networks | Resource-constrained shortest path problem | Shortest path tour problem | Time windows constraints | Graphentheorie | Graph theory | Tourenplanung | Vehicle routing problem | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
Solving shortest path problems with a weight constraint and replenishment arcs
Smith, Olivia J., (2012)
-
Planning safe navigation routes through mined waters
Babel, Luitpold, (2015)
-
The Traveling Backpacker Problem : a computational comparison of two formulations
Nakamura, Kátia Y., (2018)
- More ...
-
The crowd-shipping with penalty cost function and uncertain travel times
Di Puglia Pugliese, Luigi, (2023)
-
The rainbow Steiner tree problem
Ferone, Daniele, (2022)
-
A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
Ferone, Daniele, (2019)
- More ...