Approach for solving global optimization problem
View Patent ↗An approach for solving a global optimization problem is described. Specifically, one embodiment of the disclosure sets forth a method, which includes the steps of receiving a quantitative initial solution, generating a quantitative feasible solution, mapping the quantitative feasible solution to a qualitative feasible solution, determining whether to accept the qualitative feasible solution based on a first predetermined rule, wherein the qualitative feasible solution that is accepted is reverse mapped to the quantitative feasible solution, and transmitting a result of the determining step.
1. A method for solving a global optimization problem, comprising:
receiving a quantitative initial solution;
generating a quantitative feasible solution;
consolidating a plurality of constraints of the quantitative feasible solution to a numerical resultant;
converting the numerical resultant to a qualitative feasible solution; and
determining whether to accept the qualitative feasible solution based on a first predetermined rule, wherein the qualitative feasible solution that is accepted is reverse mapped to the quantitative feasible solution.
2. The method of claim 1 , further comprising applying a weight to a constraint.
3. The method of claim 2 , wherein the first predetermined rule is associated with the weight.
4. The method of claim 1 , wherein the qualitative feasible solution rejected in the determining step is further processed based on a second predetermined rule.
5. The method of claim 4 , wherein the second predetermined rule is associated with a business consideration.
6. The method of claim 4 , wherein the qualitative feasible solution is associated with a plurality of business perspective constraints.
7. The method of claim 6 , further comprising consolidating the plurality of business perspective constraints to a business perspective numeral and converting the business perspective numeral to a business perspective qualitative identifier.
8. The method of claim 4 , wherein the qualitative feasible solution is accepted to be further analyzed if the business perspective qualitative identifier complies with the second predetermined rule.
9. The method of claim 5 , wherein the business consideration includes business related information associated with a specific customer.
10. The method of claim 1 , wherein the quantitative feasible solution that is reverse mapped is further analyzed by a simulated annealing method.
11. The method of claim 1 , further comprising generating a new quantitative feasible solution when the qualitative feasible solution is rejected in the determining step.
12. The method of claim 7 , further comprising generating a new quantitative feasible solution if the business perspective qualitative identifier fails to comply with the second predetermined rule.
13. The method of claim 1 , wherein the global optimization problem is a vehicle routing problem within a time window.
14. A computing device configured to solve a global optimization problem, comprising:
a memory; and
a processing unit arranged to interface with the memory, wherein the processing unit is configured to:
receive a quantitative initial solution;
generate a quantitative feasible solution;
consolidate a plurality of constraints of the quantitative feasible solution to a numerical resultant;
convert the numerical resultant to a qualitative feasible solution; and
determine whether to accept the qualitative feasible solution based on a first predetermined rule, wherein the qualitative feasible solution that is accepted is reverse mapped to the quantitative feasible solution.
15. The computing device of claim 14 , wherein the processing unit is further configured to apply a weight to a constraint.
16. The computing device of claim 14 , wherein the qualitative feasible solution not accepted by the computing device is further processed based on a second predetermined rule associated with a business consideration.
17. A non-transitory computer-readable medium containing a sequence of instructions for solving a global optimization problem, which when executed by a computing device, causes the computing device to:
receive a quantitative initial solution;
generate a quantitative feasible solution;
consolidate a plurality of constraints of the quantitative feasible solution to a numerical resultant;
convert the numerical resultant to a qualitative feasible solution; and
determine whether to accept the qualitative feasible solution based on a first predetermined rule, wherein the qualitative feasible solution that is accepted is reverse mapped to the quantitative feasible solution.