Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14678
For citation please use:
Main Title: Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion
Author(s): Jahn, Olaf
Möhring, Rolf H.
Schulz, Andreas S.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15905
http://dx.doi.org/10.14279/depositonce-14678
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: When traffic flows are routed through a road network it is desirable to minimize the total road usage. Since a route guidance system can only recommend paths to the drivers, special care has to be taken not to route them over paths they perceive as too long. This leads in a simplified model to a nonlinear multicommodity flow problem with constraints on the available paths. In this article an algorithm for this problem is given, which combines the convex combinations algorithm by Frank and Wolfe with column generation and algorithms for the constrained shortest path problem. Computational results stemming from a cooperation with DaimlerChrysler are presented.
Subject(s): Frank-Wolfe
Dantzig-Wolfe
traffic flows
route guidance
traffic routing
system optimum
constrained shortest path problem
multicommodity flow
Issue Date: 1999
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C35 Programming involving graphs or networks
90B20 Traffic problems
90C25 Convex programming
90C27 Combinatorial optimization
90C90 Applications of mathematical programming
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1999, 658
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-658-1999.pdf
Format: Adobe PDF | Size: 296.82 kB
DownloadShow Preview
Thumbnail
Report-658-1999.ps.gz
Format: Unknown | Size: 191.7 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.