|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Gianpaolo Ghiani, Tommaso Adamo, Pierpaolo Greco and Emanuela Guerriero
In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniq...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó
Pág. 1080 - 1087
Journey planning is a key process in public transport, where travelers get informed how to make the best use of a given public transport system for their individual travel needs. A common trait of most available journey planners is that they assume deter...
ver más
|
|
|
|
|
|
|
|
|
|
|
Martin Margreiter
Pág. 525 - 536
This work describes an approach to determine the current travel times on freeways based on the detection and re-identification of Bluetooth devices onboard of vehicles using stationary roadside Bluetooth detection technology. It also aims at using this i...
ver más
|
|
|
|
|
|