Hansknecht, ChristophStiller, Sebastian2021-12-172021-12-172015-12-112197-8085https://depositonce.tu-berlin.de/handle/11303/15830http://dx.doi.org/10.14279/depositonce-14603We 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.en510 MathematikMathematical programmingHeuristics for a collaborative routing problemResearch Paper