Heuristics for a collaborative routing problem
Source file is available as :   Portable Document Format (PDF)

Author(s) : Christoph Hansknecht , Sebastian Stiller

Preprint series of the Institute of Mathematics, Technische Universität Berlin
Preprint 33-2015

MSC 2000

65K05 Mathematical programming

Abstract :
We study the problem of computing socially optimal routes with re- spect to a game-theoretic dynamic flow model. We consider different algorithms to heuristically solve the problem and compare their perfor- mance.