A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover.
作者： Timo Kötzing , Tobias Friedrich , Markus Wagner
DOI:
关键词:
摘要: A common 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. However, while specific restart …
harvard.edu
arxiv.org参考文章(14)
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
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
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
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
Michael Polacek, Karl F. Doerner, Richard F. Hartl, Guenter Kiechle, Marc Reimann, Scheduling periodic customer visits for a traveling salesperson European Journal of Operational Research. ,vol. 179, pp. 823- 837 ,(2007) , 10.1016/J.EJOR.2005.03.056
Fernando C. Gomes, Cláudio N. Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana, Experimental analysis of approximation algorithms for the vertex cover and set covering problems Computers & Operations Research. ,vol. 33, pp. 3520- 3534 ,(2006) , 10.1016/J.COR.2005.03.030
Matteo Fischetti, Michele Monaci, Exploiting Erraticism in Search Operations Research. ,vol. 62, pp. 114- 122 ,(2014) , 10.1287/OPRE.2013.1231
David Applegate, William Cook, André Rohe, Chained Lin-Kernighan for Large Traveling Salesman Problems Informs Journal on Computing. ,vol. 15, pp. 82- 92 ,(2003) , 10.1287/IJOC.15.1.82.15157