Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods

Autor:	Felix G. König
Rok vydání:	2007
Předmět:	Dilemma Mathematical optimization symbols.namesake Nonlinear system Mathematical challenges Computer science Lagrangian relaxation Traffic optimization Path (graph theory) symbols Traffic flow Cutting-plane method
Zdroj:	Operations Research Proceedings ISBN: 9783540699941 OR
DOI:	10.1007/978-3-540-69995-8_8
Popis:	The optimization of traffic flow in congested urban road networks faces a well-known dilemma: Optimizing system performance is unfair with respect to the individual drivers’ travel times; and a fair user equilibrium may result in bad system performance. As a remedy, computing a system optimum with fairness conditions, realized by length constraints on the routes actually used by drivers, has been suggested in [5]. This poses interesting mathematical challenges, namely the nonlinearity of the objective function and the necessity to deal with path constraints in large networks. While the authors present results suggesting that solutions to this constrained system optimum problem (CSO) are indeed equally good and fair, they rely on a standard Frank-Wolfe/Partan-algorithm to obtain them.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::841669f9617966dbff87623e684b4531 https://doi.org/10.1007/978-3-540-69995-8_8 Zobrazit plný text záznamu