An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem
暂无分享,去创建一个
[1] M. Dorigo,et al. Ant System: An Autocatalytic Optimizing Process , 1991 .
[2] Cameron Bruce Fraser,et al. Subsequences and Supersequences of Strings , 1995 .
[3] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[4] Esko Ukkonen,et al. The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..
[5] Luca Maria Gambardella,et al. Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.
[6] Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..
[7] Jürgen Branke,et al. Improved heuristics and a genetic algorithm for finding short supersequences , 1998 .
[8] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .
[9] Tao Jiang,et al. On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1995, SIAM J. Comput..
[10] Robert W. Irving,et al. Approximation Algorithms for the Shortest Common Supersequence , 1995, Nord. J. Comput..
[11] Hartmut Schmeck,et al. Experiences with fine‐grainedparallel genetic algorithms , 1999, Ann. Oper. Res..
[12] Vittorio Maniezzo,et al. The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..
[13] Richard F. Hartl,et al. Applying the ANT System to the Vehicle Routing Problem , 1999 .
[14] Qiang Yang,et al. Theory and Algorithms for Plan Merging , 1992, Artif. Intell..