Title: An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows
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.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 14
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot