Skip to main content

Optimizing Urban Public Transportation with Ant Colony Algorithm

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9875))

Included in the following conference series:

Abstract

Transport system in most cities has some problems and should be optimized. In particular, timetable of the city public transportation needs to be changed. Metaheuristic methods for timetabling were considered the most efficient. Ant algorithm was chosen as one of these methods. It was adapted for optimization of an urban public transport timetable. A timetable for one bus route in the city of Tomsk, Russia was created on the basis of the developed software. Different combinations of parameters in ant algorithm allow obtaining new variants of the timetable that better fit passengers’ needs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Similar content being viewed by others

References

  1. Yurchenko, M., Kochegurova, E., Fadeev, A., Piletskya, A.: Calculation of performance indicators for passenger transport based on telemetry information. In: Engineering Technology, Engineering Education and Engineering Management, pp. 847–852. Taylor & Francis Group, London (2015)

    Google Scholar 

  2. Guihaire, V., Hao, J.K.: Transit network design and scheduling: a global review. Transp. Res. Part A: Policy Pract. 42(10), 1251–1273 (2008)

    Google Scholar 

  3. Zhao, F., Zeng, X.: Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. Eur. J. Oper. Res. 186(2), 841–845 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Yu, B., Yang, Z., Sun, X., Yao, B., Zeng, Q., Jeppesen, E.: Parallel genetic algorithm in bus route headway optimization. Appl. Soft Comput. 11(8), 5081–5091 (2011)

    Article  Google Scholar 

  5. Dorigo, M., Maniezzo, V., Colomi, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26, 29–41 (1996). IEEE

    Article  Google Scholar 

  6. Lazarev, A.A., Gafarov, E.R.: Teoriya raspisanii. Zadachi i algoritmi, Moskva, Moskovskii gosudarstvennyi universitet im. M.V. Lomonosova (MGU), 222 p (2011). (in Russian)

    Google Scholar 

  7. Eliseev, M.E., Lipenkov, A.V., Eliseev, E.M.: O modeli gorodskogo passazhirskogo transporta: modelirovanie logiki passaghira 3(90), 347–352 (2011). Transactions of Nizhny Novgorod State Technical University n.a. R.E. Alekseev

    Google Scholar 

  8. Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)

    Article  Google Scholar 

  9. Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181–5197 (2011)

    Article  Google Scholar 

  10. Martynova, Y.A., Shutova, Y.O., Martynov, Y.A., Kochegurova, E.A.: Ant colony algorithm for rational transit network design of urban passenger transport. In: International Scientific Symposium Lifelong Wellbeing in the World (WELLSO-2014), pp. 48–55, TPU Publishing House, Tomsk (2014)

    Google Scholar 

  11. Alba, E., Doerner, K.F., Dorronsoro, B.: Adapting the savings based ant system for non-stationary vehicle routing problems. In: Proceedings of the META 2006, Tunisia (2006)

    Google Scholar 

  12. Zidi, S., Maouche, S.: Ant colony optimization for the rescheduling of multimodal transport networks. In: IMACS Multiconference on Computational Engineering in Systems Applications, vol. 1, pp. 965–971. IEEE (2006)

    Google Scholar 

  13. D’Acierno, L., Gallo, M., Montella, B.: Ant colony optimisation approaches for the transportation assignment problem. In: 16th International Conference on Urban Transport and the Environment, pp. 37–48 (2010)

    Google Scholar 

  14. Gilmour, S., Dras, M.: Understanding the pheromone system within ant colony optimization. In: Zhang, S., Jarvis, R.A. (eds.) AI 2005. LNCS (LNAI), vol. 3809, pp. 786–789. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Wong, K.Y., See, P.C.: A new minimum pheromone threshold strategy (MPTS) for max–min ant system. Appl. Soft Comput. 9(3), 882–888 (2009)

    Article  Google Scholar 

  16. Borshchev, A.: The Big Book of Simulation Modeling: Multimethod Modeling with AnyLogic 6. AnyLogic North America, Chicago (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Elena Kochegurova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kochegurova, E., Gorokhova, E. (2016). Optimizing Urban Public Transportation with Ant Colony Algorithm. In: Nguyen, NT., Iliadis, L., Manolopoulos, Y., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2016. Lecture Notes in Computer Science(), vol 9875. Springer, Cham. https://doi.org/10.1007/978-3-319-45243-2_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45243-2_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45242-5

  • Online ISBN: 978-3-319-45243-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics