Heuristics for a collaborative routing problem

dc.contributor.authorHansknecht, Christoph
dc.contributor.authorStiller, Sebastian
dc.date.accessioned2021-12-17T10:12:54Z
dc.date.available2021-12-17T10:12:54Z
dc.date.issued2015-12-11
dc.description.abstractWe 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.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15830
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14603
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherMathematical programmingen
dc.titleHeuristics for a collaborative routing problemen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2015, 33en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
tub.subject.msc200065K05 Mathematical programmingen

Files

Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
Preprint-33-2015.pdf
Size:
420.12 KB
Format:
Adobe Portable Document Format

Collections