Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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: 1402070985
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-0
Uyar, S., Sariel, S., Eryigit, G.: A gene based adaptive mutation strategy for genetic algorithms. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 271–281. Springer, Heidelberg (2004)
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)
Whitley, D., Starkweather, T.: D’Ann Fuquay: Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator. In: ICGA 1989, pp. 133–140 (1989)
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)
Whitley, D., Mathias, K., Rana, S., Dzubera, J.: Evaluating Evolutionary Algorithms. Artificial Intelligence 85, 245–2761 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kubalik, J., Faigl, J. (2006). Iterative Prototype Optimisation with Evolved Improvement Steps. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_14
Download citation
DOI: https://doi.org/10.1007/11729976_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33143-8
Online ISBN: 978-3-540-33144-5
eBook Packages: Computer ScienceComputer Science (R0)