Abstract
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm for the Shortest Common Supersequence (SCS) problem, which has applications in production system planning, mechanical engineering and molecular biology. The ACO algorithm is used to find good parameters for a heuristic for the SCS problem. An island model with several populations of ants is used for the ACO algorithm. Besides we introduce a lookahead function which makes the decisions of the ants dependent on the state arrived after the decision.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Branke, M. Middendorf, and F. Schneider. Improved heuristics and a genetic algorithm for finding short supersequences. OR-Spektrum, 20:39–46, 1998.
B. Bullnheimer, R.F. Hartl, and C. Strauß. Applying the ant system to the vehicle routing problem. In 2nd Int. Conference on Metaheuristics — MIC97, 1997.
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.
M. Dorigo, V. Maniezzo, and A. Colorni. An autocatalytic optimizing process. Technical Report No. 91-016, Politecnico di Milano, Italy, 1991.
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.
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.
D.E. Foulser, M. Li, and Q. Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57:143–181, 1992.
C.B. Fraser. Subsequences and Supersequences of Strings. PhD thesis, Dept. of Computer Science, University of Glasgow, 1995.
C.B. Fraser and R.W. Irving. Approximation algorithms for the shortest common supersequence. Nordic Journal of Computing, 2:303–325, 1995.
T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput., 24:1122–1139, 1995.
U. Kohlmorgen, H. Schmeck, and K. Haase. Experiences with fine-grained parallel algorithms. to appear in Annals of Operations Research, 1997.
M. Middendorf. More on the complexity of common superstring and supersequence problems. Theoret. Comput. Sci., 124:205–228, 1994.
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.
V. G. Timkovsky. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25:565–580, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michel, R., Middendorf, M. (1998). An island model based ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056911
Download citation
DOI: https://doi.org/10.1007/BFb0056911
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive