Thumbnail Image
🆕 Date Issued:
2015-12-11
🗄 In DepositOnce:2021-12-17
Submitted Version

Please use this identifier to cite or link to this item:

Heuristics for a collaborative routing problem

Hansknecht, Christoph; Stiller, Sebastian

Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin

We study the problem of computing socially optimal routes with respect to a game-theoretic dynamic flow model. We consider different algorithms to heuristically solve the problem and compare their performance.
Mathematical programming
In Copyright
Full item page