Metaheuristic optimization: Algorithm analysis and open problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6630 LNCS, Issue , 2011, Pages 21-32

  Yang, Xin She ^a  

^a NATIONAL PHYSICAL LABORATORY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM ANALYSIS; CONVERGENCE ANALYSIS; EFFICIENCY ANALYSIS; MATHEMATICAL ANALYSIS; META HEURISTIC ALGORITHM; META HEURISTICS; METAHEURISTIC OPTIMIZATION; OPEN PROBLEMS; OTHER ALGORITHMS; RESEARCH TOPICS; EFFICIENCY STUDIES; META-HEURISTIC OPTIMIZATIONS;

EFFICIENCY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PARTICLE SWARM OPTIMIZATION (PSO);

CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

EID: 79955818164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20662-7_2     Document Type: Conference Paper

References (35)

1. Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, Singapore (2010)
2. Auger, A., Teytaud, O.: Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica 57(1), 121-146 (2010)
3. Bell, W.J.: Searching Behaviour: The Behavioural Ecology of Finding Resources. Chapman & Hall, London (1991)
4. Bertsimas, D., Tsitsiklis, J.: Simulated annealing. Stat. Science 8, 10-15 (1993)
5. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptural comparison. ACM Comput. Surv. 35, 268-308 (2003)
6. Chatterjee, A., Siarry, P.: Nonlinear inertia variation for dynamic adapation in particle swarm optimization. Comp. Oper. Research 33, 859-871 (2006)
7. Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evolutionary Computation 6, 58-73 (2002)
8. Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD thesis. Politecnico di Milano, Italy (1992)
9. Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Chichester (2005)
10. Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms. LNCS, vol. 455. Springer, Heidelberg (1990)
11. Floudas, C.A., Pardolos, P.M.: Encyclopedia of Optimization, 2nd edn. Springer, Heidelberg (2009)
12. Gamerman, D.: Markov Chain Monte Carlo. Chapman & Hall/CRC (1997)
13. Geyer, C.J.: Practical Markov Chain Monte Carlo. Statistical Science 7, 473-511 (1992)
14. Ghate, A., Smith, R.: Adaptive search with stochastic acceptance probabilities for global optimization. Operations Research Lett. 36, 285-290 (2008)
15. Granville, V., Krivanek, M., Rasson, J.P.: Simulated annealing: A proof of convergence. IEEE Trans. Pattern Anal. Mach. Intel. 16, 652-656 (1994)
16. Gutowski, M.: Lévy flights as an underlying mechanism for global optimization algorithms. ArXiv Mathematical Physics e-Prints (June 2001)
17. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942-1948 (1995)
18. Kennedy, J., Eberhart, R.C.: Swarm intelligence. Academic Press, London (2001)
19. Holland, J.: Adaptation in Natural and Artificial systems. University of Michigan Press, Ann Anbor (1975)
20. Kirkpatrick, S., Gellat, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 670-680 (1983)
21. Matthews, C., Wright, L., Yang, X.S.: Sensitivity Analysis, Optimization, and Sampling Methodds Applied to Continous Models. National Physical Laboratory Report, UK (2009)
22. Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer, Heidelberg (2010)
23. Nolan, J.P.: Stable distributions: models for heavy-tailed data. American University (2009)
24. Pavlyukevich, I.: Lévy flights, non-local search and simulated annealing. J. Computational Physics 226, 1830-1844 (2007)
25. Rebennack, S., Arulselvan, A., Elefteriadou, L., Pardalos, P.M.: Complexity analysis for maximum flow problems with arc reversals. J. Combin. Optimization 19(2), 200-216 (2010)
26. Reynolds, A.M., Rhodes, C.J.: The Lévy fligth paradigm: random search patterns and mechanisms. Ecology 90, 877-887 (2009)
27. Steinhöfel, K., Albrecht, A.A., Wong, C.-K.: Convergence analysis of simulated annealing-based algorithms solving flow shop scheduling problems. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 277-290. Springer, Heidelberg (2000)
28. Sobol, I.M.: A Primer for the Monte Carlo Method. CRC Press, Boca Raton (1994)
29. Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Chichester (2009)
30. Viswanathan, G.M., Buldyrev, S.V., Havlin, S., da Luz, M.G.E., Raposo, E.P., Stanley, H.E.: Lévy flight search patterns of wandering albatrosses. Nature 381, 413-415 (1996)
31. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimisation. IEEE Transaction on Evolutionary Computation 1, 67-82 (1997)
32. Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2008)
33. Yang, X.S.: Engineering Optimization: An Introduction with Metaheuristic Applications. John Wiley & Sons, Chichester
34. Yang, X.S.: Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspired Computation 2, 78-84 (2010)
35. Yang, X.S., Deb, S.: Engineering optimization by cuckoo search. Int. J. Math. Modelling & Num. Optimization 1, 330-343 (2010)