Research Output

Using an evolutionary algorithm to discover low CO2 tours within a Travelling Salesman Problem

  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.

  • Date:

    30 November 2009

  • Publication Status:

    Published

  • Publisher

    Springer-Verlag

  • DOI:

    10.1007/978-3-642-12242-2_43

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Urquhart, N. B., Scott, C. & Hart, E. (2009). Using an evolutionary algorithm to discover low CO2 tours within a Travelling Salesman Problem. In Chio, C., Brabazon, A., Caro, G. A., Ebner, M. & Farooq, M. (Eds.). EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation, 421-430. doi:10.1007/978-3-642-12242-2_43. ISBN 978-3-642-12241-5

Authors

Keywords

vehicle routing; Travelling Salesman; fuel consumption; CO2 emissions; path finding algorithm;

Available Documents