An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows
- Resource Type
- Conference
- Authors
- Shi, Xiaohu; Wang, Liupu; Zhou, You; Liang, Yanchun
- Source
- 2008 Fourth International Conference on Natural Computation Natural Computation, 2008. ICNC '08. Fourth International Conference on. 7:480-484 Oct, 2008
- Subject
- Computing and Processing
Ant colony optimization
Traveling salesman problems
Cities and towns
Algorithm design and analysis
Time factors
Performance analysis
Educational institutions
Computer science
Educational technology
Laboratories
Prize-collecting Traveling Salesman Problem with Time Windows
- Language
- ISSN
- 2157-9555
2157-9563
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.