Patent ID: 8458106
Filing Date: 2013-06-04
Classification: G06N

Abstract:
1. A method comprising: determining a plurality of constraint compliant values for each of a plurality of constrained variables of an optimization problem, wherein the plurality of constraint compliant values comply with a constraint condition that constrains possible values that can be used for the plurality of constrained variables; generating a population of constraint compliant candidate solutions for a computer-based simulation that implements a population-based optimization algorithm for the optimization problem, wherein the constraint compliant candidate solutions use a subset of the plurality of constraint compliant values and each of the constraint compliant candidate solutions comply with the constraint condition; while running the computer-based simulation with the population of constraint compliant candidate solutions, determining that a child candidate solution created from two of the constraint compliant candidate solutions fails to comply with the constraint condition; and modifying the child candidate solution to use at least one value randomly selected from the plurality of constraint compliant values for a corresponding one of the plurality of constrained variables resulting in a modified child candidate solution that complies with the constraint condition.