Lévy flights in binary optimization

• Autorzy: Klimt M , Kukal J. , Mojzeš M
• Języki publikacji: EN

Abstrakty

EN

There are many optimization heuristics which involves mutation operator. Reducing them to binary optimization allows to study properties of binary mutation operator. Modern heuristics yield from Lévy flights behavior, which is a bridge between local search and random shooting in binary space. The paper is oriented to statistical analysis of binary mutation with Lévy flight inside and Quantum Tunneling heuristics.

Słowa kluczowe

EN

binary optimization; mutation operator; Lévy flights; Bernoulli trials; quantum tunneling

• Wydawca: Polish Academy of Sciences, Committee of Automatic Control and Robotics
• Czasopismo: Archives of Control Sciences
• Rocznik: 2013
• Tom: Vol. 23, no. 4
• Strony: 447--454
• Opis fizyczny: Bibliogr. 11 poz., tab., rys., wzory

Twórcy

autor

Klimt M

• Faculty of Nuclear Sciences and Physical Engineering, CTU in Prague Department of Software Engineering, Trojanova 13, Praha 2, 120 00 Czech Republic

autor

Kukal J.

• Faculty of Nuclear Sciences and Physical Engineering, CTU in Prague Department of Software Engineering, Trojanova 13, Praha 2, 120 00 Czech Republic

autor

Mojzeš M

• Faculty of Nuclear Sciences and Physical Engineering, CTU in Prague Department of Software Engineering, Trojanova 13, Praha 2, 120 00 Czech Republic

Bibliografia

• [1] D. E. Goldberg: Genetics Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
• [2] V. Černý: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. J. of Optimization Theory and Applications, 45(1), (1985), 41-51.
• [3] H. Szu and R. Hartley: Fast simulated annealing. Physics Letters A, 122(3-4), (1987), 157-162.
• [4] B. Apolloni, C. Caravalho and D. De Falco: Quantum stochastic optimization. Stochastic Processes and their Applications, 33(1), (1989), 233-244.
• [5] X. Ouyang, Y. Zhou, Q. Luo and H. Chen: A novel discrete cuckoo search algorithm for spherical traveling salesman problem. Applied mathematics & information sciences, 7(2), (2013), 777-784.
• [6] M. K. Sayadi, R. Ramezanian and N. Ghaffari-Nasab: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int. J. of Industrial Engineering Computations, 1(1), (2010), 1-10.
• [7] R. Motwani and P. Raghavan: Randomized Algorithms. Cambridge University Press, 1995.
• [8] G. M. Viswanathan: Levy flights and superdiffusion in the context of biological encounters and random searchers.Physics of Life Reviews, 5(1), (2008), 133-150.
• [9] R. N. Mantegna: Fast, accurate algorithm for numerical simulation of L´evy stable stochastic processes. Physical Review E, 49(5), (1994), 4677-4683.
• [10] D. P. Kroese, T. Taimre and Z. I. Botev: Handbook of Monte Carlo Methods. John Wiley & Sons, 2011.
• [11] V. Feoktistov: Differential Evolution in Search of Solutions, Springer, 2006.