Hybrid algorithms with detection of promising areas for the prize collecting travelling salesman problem

Proceedings - HIS 2005: Fifth International Conference on Hybrid Intelligent Systems

Volumn 2005, Issue , 2005, Pages 49-54

  Chaves, Antonio Augusto ^a   Lorena, Luiz Antonio Nogueira ^a  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

EVOLUTIONARY CLUSTERING SEARCH (ECS); METAHEURISTICS; PRIZE COLLECTING TRAVELLING SALESMAN PROBLEM (PCTSP); PROBLEM SOLVERS;

TRAVELING SALESMAN PROBLEM;

EID: 33751375967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICHIS.2005.57     Document Type: Conference Paper

References (17)

1. ILOG CPLEX 7.5 Reference Manual. ©Copyright by ILOG, France, 2001.
2. E. Balas. The prize collecting travelling salesman problem. Networks, 19:621-636, 1989.
3. A. A. Chaves, F. L. Biajoli, O. M. Mine, and M. J. F. Souza. Modelagens exata e heurística para resolução de uma generalização do problema do caixeiro viajante. Simpósio Brasileiro de Pesquisa Operational (SBPO), 36:1367-1378, 2004.
4. G. Croes. A method for solving travelling salesman problems. Operations Research, 6:791-812, 1958.
5. M. Dell'Amico, F. Maffioli, and A. Sciomanchen. A lagrangian heuristic for the prize collecting travelling salesman problem. Operations Research, 81:289-305, 1998.
6. T. Feo and M. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-133, 1995.
7. M. Fischetti and P. Toth. An additive approach for the optimal solution of the prize collecting traveling salesman problem. Vehicle Routing: Methods and Studies, pages 319-343, 1988.
8. F. Glover. Tabu search and adaptive memory programing: Advances, applications and challenges. Interfaces in Computer Science and Operations Research, pages 1-75, 1996.
9. M. X. Goemans and D. P. Williamson. A general aproximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
10. L. M. Gomes, V. B. Diniz, and C. A. Martinhon. An hybrid grasp+vnd metaheuristic fo the prize collecting traveling salesman problem. Simpósio Brasileiro de pesquisa Operacional (SBPO), 32:1657-1665, 2000.
11. L. Lorena and J. Furtado. Constructive genetic algorithm for clustering problems. Evolutionary Computation, 9(3):309-327, 2001.
12. V. A. Melo and C. A. Martinhon. Metaheurísticas híbridas para o problema do caixeiro viajante com coleta de prêmios. Simpósio Brasileiro de Pesquisa Operacional (SBPO), 36:1295-1306, 2004.
13. N. Mladenovic and P. Hansen. Variable neighborhood search. Computers and Operations Research, 24:1097-1100, 1997.
14. A. C. M. Oliveira and L. A. N. Lorena. Detecting promising areas by evolutionary clustering search. Advances in Artificial Intelligence. Springer Lecture Notes in Artificial Intelligence Series, pages 385-394, 2004.
15. A. C. M. Oliveira and L. A. N. Lorena. Population training heuristics. Lecture Notes in Computer Science, 3448:166-176, 2005.
16. G. Syswerda. Uniform crossover in genetic algorithms. International Conference on Genetic Algorithms(ICGA), 3:2-9, 1989.
17. R. D. Torres and J. A. M. Brito. Problemas de coleta de prêmios seletiva. Simpósio Brasileiro de Pesquisa Operacional (SBPO), 35:1359-1371, 2003.