Generating Easy and Hard Problems using the Proximate Optimality Principle
暂无分享,去创建一个
[1] John A. W. McCall,et al. Structural coherence of problem and algorithm: An analysis for EDAs on all 2-bit and 3-bit problems , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).
[2] Laura I. Burke,et al. A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..
[3] Atsushi Ishigame,et al. Multipoint Tabu Search based on proximate optimality principle—application of parts concept , 2007 .
[4] R. Prim. Shortest connection networks and some generalizations , 1957 .
[5] Qingfu Zhang,et al. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem , 2014, IEEE Transactions on Cybernetics.
[6] Qingfu Zhang,et al. An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem , 2007, GECCO '07.
[7] Hui Li,et al. An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem , 2009, EMO.
[8] John A. W. McCall,et al. Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings , 2014, GECCO.
[9] Qingfu Zhang,et al. An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.
[10] Xin Yao,et al. On the Easiest and Hardest Fitness Functions , 2012, IEEE Transactions on Evolutionary Computation.
[11] Atsushi Ishigame,et al. Basic study of proximate optimality principle based combinatorial optimization method , 2011, 2011 IEEE International Conference on Systems, Man, and Cybernetics.