4.7 Article

On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 201, Issue 1, Pages 183-193

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2009.03.006

Keywords

System optimum; Traffic assignment; Queueing networks; Genetic Algorithms

Funding

  1. Ministry for Science and Technology of Brazil [201046/1994-6, 301809/1996-8, 307702/2004-9, 472066/2004-8, 472877/2006-2, 304944/2007-6]
  2. CAPES (Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior) [BEX-0522/07-4]
  3. FAPEMIG (Fundacao de Amparoa Pesquisa do Estado de Minas Gerais) [CEX-289/98, CEX-855/98, TEC-875/07, CEX-PPM00401/08]

Ask authors/readers for more resources

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. (C) 2009 Elsevier B. V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available