Heuristics for a collaborative routing problem

dc.contributor.author	Hansknecht, Christoph
dc.contributor.author	Stiller, Sebastian
dc.date.accessioned	2021-12-17T10:12:54Z
dc.date.available	2021-12-17T10:12:54Z
dc.date.issued	2015-12-11
dc.description.abstract	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.	en
dc.identifier.issn	2197-8085
dc.identifier.uri	https://depositonce.tu-berlin.de/handle/11303/15830
dc.identifier.uri	http://dx.doi.org/10.14279/depositonce-14603
dc.language.iso	en	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.subject.ddc	510 Mathematik	en
dc.subject.other	Mathematical programming	en
dc.title	Heuristics for a collaborative routing problem	en
dc.type	Research Paper	en
dc.type.version	submittedVersion	en
tub.accessrights.dnb	free	en
tub.affiliation	Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik	de
tub.affiliation.faculty	Fak. 2 Mathematik und Naturwissenschaften	de
tub.affiliation.institute	Inst. Mathematik	de
tub.publisher.universityorinstitution	Technische Universität Berlin	en
tub.series.issuenumber	2015, 33	en
tub.series.name	Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin	en
tub.subject.msc2000	65K05 Mathematical programming	en

Now showing 1 - 1 of 1