EvoCOP 2008: Evolutionary Computation in Combinatorial Optimization pp 123-134 | Cite as
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
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.
Keywords
Local Search Travel Salesman Problem Travel Salesman Problem Travel Cost Average SolutionPreview
Unable to display preview. Download preview PDF.
References
- 1.Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 385–394. Springer, Heidelberg (2004)Google Scholar
- 2.Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)MATHCrossRefMathSciNetGoogle Scholar
- 3.Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)MATHCrossRefMathSciNetGoogle Scholar
- 4.ILOG France: ILOG CPLEX 10.0 - User’s Manual (2006)Google Scholar
- 5.Balas, E.: The prize collecting travelling salesman problem. In: Anais..., ORSA/TIMS Meeting (1986)Google Scholar
- 6.Balas, E.: The prize collecting travelling salesman problem. Networks 19, 621–636 (1989)MATHCrossRefMathSciNetGoogle Scholar
- 7.Fischetti, M., Toth, P.: An additive approach for the optimal solution of the prize collecting traveling salesman problem. In: Vehicle Routing: Methods and Studies, 319–343 (1988)Google Scholar
- 8.Goemans, M.X., Williamson, D.P.: A general aproximation technique for constrained forest problems. SIAM Journal on Computing 24(2), 296–317 (1995)MATHCrossRefMathSciNetGoogle Scholar
- 9.Dell’Amico, M., Maffioli, F., Sciomanchen, A.: A lagrangian heuristic for the prize collecting travelling salesman problem. Annals of Operations Research 81, 289–305 (1998)MATHCrossRefMathSciNetGoogle Scholar
- 10.Chaves, A.A., Lorena, L.A.N.: Hybrid algorithms with detection of promising areas for the prize collecting traveling salesman problem. In: Proceedings of International Conference on Hybrid Intelligent Systems, pp. 49–54. IEEE Computer Society, Los Alamitos, California (2005)CrossRefGoogle Scholar
- 11.Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transportation Science 2(39), 188–205 (2005)CrossRefGoogle Scholar
- 12.Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence. SCI Series, pp. 81–102. Springer, Heidelberg (2007)Google Scholar
- 13.Gomes, L.M., Diniz, V.B., Martinhon, C.A.: An hybrid grasp+vnd metaheuristic fo the prize collecting traveling salesman problem. In: XXXII Brazilian Symposium of Operational Research (SBPO), pp. 1657–1665 (2000)Google Scholar
- 14.Glover, F.: Tabu search and adaptive memory programing: Advances, applications and challenges. In: Interfaces in Computer Science and Operations Research, pp. 1–75 (1996)Google Scholar
- 15.Croes, G.: A method for solving travelling salesman problems. Operations Research 6, 791–812 (1958)MathSciNetCrossRefGoogle Scholar