Method for optimizing a solution set
First Claim
1. A method for optimizing a solution set for a problem comprising the sequential steps of:
- a) generating a first set of solutions comprising a plurality of members;
b) creating a second set of solutions using a selection operator to select members from said first set of solutions;
c) creating a probabilistic model fitting said second set of solutions, said probabilistic model allowing for multiple variables to be merged together to form a single new variable whereby hierarchically decomposable problems can be modeled;
d) using said model to generate a third set of solutions; and
, e) replacing at least a portion of said first set of solutions with said third set of solutions to create a new solution set.
4 Assignments
0 Petitions
Accused Products
Abstract
An embodiment of a method for optimizing a solution set has steps of generating a first solution set, selecting a second solution set from the first, fitting the second solution set with a probabilistic model, using the model to generate a new set of solutions, replacing at least a portion of the first set of solutions with the third, and evaluating the third set to determine if completion criteria have been met. A probabilistic model may allow for merging a plurality of variables into a single variable and for modeling relationships between the merged variables over multiple hierarchical levels. Invention method embodiments may also comprise steps of niching to preserve diversity among the solution set.
171 Citations
46 Claims
-
1. A method for optimizing a solution set for a problem comprising the sequential steps of:
-
a) generating a first set of solutions comprising a plurality of members;
b) creating a second set of solutions using a selection operator to select members from said first set of solutions;
c) creating a probabilistic model fitting said second set of solutions, said probabilistic model allowing for multiple variables to be merged together to form a single new variable whereby hierarchically decomposable problems can be modeled;
d) using said model to generate a third set of solutions; and
,e) replacing at least a portion of said first set of solutions with said third set of solutions to create a new solution set. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
-
33. A method for optimizing a solution set for a problem comprising the steps of:
-
generating a first set of solutions comprising a plurality of members;
creating a second set of solutions by selecting a sub-set of members from said first set of solutions;
creating a probabilistic model fitting said second set of solutions;
using said model to generate a third set of solutions; and
,replacing at least a portion of said first set of solutions with said third set of solutions to create a new solution set, said replacing comprising niching to preserve diversity among members of said new solution set. - View Dependent Claims (34, 35, 36, 37)
-
-
38. A method for optimizing a solution set for a problem comprising the sequential steps of:
-
a) generating a first set of solutions comprising a plurality of members;
b) creating a second set of solutions using a selection operator to select a second set of members from said first set of solutions, said selection operator using a fitness function to evaluate said members of said first set, said second set members having a high fitness;
c) building a network to model a probability distribution of said second set of solutions, said network representing a plurality of merged variables as a single variable, said network representing dependencies and independencies between at least two of said merged variables over a plurality of hierarchical levels;
d) using said model to generate a third set of solutions;
e) replacing at least a portion of said first set of solutions with said third set of solutions to create a new solution set, said replacing comprising niching to preserve diversity among members of said new solution set; and
f) evaluating said new solution set to determine if completion criteria have been satisfied, and if said completion criteria are not satisfied replacing said first set of solutions with said new set of solutions and repeating the steps of b) through e) until said completion criteria are satisfied.
-
-
39. A computer program product for optimizing a solution set, the program product comprising computer executable instructions stored on a computer readable medium that when executed by a computer cause the computer to:
-
a) create a second set of solutions using a selection operator to select members from a first set of solutions;
b) build a probabilistic model fitting said second set of solutions, said probabilistic model allowing for multiple variables to be merged together to form a single new variable, and said model allowing for relationships to be modeled between at least a portion of said single new variables over a plurality of hierarchical levels;
c) using said model to generate a third set of solutions;
d) replacing at least a portion of said first set of solutions with said third set of solutions to create a new solution set; and
,e) evaluating said third set of solutions to determine if completion criteria have been satisfied. - View Dependent Claims (40, 41, 42, 43, 44)
-
-
45. A computer program product for optimizing a solution set, the program product comprising computer executable instructions stored on a computer readable medium that when executed by a computer cause the computer to:
-
a) create a second set of solutions using a selection operator that selects members from a first set of solutions;
b) build a probabilistic model that fits said second set of solutions;
c) use said model to generate a third set of solutions;
d) replace at least a portion of said first set of solutions with said third set of solutions to create a new solution set using niching to preserve diversity among said new solution set;
e) evaluate said third set of solutions to determine if completion criteria have been satisfied, and if said completion criteria have not been satisfied to replace said first set of solutions with said new set and to repeat steps a)-e). - View Dependent Claims (46)
-
Specification