Iterative Prototype Optimisation with Evolved Improvement Steps
Evolutionary algorithms have already been more or less successfully applied to a wide range of optimisation problems. Typically, they are used to evolve a population of complete candidate solutions to a given problem, which can be further refined by some problem-specific heuristic algorithm. In this paper, we introduce a new framework called Iterative Prototype Optimisation with Evolved Improvement Steps. This is a general optimisation framework, where an initial prototype solution is being improved iteration by iteration. In each iteration, a sequence of actions/operations, which improves the current prototype the most, is found by an evolutionary algorithm. The proposed algorithm has been tested on problems from two different optimisation problem domains – binary string optimisation and the traveling salesman problem. Results show that the concept can be used to solve hard problems of big size reliably achieving comparably good or better results than classical evolutionary algorithms and other selected methods.
KeywordsGenetic Algorithm Evolutionary Algorithm Travel Salesman Problem Tournament Selection Simple Genetic Algorithm
Unable to display preview. Download preview PDF.
- 1.Faigl, J., Kulich, M., Přeučil, L.: Multiple traveling salesmen problem with hierarchy of cities in inspection task with limited visibility. In: proceedings of the 5thWorkshop on Self-Organizing Maps, Universit Paris-Sud, pp. 91–98 (2005)Google Scholar
- 2.Forrest, S., Mitchell, M.: Relative building-block fitness and the Building Block Hypothesis. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, vol. 2, pp. 109–126. Morgan Kaufmann, San Mateo (1993)Google Scholar
- 3.Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. In: Genetic Algorithms and Evolutionary Computation, vol. 7, Kluwer Academic Pub., Dordrecht (2002), ISBN: 1402070985Google Scholar
- 4.Kubalík, J., Rothkrantz, L.J.M., Lažanský, J.: Genetic Algorithms with Limited Convergence. In: Grana, M., Duro, R.J., Anjou, A.d., Wang P.P., (eds.) Information Processing with Evolutionary Algorithms: From Industrial Applications to Academic Speculations, pp. 233–254 (2005), ISBN: 1-85233-866-0Google Scholar
- 6.Watson, R.A., Hornby, G.S., Pollack, J.B.: Modeling Building-Block Interdependency. In: Fifth International Conference PPSN V, pp. 97–106. Springer, Heidelberg (1998)Google Scholar
- 7.Whitley, D., Starkweather, T.: D’Ann Fuquay: Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator. In: ICGA 1989, pp. 133–140 (1989)Google Scholar
- 8.Whitley, D.: Fundamental Principles of Deception in Genetic Search. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms, pp. 221–241. Morgan Kaufmann, San Francisco (1991)Google Scholar