Title :
An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows
Author :
Shi, Xiaohu ; Wang, Liupu ; Zhou, You ; Liang, Yanchun
Author_Institution :
Key Lab. of Symbol Comput. & Knowledge Eng. of the Minist. of Educ., Jilin Univ., Changchun
Abstract :
Focused on a variation of the Euclidean traveling salesman problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving method. The time window constraints are considered in the computation for the probability of selection of the next city. The parameters of the algorithm are analyzed by experiments. Numerical results also show that the proposed method is effective for the PCTSPTW problem.
Keywords :
optimisation; travelling salesman problems; Euclidean traveling salesman problem; ant colony optimization method; prize-collecting traveling salesman problem; time windows; Algorithm design and analysis; Ant colony optimization; Cities and towns; Computer science; Educational institutions; Educational technology; Laboratories; Performance analysis; Time factors; Traveling salesman problems; Ant colony optimization; Prize-collecting Traveling Salesman Problem with Time Windows;
Conference_Titel :
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-0-7695-3304-9
DOI :
10.1109/ICNC.2008.470
