GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This artice is free to access.

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.

Cite

CITATION STYLE

APA

Xu, X., Yuan, H., Matthew, P., Ray, J., Bagdasar, O., & Trovati, M. (2020). GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems. Soft Computing, 24(10), 7197–7210. https://doi.org/10.1007/s00500-019-04335-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free