Patent ID: 6456996
Filing Date: 2002-09-24
Classification: G06Q,Y10S

Abstract:
A local search method of solving an optimization problem having a set of decisions to be made subject to a set of constraints, comprising the steps of:defining an initial abstract solution, representing a prioritized set of decisions; building a concrete solution in accordance with said prioritized decisions, subject to said constraints, the concrete solution including all decisions to be made in solving the optimization problem; analyzing said concrete solution to determine at least one flaw in said concrete solution; modifying said priorities in response to said analyzing step; generating at least one local move from said concrete solution, said move representing rectification of said flaw and re-prioritization of said decisions; re-defining said abstract solution by making said local move; and interactively repeating said building, analyzing, modifying, generating, and re-defining steps without adding any additional decisions.