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

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

By: jacobsadm

June 5, 2013

examplepub
  • Author(s):
    Cruz, F.R.B., Woensel, T. van, MacGregor Smith, J. & Lieckens, K.
  •  

  • Appeared In: European Journal of Operational Research
  • Volume: 201, 2010
  • Issue: 1
  • Pages: 183 – 193

Abstract

  • 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.

 

Categories: