Socio-inspired Optimization Metaheuristics: A Review

作者: Meeta Kumar , Anand J Kulkarni , None

DOI: 10.1007/978-981-13-6569-0_12

关键词:

摘要: The chapter attempts to review the recent literature in upcoming area of socio-inspired metaheuristics. These optimization methodologies are a novel subbranch popular Evolutionary algorithms under class nature-inspired for optimization. seeks inspiration from human behavior seen during course social and cultural interactions with others. A being exhibits natural inherent tendencies competitive behavior, collaborate, work together interact socially culturally. All such behaviors help an individual learn imbibe other humans, resulting them adapt improve their own due time. This tendency observed humans serves as motivation were agents optimizer algorithm toward achieving some shared goals. finds strength fact that individuals tend evolve faster through setup than just biological evolution based on inheritance alone. In article, authors introduce summarize existing algorithms, sources inspiration, basic functioning. Additionally, also sheds light limitations strengths each these optimizers discussed article. problem domains which have been successfully applied is presented. note most developed this nature inspire new still evolving, thus promising scope domain.

参考文章(88)
Stephen Fitzpatrick, Lambert Meertens, Distributed Coordination through Anarchic Optimization Multiagent Systems, Artificial Societies, and Simulated Organizations. pp. 257- 295 ,(2003) , 10.1007/978-1-4615-0363-7_11
Handbook of Metaheuristics Research Papers in Economics. ,(2010) , 10.1007/978-1-4419-1665-5
V. S. Tanaev, V. S. Gordon, Y. M. Shafransky, NP-Hard Problems Scheduling Theory. Single-Stage Systems. pp. 253- 311 ,(1994) , 10.1007/978-94-011-1190-4_5
Hojjat Emami, Farnaz Derakhshan, Election algorithm: A new socio-politically inspired strategy Ai Communications. ,vol. 28, pp. 591- 603 ,(2015) , 10.3233/AIC-140652
S. P. Brooks, B. J. T. Morgan, Optimization Using Simulated Annealing The Statistician. ,vol. 44, pp. 241- 257 ,(1995) , 10.2307/2348448
Jackson Kytle, Albert Bandura, Social learning theory Canadian Journal of Sociology-cahiers Canadiens De Sociologie. ,vol. 2, pp. 321- ,(1977) , 10.2307/2065952
Wenge Lv, Qinghua Xie, Zhiyong Liu, Deyuan Li, Siyuan Cheng, Shaoming Luo, Xiangwei Zhang, Verifying Election Campaign Optimization Algorithm by Several Benchmarking Functions Lecture Notes in Computer Science. pp. 582- 587 ,(2010) , 10.1007/978-3-642-13498-2_76
P. Crescenzi, V. Kann, Approximation on the Web: A Compendium of NP Optimization Problems randomization and approximation techniques in computer science. pp. 111- 118 ,(1997) , 10.1007/3-540-63248-4_10