On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks
The classical Wardrop System Optimum assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of the system optimum model lies on its well-recognized ability of producing solutions that correspond to the most efficient way of using the scarce resources represented by the street and road capacities. In this paper, we present a version of the system optimum model in which the travel costs incurred on each path come from M/G/c/c state-dependent queueing networks, a stochastic travel time estimation formula which takes into account congestion effects. A Differential Evolution algorithm is proposed to solve the model. We motivate this version of the problem in several ways and computational results show that the proposed approach is efficient.
Year of publication: |
2010
|
---|---|
Authors: | Cruz, F.R.B. ; van Woensel, T. ; MacGregor Smith, J. ; Lieckens, K. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 201.2010, 1, p. 183-193
|
Publisher: |
Elsevier |
Keywords: | System optimum Traffic assignment Queueing networks Genetic Algorithms |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Mining Pareto-optimal modules for delayed product differentiation
Cruz, F.R.B., (2010)
-
M/G/c/c state dependent travel time models and properties
MacGregor Smith, J., (2014)
-
Algorithms for a multi-level network optimization problem
Cruz, F.R.B., (1999)
- More ...