Vehicle Routing and Time Deadlines Using Genetic and Local Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
A New Approach on the Traveling Salesman Problem by Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
New Genetic Local Search Operators for the Traveling Salesman Problem
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A hybrid heuristic for the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Influence of topology and payload on CO2 optimised vehicle routing
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
| Hi-index | 0.00 |
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.