Hybrid metaheuristic for the prize collecting travelling salesman problem

Authors:
Antonio Augusto Chaves;Luiz Antonio Nogueira Lorena
Affiliations:
National Institute for Space Research, Laboratory of Computing and Applied Mathematics, São José dos, Brazil;National Institute for Space Research, Laboratory of Computing and Applied Mathematics, São José dos, Brazil
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 4
Cited 2

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Variable neighborhood search

Computers and Operations Research
Traveling Salesman Problems with Profits

Transportation Science
Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems

Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for the PCTSP, using a hybrid metaheuristic known as Clustering Search (CS), whose main idea is to identify promising areas of the search space by generating solutions and clustering them into groups that are then explored further. The validation of the obtained solutions was through the comparison with the results found by CPLEX.