Research on time optimal TSP based on hybrid PSO-GA

In order to provide a better recommended-path service for tourists, this paper proposed an outreach of the classical TSP, called TOTSP. It aimed at pushing the recommended shortest time path to save tourists' traveling time. A hybrid algorithm PSO-GA solved the proposed problem and regarded tra...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ying yong yan jiu Vol. 32; no. 12; pp. 3613 - 3617
Main Authors Zhang, Yong, Chen, Ling, Xu, Xiaolong, Li, Feiteng
Format Journal Article
LanguageChinese
Published 01.12.2015
Subjects
Algorithms
Computer simulation
Consumption
Dealing
Mathematical analysis
Mathematical models
Pushing
Spots
Online AccessGet full text

Cover

More Information
Summary:In order to provide a better recommended-path service for tourists, this paper proposed an outreach of the classical TSP, called TOTSP. It aimed at pushing the recommended shortest time path to save tourists' traveling time. A hybrid algorithm PSO-GA solved the proposed problem and regarded traveling time as its objective function in simulations. The traveling time contained three parts: tourists' walking time between scenic spots, tourists' wait-in-queue time of every scenic spot and tourists' visiting time at each scenic spot. Simulations compared results of PSO-GA, GA and ACO of finding the shortest travel time and consuming of the CPU execution time. The results reveal PSO-GA has an outperformance on dealing with the proposed TOTSP.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-2
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2015.12.019