An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search
作者： Thomas Weise , Zijun Wu , Markus Wagner
DOI: 10.1609/AAAI.V33I01.33012395
关键词:
摘要: A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on the …
sci-hub.se 参考文章(31)
Serdar Kadioglu, Andre A. Cire, Meinolf Sellmann, Parallel restarted search national conference on artificial intelligence. pp. 842- 848 ,(2014)
Jan Karel Lenstra, David Shmoys, The Traveling Salesman Problem: A Computational Study ,(2007)
Helena Ramalhinho Lourenço, Olivier C Martin, Thomas Stützle, Iterated Local Search: Framework and Applications Springer, Boston, MA. pp. 363- 397 ,(2010) , 10.1007/978-1-4419-1665-5_12
Raymond Ros, Nikolaus Hansen, A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity parallel problem solving from nature. pp. 296- 305 ,(2008) , 10.1007/978-3-540-87700-4_30
Marc Schoenauer, Fabien Teytaud, Olivier Teytaud, A rigorous runtime analysis for quasi-random restarts and decreasing stepsize EA'11 Proceedings of the 10th international conference on Artificial Evolution. pp. 37- 48 ,(2011) , 10.1007/978-3-642-35533-2_4
Thomas Weise, Raymond Chiong, Jorg Lassig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem IEEE Computational Intelligence Magazine. ,vol. 9, pp. 40- 52 ,(2014) , 10.1109/MCI.2014.2326101
Axel de Perthuis de Laillevault, Benjamin Doerr, Carola Doerr, Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization genetic and evolutionary computation conference. pp. 815- 822 ,(2015) , 10.1145/2739480.2754760
Matteo Gagliolo, Jürgen Schmidhuber, Algorithm portfolio selection as a bandit problem with unbounded losses Annals of Mathematics and Artificial Intelligence. ,vol. 61, pp. 49- 86 ,(2011) , 10.1007/S10472-011-9228-Z
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons, Scalable Parallel Algorithms for FPT Problems Algorithmica. ,vol. 45, pp. 269- 284 ,(2006) , 10.1007/S00453-006-1214-1