Loading…
Heuristics for a collaborative routing problem
Heuristics for a collaborative routing problem
Hansknecht, Christoph; Stiller, Sebastian
Inst. Mathematik
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.
