By Topic

Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xidong Jin ; Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA ; Reynolds, R.G.

The key idea behind cultural algorithms is to acquire problem solving knowledge (beliefs) from the evolving population and in return apply that knowledge to guide the search (R.G. Reynolds et al., 1993; 1996), In solving nonlinear constraint optimization problems, the key problem is how to represent and store the knowledge about the constraints. Previously, Chung (Chan-Jin Chung and R.G. Reynolds, 1996; 1998) used cultural algorithms to solve unconstraint optimization problems. Use was made of interval schemata proposed by L.J. Eshelman and J.D. Schaffer (1992) to represent global knowledge about the independent problem parameters. However, in constraint optimization, the problem intervals generally must be modified dependently. In order to solve constraint optimization problems, we need to extend the interval representation to allow for the representation of constraints. We define an n-dimensional regional based schema, called belief cell, which can provide an explicit mechanism to support the acquisition, storage and integration of knowledge about the constraints. In a cultural algorithm framework, the belief space can “contain” a set of these schemata, each of them can be used to guide the search of the evolving population, i.e. these kind of region based schemata can be used to guide the optimization search in a direct way by pruning the unfeasible regions and promoting the promising regions. We compared the results of 4 CA configurations that manipulate these schemata for an example problem

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference: