Show simple item record

dc.contributor.authorXu, Xiaolong
dc.contributor.authorYuan, Hao
dc.contributor.authorMatthew, Peter
dc.contributor.authorRay, Jeffrey
dc.contributor.authorBagdasar, Ovidiu
dc.contributor.authorTrovati, Marcello
dc.date.accessioned2019-10-07T15:11:05Z
dc.date.available2019-10-07T15:11:05Z
dc.date.issued2019-09-21
dc.identifier.citationXu, X., Yuan, H., Matthew, P., Ray, J., Bagdasar, O. and Trovati, M., (2019). 'GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems'. Soft Computing, pp.1-14. DOI: 10.1007/s00500-019-04335-2.en_US
dc.identifier.issn14327643
dc.identifier.doi10.1007/s00500-019-04335-2
dc.identifier.urihttp://hdl.handle.net/10545/624199
dc.description.abstractThe 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.en_US
dc.description.sponsorshipThis work was jointly sponsored by the National Natural Science Foundation of China under Grants 61472192 and 91646116, the Scientific and Technological Support Project (Society) of Jiangsu Province under Grant BE2016776, the Talent Project in Six Fields of Jiangsu Province under Grant 2015-JNHB-012, the “333” Scientific Research program of Jiangsu Province under Grant BRA2017228, and the Jiangsu Key Laboratory of Big Data Security and Intelligent Processing at NJUPT.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.urlhttps://link.springer.com/article/10.1007/s00500-019-04335-2en_US
dc.rightsCC0 1.0 Universal*
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.subjectTheoretical Computer Scienceen_US
dc.subjectSoftwareen_US
dc.subjectGeometry and Topologyen_US
dc.titleGORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problemsen_US
dc.typeArticleen_US
dc.contributor.departmentUniversity of Derbyen_US
dc.contributor.departmentNanjing University of Posts and Telecommunications, Nanjing, Chinaen_US
dc.contributor.departmentEdge Hill University, Ormskirk, UKen_US
dc.identifier.journalSoft Computingen_US
dcterms.dateAccepted2019-09
refterms.dateFOA2019-10-07T15:11:06Z
dc.author.detail782275en_US


Files in this item

Thumbnail
Name:
(2019) Soft Computing - GORTS.pdf
Size:
3.541Mb
Format:
PDF
Description:
Published article- Open Access

This item appears in the following Collection(s)

Show simple item record

CC0 1.0 Universal
Except where otherwise noted, this item's license is described as CC0 1.0 Universal