US 12,361,369 B2
Systems and methods for determining duty costs associated with a supply chain network
Tung Hoang Le, Waterloo (CA); Zheng Ouyang, Ann Arbor, MI (US); Seyed Ali Taghavi Behbahani, Ann Arbor, MI (US); and Gary Robert Strickler, Ann Arbor, MI (US)
Assigned to Coupa Software Incorporated, Foster City, CA (US)
Filed by Coupa Software Incorporated, San Mateo, CA (US)
Filed on Nov. 15, 2023, as Appl. No. 18/509,760.
Application 18/509,760 is a continuation of application No. 17/185,942, filed on Feb. 25, 2021, granted, now 11,868,950.
Prior Publication US 2024/0086830 A1, Mar. 14, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. G06Q 10/0834 (2023.01)
CPC G06Q 10/08345 (2013.01) 14 Claims
OG exemplary drawing
 
1. A computer-implemented method executed using one or more processors, the method comprising:
receiving input data comprising an order to provide a quantity of one or more finished goods to a site through a supply chain network, the one or more finished goods each comprising one or more raw materials;
accessing information comprising respective locations of a plurality of sites of a supply chain network, the input data and information being stored in computer memory;
decomposing, by the one or more processors, the supply chain network into one or more sub-networks to reduce a computer memory requirement prior to an enumeration of one or more path solutions, wherein a number of the one or more sub-networks is based on a number of common raw materials of the one or more raw materials;
detecting, by the one or more processors, one or more loops in the supply chain network;
prior to the enumeration of one or more path solutions, eliminating, by the one or more processors, one or more of the detected loops to reduce model processing deadlocks or errors;
enumerating, by the one or more processors and based on the input data and the accessed information, the one or more path solutions along the supply chain network or along the one or more sub-networks to fulfill the order, wherein each enumerated path solution comprises a set of one or more path fragments, wherein each path fragment associated with an enumerated path solution defines a movement of a sub-quantity of the one or more finished goods or the one or more raw materials between two sites of the plurality of sites;
filtering, during or after the enumerating of the one or more path solutions and based on one or more site constraints or predetermined criteria, one or more invalid path fragments to decrease a number of possible path solutions to fulfill the order;
dynamically releasing computer memory associated with the one or more invalid path fragments to reduce the computer memory requirement;
determining, based on one or more decision criteria, one or more optimal path solutions for the order;
outputting one or more of the optimal path solutions for display on a client device.