IP Library Granted Patent US 8,429,035
Granted Patent B1
US 8,429,035 · App. 12/860,683 · Granted Apr 23, 2013

System and method of solving large scale supply chain planning problems with integer constraints

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,429,035
App. No.
12/860,683
Granted
Apr 23, 2013
Kind
B1
Abstract

A system and method is disclosed for solving supply chain planning problems. The system includes a database that stores data representing a planning problem of a supply chain network and a computer configured to access the planning problem of the supply chain network stored in the database and model the planning problem as a network of nodes and edges. The computer is further configured to generate a hierarchical linear programming solution of the planning problem and apply advanced heuristics to the generated hierarchical linear programming solution. The computer is still further configured to formulate a mixed integer program to generate an optimized global hierarchical solution and store the generated optimized global hierarchical solution in the database.

Claims (41)

1. A system for solving supply chain planning problems, comprising:

a database that stores data representing a planning problem of a supply chain network; and

a computer coupled with the database and configured to:

access the planning problem of the supply chain network stored in the database;

model the planning problem as a network of nodes and edges;

generate a hierarchical linear programming solution of the planning problem;

apply advanced heuristics to the generated hierarchical linear programming solution to obtain an integer feasible solution;

formulate a mixed integer program based on the integer solution to generate an optimized global hierarchical solution; and

store the generated optimized global hierarchical solution in the database.

2. The system of claim 1 , wherein the computer is further configured to model the planning problem as a network of nodes and edges.

3. The system of claim 1 , wherein the computer is further configured to take the hierarchical linear programming solution as a base and assign feasible integer values to discrete variables.

4. The system of claim 1 , wherein the computer is further configured to model one or more business objectives of one or more supply chain entities of the supply chain network as a hierarchy of linear objective functions and discrete decision variables.

5. The system of claim 4 , wherein the hierarchy of linear objective functions and the discrete decision variables are modeled as integer variables.

6. The system of claim 5 , wherein the computer is further configured to introduce integer variables and integer constraints and calculate values of all the objective functions.

7. The system of claim 6 , wherein the computer is further configured to introduce slack and surplus variables to the integer constraints and assign one or more values to maintain feasibility.

8. A computer-implemented method of solving supply chain planning problems, comprising:

accessing, by a computer, a planning problem of a supply chain network stored in a database;

modeling, by the computer, the planning problem as a network of nodes and edges;

generating, by the computer, a hierarchical linear programming solution of the planning problem;

applying, by the computer, advanced heuristics to the generated hierarchical linear programming solution to obtain an integer feasible solution;

formulating, by the computer, a mixed integer program based on the integer solution to generate an optimized global hierarchical solution; and

storing, by the computer, the generated optimized global hierarchical solution in the database.

9. The method of claim 8 , further comprising modeling the planning problem as a network of nodes and edge.

10. The method of claim 8 , further comprising taking the hierarchical linear programming solution as a base and assign feasible integer values to discrete variables.

11. The method of claim 8 , further comprising modeling one or more business objectives of one or more supply chain entities of the supply chain network as a hierarchy of linear objective functions and discrete decision variables.

12. The method of claim 11 , wherein the hierarchy of linear objective functions and the discrete decision variables are modeled as integer variables.

13. The method of claim 12 , further comprising introducing integer variables and integer constraints and calculating values of all the objective functions.

14. The method of claim 13 , further comprising introducing slack and surplus variables to the integer constraints and assign one or more values to maintain feasibility.

15. A non-transitory computer-readable medium embodied with software for solving supply chain planning problems, the software when executed using one or more computers is configured to:

access a planning problem of a supply chain network stored in a database;

model the planning problem as a network of nodes and edges;

generate a hierarchical linear programming solution of the planning problem;

apply advanced heuristics to the generated hierarchical linear programming solution to obtain an integer feasible solution;

formulate a mixed integer program based on the integer solution to generate an optimized global hierarchical solution; and

store the generated optimized global hierarchical solution in the database.

16. The computer-readable medium of claim 15 , wherein the software is further configured to model the planning problem as a network of nodes and edges.

17. The computer-readable medium of claim 15 , wherein the software is further configured to take the hierarchical linear programming solution as a base and assign feasible integer values to discrete variables.

18. The computer-readable medium of claim 15 , wherein the software is further configured to model one or more business objectives of one or more supply chain entities of the supply chain network as a hierarchy of linear objective functions and discrete decision variables.

19. The computer-readable medium of claim 18 , wherein the hierarchy of linear objective functions and the discrete decision variables are modeled as integer variables.

20. The computer-readable medium of claim 19 , wherein the software is further configured to introduce integer variables and integer constraints and calculate values of all the objective functions.

21. The computer-readable medium of claim 20 , wherein the software is further configured to introduce slack and surplus variables to the integer constraints and assign one or more values to maintain feasibility.

Assignments (14)
RELEASE OF SECURITY INTEREST IN PATENTS PREVIOUSLY RECORDED AT REEL/FRAME (053383/0117) Recorded Nov 3, 2021
From: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGENT
To: BLUE YONDER GROUP, INC.
Reel/Frame 058794/0776 →
RELEASE OF SECURITY INTEREST Recorded Sep 16, 2021
From: JPMORGAN CHASE BANK, N.A.
To: BLUE YONDER GROUP, INC.; BLUE YONDER, INC.; JDA SOFTWARE SERVICES, INC.; I2 TECHNOLOGIES INTERNATIONAL SERVICES, LLC; MANUGISTICS SERVICES, INC.; MANUGISTICS HOLDINGS DELAWARE II, INC.; REDPRAIRIE COLLABORATIVE FLOWCASTING GROUP, LLC; JDA SOFTWARE RUSSIA HOLDINGS, INC.; REDPRAIRIE SERVICES CORPORATION; BY BOND FINANCE, INC.; BY NETHERLANDS HOLDING, INC.; BY BENELUX HOLDING, INC.
Reel/Frame 057724/0593 →
SECURITY AGREEMENT Recorded Aug 3, 2020
From: BLUE YONDER GROUP, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 053383/0117 →
CHANGE OF NAME Recorded Apr 14, 2020
From: JDA SOFTWARE GROUP, INC.
To: BLUE YONDER GROUP, INC.
Reel/Frame 052392/0388 →
SECURITY AGREEMENT Recorded Oct 12, 2016
From: RP CROWN PARENT, LLC; RP CROWN HOLDING LLC; JDA SOFTWARE GROUP, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 040326/0449 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0809 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0356 →
RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0697 Recorded Oct 12, 2016
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
To: JDA SOFTWARE GROUP, INC.
Reel/Frame 040337/0053 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0697 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jan 2, 2013
From: JDA SOFTWARE GROUP, INC.
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Reel/Frame 029556/0809 →
RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL Recorded Dec 21, 2012
From: WELLS FARGO CAPITAL FINANCE, LLC
To: JDA TECHNOLOGIES US, INC.
Reel/Frame 029529/0812 →
CHANGE OF NAME Recorded Aug 19, 2011
From: I2 TECHNOLOGIES US, INC.
To: JDA TECHNOLOGIES US, INC.
Reel/Frame 026777/0947 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2011
From: JDA TECHNOLOGIES US, INC
To: JDA SOFTWARE GROUP, INC
Reel/Frame 026778/0593 →
PATENT SECURITY AGREEMENT Recorded Apr 4, 2011
From: JDA TECHNOLOGIES US, INC.
To: WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT
Reel/Frame 026072/0353 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2010
From: KAMATH, NARASIMHA B.; SHEKHAR, TUSHAR
To: I2 TECHNOLOGIES US, INC.
Reel/Frame 025085/0817 →