Skip to main content

Partial-ACO Mutation Strategies to Scale-Up Fleet Optimisation and Improve Air Quality (Best Application Paper)

  • Conference paper
  • First Online:
Artificial Intelligence XXXVII (SGAI 2020)

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

  • 738 Accesses

Abstract

Fleet optimisation can significantly reduce the time vehicles spend traversing road networks leading to lower costs and increased capacity. Moreover, reduced road use leads to lower emissions and improved air quality. Heuristic approaches such as Ant Colony Optimisation (ACO) are effective at solving fleet optimisation but scale poorly when dealing with larger fleets. The Partial-ACO technique has substantially improved ACO’s capacity to optimise large scale vehicle fleets but there is still much scope for improvement. A method to achieve this could be to integrate simple mutation with Partial-ACO as used by other heuristic methods. This paper explores a range of mutation strategies for Partial-ACO to both improve solution quality and reduce computational costs. It is found that substituting a majority of ant simulations with simple mutation operations instead improves both the accuracy and efficiency of Partial-ACO. For real-world fleet optimisation problems of up to 45 vehicles and 437 jobs reductions in fleet traversal of approximately 50% are achieved with much less computational cost enabling larger scale problems to be tackled. Moreover, CO\(_{2}\) and NO\(_{\text {x}}\) emissions are cut by 3.75 Kg and 1.71 g per vehicle a day respectively improving urban air quality.

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

Notes

  1. 1.

    Air pollution levels rising in many of the worlds poorest cities. https://www.who.int/mediacentre/news/releases/2016/air-pollution-rising/en.

References

  1. Calvete, H.I., Galé, C., Oliveros, M.J.: Evolutive and ACO strategies for solving the multi-depot vehicle routing problem. In: IJCCI (ECTA-FCTA), pp. 73–79 (2011)

    Google Scholar 

  2. Chitty, D.M.: Applying ACO to large scale TSP instances. In: Chao, F., Schockaert, S., Zhang, Q. (eds.) UKCI 2017. AISC, vol. 650, pp. 104–118. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-66939-7_9

    Chapter  Google Scholar 

  3. Chitty, D.M., Wanner, E., Parmar, R., Lewis, P.R.: Can bio-inspired swarm algorithms scale to modern societal problems? In: Artificial Life Conference Proceedings, pp. 13–20. MIT Press (2019)

    Google Scholar 

  4. Chitty, D.M., Wanner, E., Parmar, R., Lewis, P.R.: Scaling ACO to large-scale vehicle fleet optimisation via Partial-ACO. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 97–98 (2019)

    Google Scholar 

  5. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  6. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  7. Filipec, M., Skrlec, D., Krajcar, S.: Darwin meets computers: new approach to multiple depot capacitated vehicle routing problem. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol. 1, pp. 421–426. IEEE (1997)

    Google Scholar 

  8. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276–1290 (1994)

    Article  Google Scholar 

  9. Gilbert, L.: The vehicle routing problem: an overview of exact and approximate algorithms. Euro. J. Oper. Res. 59(3), 345–358 (1992)

    Article  Google Scholar 

  10. Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 72–81. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46004-7_8

    Chapter  Google Scholar 

  11. Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press (1975)

    Google Scholar 

  12. Karakatič, S., Podgorelec, V.: A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl. Soft Comput. 27, 519–532 (2015)

    Article  Google Scholar 

  13. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Techn. J. 44(10), 2245–2269 (1965)

    Article  MathSciNet  Google Scholar 

  14. Requia, W.J., Adams, M.D., Arain, A., Papatheodorou, S., Koutrakis, P., Mahmoud, M.: Global association of air pollution and cardiorespiratory diseases: a systematic review, meta-analysis, and investigation of modifier variables. Am. J. Public Health 108(S2), S123–S130 (2018)

    Article  Google Scholar 

  15. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50(10), 1034–1042 (1999)

    Article  Google Scholar 

  16. Shokouhifar, M., Sabet, S.: PMACO: a pheromone-mutation based ant colony optimization for traveling salesman problem. In: 2012 International Symposium on Innovations in Intelligent Systems and Applications, pp. 1–5. IEEE (2012)

    Google Scholar 

  17. Skok, M., Skrlec, D., Krajcar, S.: The non-fixed destination multiple depot capacitated vehicle routing problem and genetic algorithms. In: Proceedings of the 22nd International Conference on Information Technology Interfaces, 2000. ITI 2000, pp. 403–408. IEEE (2000)

    Google Scholar 

  18. Skok, M., Skrlec, D., Krajcar, S.: The genetic algorithm scheduling of vehicles from multiple depots to a number of delivery points. Arfit. Intell. 349 56 (2001)

    Google Scholar 

  19. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. J. Oper. Res. Soc. 23(3), 333–344 (1972)

    Article  Google Scholar 

  20. Yalian, T.: An improved ant colony optimization for multi-depot vehicle routing problem. Int. J. Eng. Technol. 8(5), 385–388 (2016)

    Article  Google Scholar 

  21. Yang, J., Shi, X., Marchese, M., Liang, Y.: An ant colony optimization method for generalized TSP problem. Prog. Nat. Sci. 18(11), 1417–1422 (2008)

    Article  MathSciNet  Google Scholar 

  22. Yao, B., Hu, P., Zhang, M., Tian, X.: Improved ant colony optimization for seafood product delivery routing problem. PROMET-Traffic&Transport. 26(1), 1–10 (2014)

    Google Scholar 

  23. Yu, B., Yang, Z., Xie, J.: A parallel improved ant colony optimization for multi-depot vehicle routing problem. J. Oper. Res. Soc. 62(1), 183–188 (2011)

    Article  Google Scholar 

  24. Zhao, N., Wu, Z., Zhao, Y., Quan, T.: Ant colony optimization algorithm with mutation mechanism and its applications. Expert Syst. Appl. 37(7), 4805–4810 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Darren M. Chitty .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chitty, D.M. (2020). Partial-ACO Mutation Strategies to Scale-Up Fleet Optimisation and Improve Air Quality (Best Application Paper). In: Bramer, M., Ellis, R. (eds) Artificial Intelligence XXXVII. SGAI 2020. Lecture Notes in Computer Science(), vol 12498. Springer, Cham. https://doi.org/10.1007/978-3-030-63799-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-63799-6_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-63798-9

  • Online ISBN: 978-3-030-63799-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics