An island model based ant system with lookahead for the shortest supersequence problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 692-701

  Michel, René ^a   Middendorf, Martin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MOLECULAR BIOLOGY;

ACO ALGORITHMS; ANT SYSTEMS; ISLAND MODEL; PRODUCTION SYSTEM; SHORTEST COMMON SUPERSEQUENCE; SUPERSEQUENCE;

ANT COLONY OPTIMIZATION;

EID: 84878606095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056911     Document Type: Conference Paper

References (14)

1. J. Branke, M. Middendorf, and F. Schneider. Improved heuristics and a genetic algorithm for rinding short supersequences. OR-Spektrum, 20: 39-46, 1998.
2. B. Bullnheimer, R.F. Hartl, and C. Strauß. Applying the ant system to the vehicle routing problem. In 2nd Int. Conference on Metahenristics - MIC97, 1997.
3. M. Dorigo and L.M. Gambardella. Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning, pages 252-260. Morgan Kaufmann, 1995.
4. M. Dorigo, V. Maniezzo, and A. Colorni. An autocatalytic optimizing process. Technical Report No. 91-016, Politecnico di Milano, Italy, 1991.
5. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system applied to the quadratic assignment problem. Technical Report No. IRIDIA/94-28, Universite Libre de Bruxelles, Belguim, 1994.
6. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics - Part B, 26(1): 29-41, 1996.
7. D.E. Foulser, M. Li, and Q. Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57: 143-181, 1992.
8. C.B. Fraser. Subsequences and Supersequences of Strings. PhD thesis, Dept. of Computer Science, University of Glasgow, 1995.
9. C.B. Fraser and R.W. Irving. Approximation algorithms for the shortest common supersequence. Nordic Journal of Computing, 2: 303-325, 1995.
10. T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput., 24: 1122-1139, 1995.
11. U. Kohlmorgen, H. Schmeck, and K. Haase. Experiences with fine-grained parallel algorithms, to appear in Annals of Operations Research, 1997.
12. M. Middendorf. More on the complexity of common superstring and supersequence problems. Theoret. Comput. Sci., 124: 205-228, 1994.
13. K.-J. Räihä and E. Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. Theoret. Comput. Sci., 16: 187-198, 1981.
14. V. G. Timkovsky. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25: 565-580, 1990.