Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation

  • Conference paper
Ant Colony Optimization and Swarm Intelligence (ANTS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4150))

Abstract

In this paper we propose a Stochastic User Equilibrium (SUE) algorithm that can be adopted as a model, known as a simulation model, that imitates the behaviour of transportation systems. Indeed, analyses of real dimension networks need simulation algorithms that allow network conditions and performances to be rapidly determined. Hence, we developed an MSA (Method of Successive Averages) algorithm based on the Ant Colony Optimisation paradigm that allows transportation systems to be simulated in less time but with the same accuracy as traditional MSA algorithms. Finally, by means of Blum’s theorem, we stated theoretically the convergence of the proposed ACO-based algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cantarella, G.E.: A general fixed-point approach to multimodal multi-user equilibrium assignment with elastic demand. Transport. Sci. 31, 107–128 (1997)

    Article  MATH  Google Scholar 

  2. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F.J., Bourgine, P. (eds.) Toward a practice of autonomous systems: Proceedings of the First European Conference on Artificial Life, pp. 134–142. The MIT Press, Cambridge (1992)

    Google Scholar 

  3. Colorni, A., Dorigo, M., Maniezzo, V.: An investigation of some properties of an ant algorithm. In: Männer, R., Manderick, B. (eds.) Proceedings of PPSN II, pp. 509–520. Elsevier, Amsterdam (1992)

    Google Scholar 

  4. Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD thesis, Department of Electronics, Polytechnic of Milan, Italy (1992)

    Google Scholar 

  5. Dorigo, M., Stützle, T.: Ant colony optimization. The MIT Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  6. Poorzahedy, H., Abulghasemi, F.: Application of ant system to network design problem. Transportation 32, 251–273 (2005)

    Article  Google Scholar 

  7. Mussone, L., Ponzi, M., Matteucci, M.: Ant colony optimization for stochastic user equilibrium. In: Bifulco, G.N. (ed.) I sistemi stradali di trasporto nella societá dell’informazione, pp. 175–199. Aracne Editrice (2005)

    Google Scholar 

  8. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Log. Quart. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  9. Gutjahr, W.J.: A graph-based ant system and its convergence. Future Gener. Comp. Sy. 16, 873–888 (2000)

    Article  Google Scholar 

  10. Gutjahr, W.J.: A converging ACO algorithm for stochastic combinatorial optimization. In: Albrecht, A.A., Steinhöfel, K. (eds.) SAGA 2003. LNCS, vol. 2827, pp. 10–25. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Chang, H.S., Gutjahr, W.J., Yang, J., Park, S.: An ant system based approach to markov decision processes. In: Proceedings of the 2004 American Control Conference, Boston (MA), USA, pp. 3820–3825 (2004)

    Google Scholar 

  12. Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344, 243–278 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cascetta, E.: Transportation systems engineering: theory and methods. Kluwer Academic Publisher, Dordrecht (2001)

    MATH  Google Scholar 

  14. Blum, J.R.: Multidimensional stochastic approximation methods. Ann. Math. Stat. 25, 737–744 (1954)

    Article  MATH  MathSciNet  Google Scholar 

  15. Dial, R.B.: A probabilistic multipath traffic assignment model which obviates path enumeration. Transport. Res. 5, 83–111 (1971)

    Article  Google Scholar 

  16. D’Acierno, L., Montella, B., Gallo, M.: Multimodal assignment to congested networks: fixed-point models and algorithms. In: Proceedings of European Transport Conference 2002, Cambridge, United Kingdom (2002)

    Google Scholar 

  17. Li, Y., Gong, S.: Dynamic ant colony optimisation for TSP. Int. J. Adv. Manuf. Tech. 22, 528–533 (2003)

    Article  Google Scholar 

  18. Nguyen, S., Pallottino, S., Gendreau, M.: Implicit enumeration of hyperpaths in a logit model for transit networks. Transport. Sci. 32, 54–64 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Acierno, L., Montella, B., De Lucia, F. (2006). A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_3

Download citation

  • DOI: https://doi.org/10.1007/11839088_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38482-3

  • Online ISBN: 978-3-540-38483-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics