Patent ID: 8069127
Filing Date: 2011-11-29
Classification: G06N

Abstract:
1. A method of solving an optimization problem comprising a plurality of dynamic constraints, the method being implemented by a computer including at least one processor and comprising the steps of: creating, using the at least one processor, a constraint graph corresponding to the plurality of dynamic constraints of the optimization problem, wherein the constraint graph includes a node set and an edge set, wherein the constraint graph includes one or more subgraphs whose node set and edge set are subsets of the node set and the edge set of the constraint graph, and wherein potential feasible solutions correspond to one or more connected subgraphs; generating, using the at least one processor, a plurality of solutions to the optimization problem using a genetic algorithm having a plurality of iterations; modifying the constraint graph by changing one of the plurality of dynamic constraints, wherein the step of modifying the constraint graph occurs only between iterations of the genetic algorithm; and after modifying the constraint graph, discarding, using the at least one processor, each one of the plurality of solutions that does not correspond to a connected subgraph of the modified constraint graph.