US 2006/0224536 A1Published application

Genetic optimization computer system

AssigneeInternational Business Machines Corporation

InventorsPeter Todd, Stephen Todd

Life of this patent

Estimating the term…

Loading patent…

Abstract

A genetic optimization computer system comprises a model and an optimizer. The model defines the structure of a candidate solution to a problem as a plurality of objects in combination (A,B,C). The objects consist of defined parameters (x,y). The model also runs potential solutions to the problem and generates an output. The optimizer stores potential solution candidates and crosses pairs of them to produce new child solution candidates which are run by the model. The child solutions are evaluated on the basis of the model output and their fitness for purpose indicated, and identified to the optimizer. The model also defines at least one group of objects which are identically structured and equivalent to each other. By associating each object of the defined group from one solution candidate with an object of the defined group from another solution candidate so as to minimize the difference between the respective groups prior to crossing the candidates, a faster convergence towards an optimum solution is achieved.

Claims16

Dependent claims

A genetic optimization computer system comprising:

a model defining the structure of a candidate solution to a problem as a plurality of objects in combination, the objects consisting of defined parameters, the model further including means to run potential solutions to the problem and to generate an output;
an optimizer including a store for storing a plurality of potential solution candidates to the problem, which solution candidates are combinations of object instances having specific values substituted for parameters;
means for crossing a parent pair of solution candidates to produce a new child solution candidate;
and means for inputting the new child solution candidate to the model in order for the model to run the child solution candidate and generate said model output;
the system further including fitness indicating means for indicating on the basis of the model output the relative fitness for purpose of the child solution candidate and means responsive thereto for identifying relatively fitter child solution to the optimizer;
wherein the model further defines at least one group of objects to be identically structured and equivalent to each other and the optimizer further includes means for associating each object of the defined group from one solution candidate with an object of the defined group from another solution candidate so as to minimize the difference between the objects of the respective groups prior to crossing of the solution candidates.

3 more elements

A method of genetic optimization for implementation in a computer system, which system comprises a stored model defining the structure of a candidate solution to a problem as a plurality of objects in combination, the objects consisting of defined parameters, the model further including means to run potential solutions to the problem and to generate an output;

and a solution store for storing a plurality of potential solution candidates, which solution candidates are combinations of object instances having specific values substituted for parameters;
the method comprising the steps of:
crossing a parent pair of solution candidates to produce a new child solution candidate;
running the child solution candidate in the model to generate said model output;
indicating on the basis of the model output the relative fitness for purpose of the child solution candidate;
and
identifying relatively fitter child solution candidates for storage in the solution store;
wherein the model further defines at least one group of objects to be identically structured and equivalent to each other and the method includes the further step of:
prior to the crossing of the parent pair of solution candidates, associating each object of the defined group from one solution candidate with an object of the defined group from another solution candidate so as to minimize the difference between the objects of the respective groups.

6 more elements

Dependencies are inferred from the claim text.