Abstract
Conventional evolutionary algorithms operate in a fixed search space with limiting parameter range, which is often predefined via a priori knowledge or trial and error in order to ‘guess’ a suitable region comprising the global optimal solution. This requirement is hard, if not impossible, to fulfil in many real-world optimization problems since there is often no clue of where the desired solutions are located in these problems. Thus, this paper proposes an inductive–deductive learning approach for single- and multi-objective evolutionary optimization. The method is capable of directing evolution towards more promising search regions even if these regions are outside the initial predefined space. For problems where the global optimum is included in the initial search space, it is capable of shrinking the search space dynamically for better resolution in genetic representation to facilitate the evolutionary search towards more accurate optimal solutions. Validation results based on benchmark optimization problems show that the proposed inductive–deductive learning is capable of handling different fitness landscapes as well as distributing nondominated solutions uniformly along the final trade-offs in multi-objective optimization, even if there exist many local optima in a high-dimensional search space or the global optimum is outside the predefined search region.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 15 January 2001 / Revised 8 June 2001 / Accepted in revised form 24 July 2001
Rights and permissions
About this article
Cite this article
Khor, E., Tan, K. & Lee, T. Learning the Search Range for Evolutionary Optimization in Dynamic Environments. Knowl Inform Sys 4, 228–255 (2002). https://doi.org/10.1007/s101150200006
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101150200006