Abstract
Abstract
The dynamic travelling salesman problem (DTSP) is a natural extension of the standard travelling salesman problem, and it has attracted significant interest in recent years due to is practical applications. In this article, we propose an efficient solution for DTSP, based on a genetic algorithm (GA), and on the one-by-one revision of two sides (GORTS). More specifically, GORTS combines the global search ability of GA with the fast convergence feature of the method of one-by-one revision of two sides, in order to find the optimal solution in a short time. An experimental platform was designed to evaluate the performance of GORTS with TSPLIB. The experimental results show that the efficiency of GORTS compares favourably against other popular heuristic algorithms for DTSP. In particular, a prototype logistics system based on GORTS for a supermarket with an online map was designed and implemented. It was shown that this can provide optimised goods distribution routes for delivery staff, while considering real-time traffic information.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference32 articles.
1. Alves RMF, Lopes CR (2015) Using genetic algorithms to minimize the distance and balance the routes for the multiple traveling salesman problem. In: in Proceedings of CEC, Sendai. 1–8
2. Avin R, Agin D, Adnan M (2012) Solving tsp using genetic algorithms—case of Kosovo, advances in. Computer Sci 12(11):256–260
3. Bessis N, Sotiriadis S, Pop F, Cristea V (2012) Optimizing the energy efficiency of message exchanging for service distribution in interoperable infrastructures. pp 105–112.
https://doi.org/10.1109/iNCoS.2012.16
4. Blackwell BT, Branke J (2004) Multi-swarm optimization in dynamic environments. Applications of Evolutionary Computing, Evoworkshops 3005
5. Boryczka, U, Strak Ł (2012) A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem. In: Computational Collective Intelligence. Technologies and Applications, LNCS pp 503–512
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献