Skip to main content

Using an Evolutionary Algorithm to Discover Low CO2 Tours within a Travelling Salesman Problem

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2010)

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

Included in the following conference series:

Abstract

This paper examines the issues surrounding the effects of using vehicle emissions as the fitness criteria when solving routing problems using evolutionary techniques. The case-study examined is that of the Travelling Salesman Problem (TSP) based upon the road network within the City of Edinburgh, Scotland. A low cost path finding algorithm (A*) is used to build paths through the street network between delivery points. The EA is used to discover tours that utilise paths with low emissions characteristics. Two methods of estimating CO2 emissions are examined; one that utilises a fuel consumption model and applies it to an estimated drive cycle and one that applies a simplistic CO2 calculation model that focuses on average speeds over street sections. The results of these two metrics are compared with each other and with results obtained using a traditional distance metric.

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. Applegate, D., Cook, W.: Concorde, combinatorial optimization and networked combinatorial optimization research and development environment (2002), http://www.math.princeton.edu/tsp/concorde.html

  2. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling salesman problem. Operations Research 21, 498–516 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baraglia, R., Hidalgo, J.I., Perego, R.: A hybrid heuristic for the travelling salesman problem. IEEE Transactions on Evolutionary Computation 5, 613–622 (2001)

    Article  Google Scholar 

  4. Cook, W., Applegate, D., Bixby, R., Chvatal, V.: Finding tours in the TSP. Technical Report 99885, Research Institute for Discrete Mathematics, University of Bonn (1999)

    Google Scholar 

  5. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: The Travelling Salesman Problem. In: Combinatorial Optimization, pp. 241–271. John Wiley and Sons Ltd., Chichester (1998)

    Google Scholar 

  6. Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large travelling salesman problems (2000), http://www.citeseer.nj.nec.com/applegate99chained.html

  7. Tsplib, a library of sample instances for the tsp (and related problems) from various sources and of various types (2002), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

  8. Freisleben, B., Merz, P.: New genetic local search operators for the travelling salesman problem. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 890–899. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  9. Tamaki, H., Kita, H., Shimizu, N., Maekawa, K., Nishikawa, Y.: A comparison study of genetic codings for the travelling salesman problem. In: Proceedings of the 1st IEEE Conference on Evolutionary Computing (ICEC 1994). IEEE, Los Alamitos (1994)

    Google Scholar 

  10. Homaifar, A., Guan, S., Liepins, G.E.: A new approach on the travelling salesman problem by genetic algorithms. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, pp. 460–466. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  11. Thangiah, S.R.: A hybrid genetic algorithm, simulated annealing and tabu search heuristic for vehicle routing problems with time windows. Practical Handbook of Genetic Algorithms, Complex Coding Systems III, 347–381 (1999)

    Google Scholar 

  12. Blanton, J.L., Wainright, R.L.: Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, pp. 452–459. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  13. Thangiah, S.R., Vinayaamoorthy, R., Gubbi, A.V.: Vehicle routing with time deadlines using genetic and local algorithms. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 506–515. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  14. Green, J.M., Barlow, T.J.: Traffic management and air quality: realistic driving cycles for traffic management schemes. Technical Report TRL Report TRL596 (2004)

    Google Scholar 

  15. Akcelik, R., Biggs, D.C.: A discussion on the paper on fuel consumption modeling by post et al. Transportation Research Part B: Methodological 19, 529–533 (1985)

    Article  Google Scholar 

  16. Act on co2 calculator: Data, methodology and assumptions paper. Department for Environment, Food and Rural Affairs (2008)

    Google Scholar 

  17. Barlow, T.J., Hickman, A.J., Boulter, P.: Exhaust emission factors 2001: database and emission factors. Technical Report PR/SE/230/00, Transport and Road Research Laboritory, Crowthrone, UK (2001)

    Google Scholar 

  18. Department for the Environment, Food and Rural Affairs. Results from the National Atmospheric Emissions Inventory (NAEI), http://www.naei.org.uk/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Urquhart, N., Scott, C., Hart, E. (2010). Using an Evolutionary Algorithm to Discover Low CO2 Tours within a Travelling Salesman Problem. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12242-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12242-2_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12241-5

  • Online ISBN: 978-3-642-12242-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics