Redistribution of parts in a distribution network
View Patent ↗Redistributing parts includes defining locations. An actual inventory of parts is established among the locations, and a desired allocation of the parts is established among the locations. A demand for the parts at each location is determined using the actual inventory and the desired allocation. Paths are determined, where a path transfers an excess part from one location to another location. A transfer function describing a cost of transferring the excess part along the paths is generated. The transfer function is optimized to achieve the desired allocation of the excess parts at a minimum cost.
1. A computer-implemented system comprising one or more processing units operable to execute one or more software components to:
define a plurality of locations for redistributing a plurality of parts;
establish an actual inventory of the plurality of parts among the plurality of locations;
establish a desired distribution of the plurality of parts among the plurality of locations;
determine a demand for each of the plurality of parts at each of the plurality of locations using the actual inventory and the desired distribution;
add one or more dummy locations, each of the one or more dummy locations comprising a positive demand for attracting a plurality of excess parts;
determine a plurality of paths, each path being operable to transfer at least one of the plurality of parts from one location to another location, wherein the plurality of paths include at least one path to the one or more dummy locations that is associated with an infinite transfer cost;
generate a transfer function describing a cost of transferring the plurality of excess parts along the plurality of paths; and
optimize the transfer function to achieve the desired distribution of the plurality of parts at minimum cost.
2. The system of claim 1 , wherein:
the transfer function further describes the cost being associated with transferring at least one of the plurality of parts along a plurality of alternative paths; and
the one or more processing units are further operable to execute the one or more software components to optimize the transfer function by minimizing the transfer function.
3. The system of claim 1 , wherein the one or more processing units are further operable to execute the one or more software components to determine the plurality of paths by sending a notification if there is no path between one location and another location.
4. The system of claim 1 , wherein the one or more processing units are further operable to execute the one or more software components to establish the desired distribution by calculating an optimized distribution of the plurality of excess parts among the plurality of locations.
5. The system of claim 1 , wherein the one or more processing units are further operable to execute the one or more software components to add the one or more dummy locations with an associated demand and the infinite transfer cost.
6. The system of claim 1 , wherein the one or more processing units are further operable to execute the one or more software components to satisfy a constraint requiring that at least one of the plurality of parts transferred to at least one of the plurality of locations and at least one of the plurality of parts transferred from at least one of the plurality of locations satisfy the demand for each of the plurality of parts at each of the plurality of locations.