Exploration-exploitation tradeoffs in metaheuristics: Survey and analysis

作者: Junqin Xu , Jihui Zhang

DOI: 10.1109/CHICC.2014.6896450

关键词: Genetic algorithmOptimization problemTabu searchGlobal optimizationSimulated annealingComputer scienceMetaheuristicMeta-optimizationMachine learningExtremal optimizationHeuristicEvolutionary computationMathematical optimizationHeuristic (computer science)Ant colony optimization algorithmsArtificial intelligenceParallel metaheuristic

摘要: Metaheuristics (MHs) have been established as a family of the most practical approaches to hard optimization problems. Metaheuristic (MH) algorithm is high-level problem-independent algorithmic framework that provides set guidelines or strategies develop heuristic algorithms. Many different kinds MHs (e.g. genetic algorithms, tabu search, simulated annealing etc) were proposed during last several decades. Most focused on experimental studies and applications. It well known suitable reasonable tradeoff between exploration exploitation (T: Er& Ei) crucial for their success, having great effect global performance, e.g., accuracy convergence speed those But rigid useful theoretical study rare up date. A systematic analysis detailed survey this problem presented in paper. From system's perspective, it shows combining with instances' key properties, characters human intelligence right way deal difficulty.

参考文章(34)
B. Naudts, L. Kallel, A comparison of predictive measures of problem difficulty in evolutionary algorithms IEEE Transactions on Evolutionary Computation. ,vol. 4, pp. 1- 15 ,(2000) , 10.1109/4235.843491
Günther R. Raidl, A Unified View on Hybrid Metaheuristics Hybrid Metaheuristics. pp. 1- 12 ,(2006) , 10.1007/11890584_1
F. Herrera, M. Lozano, Adaptive genetic operators based on coevolution with fuzzy behaviors IEEE Transactions on Evolutionary Computation. ,vol. 5, pp. 149- 165 ,(2001) , 10.1109/4235.918435
Jing Liu, Hussein A. Abbass, David G. Green, Weicai Zhong, Motif difficulty (md): A predictive measure of problem difficulty for evolutionary algorithms using network motifs Evolutionary Computation. ,vol. 20, pp. 321- 347 ,(2012) , 10.1162/EVCO_A_00045
G. Yen, Fengming Yang, T. Hickey, M. Goldstein, Coordination of exploration and exploitation in a dynamic environment international joint conference on neural network. ,vol. 2, pp. 1014- 1018 ,(2001) , 10.1109/IJCNN.2001.939499
Jun He, Colin Reeves, Carsten Witt, Xin Yao, A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability Evolutionary Computation. ,vol. 15, pp. 435- 443 ,(2007) , 10.1162/EVCO.2007.15.4.435
Ang Yang, H.A. Abbass, R. Sarker, Characterizing warfare in red teaming systems man and cybernetics. ,vol. 36, pp. 268- 285 ,(2006) , 10.1109/TSMCB.2005.855569
Y. Borenstein, R. Poli, Kolmogorov complexity, Optimization and Hardness ieee international conference on evolutionary computation. pp. 112- 119 ,(2006) , 10.1109/CEC.2006.1688297
D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization IEEE Transactions on Evolutionary Computation. ,vol. 1, pp. 67- 82 ,(1997) , 10.1109/4235.585893
Sebástien Vérel, Christian Darabos, Marco Tomassini, Gabriela Ochoa, A study of NK landscapes' basins and local optima networks genetic and evolutionary computation conference. pp. 555- 562 ,(2008) , 10.1145/1389095.1389204