Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
暂无分享,去创建一个
[1] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[2] Christian Bierwirth,et al. An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..
[3] C. W. Tate. Solve it. , 2005, Nursing standard (Royal College of Nursing (Great Britain) : 1987).
[4] C. Hierholzer,et al. Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren , 1873 .
[5] Ingo Wegener,et al. Fitness Landscapes Based on Sorting and Shortest Paths Problems , 2002, PPSN.
[6] Frank Neumann. Expected runtimes of evolutionary algorithms for the Eulerian cycle problem , 2004, IEEE Congress on Evolutionary Computation.
[7] Ingo Wegener,et al. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..
[8] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[9] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[10] Frank Neumann. Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem , 2004, PPSN.
[11] Bryant A. Julstrom,et al. Biased mutation operators for subgraph-selection problems , 2006, IEEE Transactions on Evolutionary Computation.