Solving the Open-Path Asymmetric Green Traveling Salesman Problem in a Realistic Urban Environment
In this paper, a driving route planning system for multi-point routes is designed and developed. The routing problem has modeled as an Open-Path and Asymmetric Green Traveling Salesman Problem (OAG-TSP). The main objective of the proposed OAG-TSP is to find a route between a fixed origin and destination, visiting a group of intermediate points exactly once, minimizing the \(CO_2\) emitted by the car and the total distance traveled. Thus, the developed transportation problem is a complex and multi-attribute variant of the well-known TSP. For its efficient solving, three classic meta-heuristics have been used: Simulated Annealing, Tabu Search and Variable Neighborhood Search. These approaches have been chosen for its easy adaptation and rapid execution times, something appreciated in this kind of real-world systems. The system developed has been built in a realistic simulation environment, using the open source framework Open Trip Planner. Additionally, three heterogeneous scenarios have been studied in three different cities of the Basque Country (Spain): Bilbao, Gazteiz and Donostia. Obtained results conclude that the most promising technique for solving this problem is the Simulated Annealing. The statistical significance of these findings is confirmed by the results of a Friedman’s non-parametric test.
KeywordsRoute planning Traveling Salesman Problem Emission reduction Simulated Annealing Tabu Search Variable Neighborhood Search
E. Osaba and J. Del Ser would like to thank the Basque Government for its funding support through the EMAITEK program.
- 1.Cordeau, J.F., Laporte, G., Potvin, J.Y., Savelsbergh, M.W.: Transportation on demand. Handb.S Oper. Res. Manag. Sci. 14, 429–466 (2007)Google Scholar
- 2.Van Laarhoven, P.J., Aarts, E.H.: Simulated annealing. In: Simulated Annealing: Theory and Applications, pp. 7–15. Springer, Netherland (1987)Google Scholar
- 5.Open Trip Planner. https://github.com/opentripplanner. Accessed 30 Nov 2017
- 8.Elgesem, A.S., Skogen, E.S., Wang, X., Fagerholt, K.: A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping. Eur. J. Oper. Res. (2018)Google Scholar
- 12.Osaba, E., Yang, X.S., Fister, I., Del Ser, J., Lopez-Garcia, P., Vazquez-Pardavila, A.J.: A discrete and improved bat algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm and Evolutionary Computation (2018)Google Scholar
- 13.Osaba, E., Del Ser, J., Bilbao, M.N., Lopez-Garcia, P., Nebro, A.J.: Multi-objective design of time-constrained bike routes using bio-inspired meta-heuristics. In: Proceedings of 8th International Conference on Bioinspired Optimization Methods and their Applications (2018 in press)Google Scholar
- 14.Jimenez, J.L., McClintock, P., McRae, G., Nelson, D.D., Zahniser, M.S.: Vehicle specific power: a useful parameter for remote sensing and emission studies. In: Ninth CRC On-Road Vehicle Emissions Workshop, San Diego, CA (1999)Google Scholar
- 15.Jimenez-Palacios, J.L.: Understanding and quantifying motor vehicle emissions with vehicle specific power and tildas remote sensing. Massachusetts Institute of Technology (1998)Google Scholar
- 16.Hart, C., Koupal, J., Giannelli, R.: Epa’s onboard analysis shootout: overview and results (no. epa/420/r-02/026). Technical report (2002)Google Scholar
- 17.Koupal, J., Hart, C., Brzezinski, D., Giannelli, R., Bailey, C.: Draft emission analysis plan for moves GHG. Technical report, US Environmental Protection Agency (2002)Google Scholar
- 21.Osaba, E., Díaz, F.: Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem. In: Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 131–136. IEEE (2012)Google Scholar