Skip to main content

Self-adaptive Length Genetic Algorithm for Urban Rerouting Problem

  • Conference paper
Advances in Natural Computation (ICNC 2006)

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

Included in the following conference series:

Abstract

Vehicle rerouting can reduce the travel cost in high-volume traffic network by real-time information. However, it is a computational challenge. A self-adaptive string length evolution strategy was presented so as to meet the inconstant intersection number in different potential routes. String length would be adjusted according to the intersection number. Simulation results showed it could work well in the urban rerouting problem.

The work is supported by National Natural Science Foundation of China (60134010) and Talent Recruitment Foundation of NUAA (S0398-071).

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

References

  1. Oscar, F., Shirish, J.: Traffic simulation application to plan real-time distribution route. In: Winter Simulation Conference Proceedings, vol. 2, pp. 1214–1218 (2002)

    Google Scholar 

  2. Kim, S., Lewis, M.E., White III, C.C.: Optimal vehicle routing with real-time traffic information. IEEE Trans. Intell. Transp. Syst. 6(2), 178–188 (2005)

    Article  Google Scholar 

  3. Kim, S., Lewis, M.E., White III, C.C.: State space reduction for nonstationary stochastic shortest path problems with real-time traffic information. IEEE Trans. Intell. Transp. Syst. 6(3), 273–284 (2005)

    Article  Google Scholar 

  4. Waller, S.T., Ziliaskopoulos, A.K.: On the online shortest path problem with limited arc cost dependencies. Networks 40(4), 216–227 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fu, L.: An adaptive routing algorithm for in vehicle route guidance systems with real-time information. Transp. Res., pt. B 35(8), 749–765 (2001)

    Article  Google Scholar 

  6. Bielli, M., Caramia, M., Carotenuto, P.: Genetic algorithms in bus network optimization. Transp. Res., pt. C 10(1), 19–34 (2002)

    Article  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

Cao, L., Shi, Z., Bao, P. (2006). Self-adaptive Length Genetic Algorithm for Urban Rerouting Problem. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_97

Download citation

  • DOI: https://doi.org/10.1007/11881070_97

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45901-9

  • Online ISBN: 978-3-540-45902-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics