Metaheuristics and Applications to Optimization Problems in Telecommunications

作者: Simone L. Martins , Celso C. Ribeiro

DOI: 10.1007/978-0-387-30165-5_4

关键词:

摘要: Recent years have witnessed huge advances in computer technology and communication networks, entailing hard optimization problems areas such as network design routing. Metaheuristics are general high-level procedures that coordinate simple heuristics rules to find good approximate solutions computationally difficult combinatorial problems. Among them, we simulated annealing, tabu search, GRASP, VNS, genetic algorithms, others. They some of the most effective solution strategies for solving practice been applied a very large variety telecommunications. In this chapter, review main components common different metaheuristics. We also describe principles associated with several metaheuristic give templates basic implementations them. Finally, present an account successful applications metaheuristics

参考文章(3)
Pierre Hansen, Nenad Mladenović, An Introduction to Variable Neighborhood Search Les Cahiers du GERAD. pp. 433- 458 ,(1999) , 10.1007/978-1-4615-5775-3_30
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by Simulated Annealing Science. ,vol. 220, pp. 671- 680 ,(1983) , 10.1126/SCIENCE.220.4598.671