|
|
|
|
|
Spyros Kontogiannis, Andreas Paraskevopoulos and Christos Zaroliagis
We consider the problem of computing a set of meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent alternative route ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christoph Hansknecht, Imke Joormann and Sebastian Stiller
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with res...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ben Strasser, Dorothea Wagner and Tim Zeitz
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques foll...
ver más
|
|
|
|
|
|
|
|
|
|
|
Franti?ek Kolovský, Jan Je?ek and Ivana Kolingerová
|
|
|
|
|
|
|
|
|
|
|
Daganzo, C. F.
Pág. 665 - 668
|
|
|
|
|
|