Summary
In this paper, we propose a Cross Entropy (CE) [1] based multiagent approach for solving static/dynamic traffic assignment problems (TAP). This algorithm utilizes a family of probability distributions in order to guide travelers (agents) to network equilibrium. The route choice probability distribution depends on the average network performance experienced by agents on previous days. Based on the minimization of cross entropy concept, optimal probability distributions are derived iteratively such that high quality routes are more attractive to agents. The advantage of the CE method is that it is based on a mathematical framework and sampling theory, in order to derive the optimal probability distributions guiding agents to the dynamic system equilibrium. Interestingly, we demonstrate that the proposed approach based on CE method coincides with dynamic system approaches. Numerical studies illustrate both nonlinear and bimodal static traffic assignment problems. A comparative study of the proposed method and the dynamic system approach is provided to justify the efficiency of proposed method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rubinstein RY (1999) The Cross-Entropy Method for Combinatorial and Continuous Optimization. Methodology and Computing in Applied Probability, 1(2):127–190.
Patriksson M (1994) The Traffic Assignment Problem–Models and Methods. VSP, Utrecht, The Netherlands.
Wynter L (2001) A convergent algorithm for the multimodal traffic equilibrium problem. Research report. No. 4125, INRIA, France.
Smith MJ (1984) The Stability of Dynamic Model of Traffic Assignment: An Application of Method of Lyapunov. Transportation Science, 18(3):245–252.
Nagurney A, Zhang D (1996) Projected Dynamical Systems and Variational Inequalities with Applications. Kluwer, Boston.
Jin WL (2007) A dynamical system model of the traffic assignment problem. Transportation Research B 41:32–48.
Helvik BE, Wittner O (2001) Using the Cross-Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks. Proc. of 3rd International Workshop on Mobile Agents for Telecommunication Applications.
Aarts EHL, Korst JMH (1989) Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley & Sons.
Buisson C, Lebacque JP, Lesort JB (1995) Macroscopic modelling of traffic flow and assignment in mixed networks. In: Pahl PJ, Werner H (eds) Proc. of the Berlin ICCCBE Conf. 1367-1374.
Lebacque JP, Khoshyaran MM (1999) Modelling vehicular traffic flow on networks using macroscopic models. In Proc. of the FVCA II, 551-558.
Lebacque JP, Mammar S, Haj-Salem, H (2007) Generic second order traffic flow modelling. In Proc. of the 17th ISTTT (International Symposium on Transporation and Traffic Theory), London.
Lebacque JP, Mammar S, Haj-Salem H (2006) Second-order Traffic Flow Modeling : Comments on Rascle and Zhang’s Models. Future appears in Transportation Research B.
Daganzo CF (1994) The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research B 28:269–287.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, TY., Lebacque, JP. (2009). A Cross Entropy Based Multi-Agent Approach to Traffic Assignment Problems. In: Appert-Rolland, C., Chevoir, F., Gondret, P., Lassarre, S., Lebacque, JP., Schreckenberg, M. (eds) Traffic and Granular Flow ’07. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77074-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77074-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77073-2
Online ISBN: 978-3-540-77074-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)