Skip to main content

A Comparison of Heuristic Algorithms for Bus Dispatch

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2017)

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

Included in the following conference series:

Abstract

Bus dispatch (BD) system plays an essential role to ensure the efficiency of public transportation, which has been frequently addressed by the heuristic algorithms. In this paper, five well-exploited heuristic algorithms, i.e. Genetic algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony algorithm (ABC), Bacterial Foraging Optimization (BFO) and Differential Evolution algorithm (DE), are employed and compared for solving the problem of BD. The comparison results indicate that DE is the best method in dealing with the problem of BD in terms of mean, minimum, and maximum, while BFO obtains the minor lower value of standard deviation and achieves the similar convergence speed in comparison to DE. The performance of PSO seems to outperform the remaining two algorithms (i.e. ABC and GA) in most cases. However, among five algorithms, GA achieves the worst results in terms of the weight estimated objective (i.e. number of departures and average waiting time).

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

References

  1. Wei, M., Jin, W., Sun, B.: Model and algorithm for regional bus scheduling with stochastic travel time. J. Highw. Transp. Res. Dev. 28(10), 124–129 (2011)

    Google Scholar 

  2. Zhang, R.H., Jia, J.M.: Genetic algorithm’s application in bus dispatch optimization. In: International Conference of Chinese Transportation Professionals, pp. 137–146 (2011)

    Google Scholar 

  3. Wang, M., Wang, K.: Study on bus scheduling based on particle swarm optimization. Inf. Technol. 12, 111–113 (2009)

    Google Scholar 

  4. Wei, Z., Zhao, X., Wang, K., et al.: Bus dispatching interval optimization based on adaptive bacteria foraging algorithm. Math. Prob. Eng. 2012(3), 1 (2012)

    Google Scholar 

  5. Liu, Q.: Differential evolution bacteria foraging optimization algorithm for bus scheduling problem. J. Transp. Syst. Eng. Inf. Technol. 12(2), 156–161 (2012)

    Google Scholar 

  6. Fang, Z.X.: Research of bus scheduling optimization based on chemokine guide BFO algorithm. Doctoral dissertation, Northeastern University (2013). (in Chinese)

    Google Scholar 

  7. Ding, Y., Jiang, F., Wu, Y.Y.: Application of genetic algorithm in public transportation scheduling. Comput. Sci. 43(S2), 601–603 (2016)

    Google Scholar 

  8. Holand, J.H.: Adaption in natural and artificial systems. Control Artif. Intell. 6(2), 126–137 (1975). University of Michigan Press

    Google Scholar 

  9. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Piscataway, pp. 1942–1948 (1995)

    Google Scholar 

  10. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Engineering Faculty, Computer Engineering Department, Erciyes University, Technical report - TR06 (2005)

    Google Scholar 

  11. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. 22(3), 52–67 (2002)

    Article  Google Scholar 

  13. Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Niu, B., Wang, J., Wang, H.: Bacterial-inspired algorithms for solving constrained optimization problems. Neurocomputing 148, 54–62 (2015)

    Article  Google Scholar 

  15. El-Abd, M.: Performance assessment of foraging algorithms vs evolutionary algorithms. Inf. Sci. 182(1), 243–263 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgment

This work is partially supported by The National Natural Science Foundation of China (Grants Nos. 71571120, 71271140, 61603310, 71471158, 71001072, 61472257), The Humanity and Social Science Youth Foundation of Ministry of Education of China (16YJC630153), Natural Science Foundation of Guangdong Province (2016A030310074) and Shenzhen Science and Technology Plan (CXZZ20140418182638764), the Fundamental Research Funds for the Central Universities Nos. XDJK2014C082, XDJK2013B029, SWU114091.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Chen Yang , Ya Li or Jaejong Baek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wang, H., Zuo, L., Liu, J., Yang, C., Li, Y., Baek, J. (2017). A Comparison of Heuristic Algorithms for Bus Dispatch. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10386. Springer, Cham. https://doi.org/10.1007/978-3-319-61833-3_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61833-3_54

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61832-6

  • Online ISBN: 978-3-319-61833-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics