Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-78604-7_11 | EvoCOP |
Keywords | Field | DocType |
promising area,main idea,clustering search,tour enough city,travelling salesman problem,hybrid metaheuristic,search space,prize collecting,minimum prize,travel cost,salesman problem,traveling salesman problem | Traveling purchaser problem,Nearest neighbour algorithm,Bottleneck traveling salesman problem,Mathematical optimization,Operations research,Travelling salesman problem,Local search (optimization),2-opt,Mathematics,Lin–Kernighan heuristic,Metaheuristic | Conference |
Volume | ISSN | ISBN |
4972 | 0302-9743 | 3-540-78603-1 |
Citations | PageRank | References |
5 | 0.68 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Augusto Chaves | 1 | 116 | 10.24 |
| Luiz Antonio Nogueira Lorena | 2 | 498 | 36.72 |