An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows

Authors:
Xiaohu Shi;Liupu Wang;You Zhou;Yanchun Liang
Affiliations:
-;-;-;-
Venue:
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
Year:
2008

Citing 0
Cited 2

A fixed-parameter tractable algorithm for spatio-temporal calendar management

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.