Dynamic shortest path problems : hybrid routing policies considering network disruptions
| Year of publication: |
2013
|
|---|---|
| Authors: | Sever, Derya ; Dellaert, Nico ; Van Woensel, Tom ; Kok, A. G. de |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 40.2013, 12, p. 2852-2863
|
| Subject: | Dynamic shortest path problem | Dynamic programming | Disruption handling | Transportation | Online routing | Offline routing | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
The shortest route for transportation in supply chain by minimum spanning tree
Shahin, Arash, (2015)
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
- More ...
-
Taş, D., (2014)
-
Vehicle routing problem with stochastic travel times including soft time windows and service costs
Taș, Duygu, (2013)
-
Online scheduling using a fixed template : the case of outpatient chemotherapy drug administration
Hesaraki, Alireza F., (2023)
- More ...