Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. We consider the use of memetic algorithms (MAs) for solving this problem. A specialized local-improvement operator based on character removal and heuristic repairing plays a central role in the MA. The tradeoff between the improvement achieved by this operator and its computational cost is analyzed. Empirical results indicate that strategies based on partial lamarckism (i.e., moderate use of the improvement operator) are slightly superior to full-lamarckism and no-lamarckism.
Unable to display preview. Download preview PDF.
- 6.Hallet, M.: An integrated complexity analysis of problems from computational biology. PhD thesis, University of Victoria (1996)Google Scholar
- 9.Branke, J., Middendorf, M.: Searching for shortest common supersequences by means of a heuristic based genetic algorithm. In: Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications, pp. 105–114. Finnish Artificial Intelligence Society (1996)Google Scholar
- 15.Lehmann, E.L.: Nonparametric Statistical Methods Based on Ranks. McGraw-Hill, New York (1975)Google Scholar