Abstract: A network may be organized to provide components. Components may be generated by combining other components (sub-components) together, and components may be provided by resources in the network. This network may be represented by a graph of nodes representing components and resources. In order to efficiently analyze this graph to generate a network plan, the graph may be subdivided into independent sub-graphs. Individual resources may be shared by individual sub-graphs and considered independent when those resources are underutilized or otherwise unconstrained. Models may be used to predict which resources are unconstrained and allow those resources to be shared by otherwise independent sub-graphs, thereby increasing the decomposition of the graph and improving the efficiency of the network plan analysis.

Abstract: Techniques for generating recommendations for redistributing product inventories are disclosed. A product redistribution system applies hierarchal prioritization of product locations to generate a plan for redistributing products among the product locations. A system identified product repositories organized into clusters. A product redistribution plan first redistributes products among repositories within a cluster. Then the system redistributes products between different clusters. A system predicts whether repositories have excess products or product shortages by applying product excess windows and product shortage windows to inventory data. The system predicts supply and demand of a product over a period of time including the product supply window and the product shortage window. The system generates the product redistribution plan based on the predicted product excess predictions and product shortage predictions.

Abstract: Embodiments of the invention provide systems and methods for fair share allocation of inventory levels throughout a supply chain. According to one embodiment, a first round main Linear Programming (LP) solve can generate an initial solution. Post-processing heuristics for fair sharing can be applied to the first round solve of the main LP. Circular sourcing heuristics can be applied to the first round solve when adjusting for fair sharing allocation requirements. For example, applying the circular sourcing heuristics to the first round solve of the main LP can comprise determining a firmed supply surplus and shortage based on a demand picture from the first round solve of the main LP adjusted for fair sharing. A second round main LP solve can be executed using the fixed inter-organizational transfer variables and fixed supply towards independent demand variables from the post-processing heuristics.

Abstract: Systems, methods, and machine-readable media are disclosed to allocating inventory across a plurality of locations in a supply chain. In one embodiment, a method comprises determining a total time-phased inventory and target safety stock level for each of the items at each location based on the baseline inventory as determined from expected demand and lead times for each item at each location, a target service level, a demand uncertainty level, a lead time uncertainty level, carrying costs in the supply chain and user constraints on budget, capacity and inventory.

Abstract: Example systems, methods, computer-readable media, software, and other embodiments are described herein that relate to optimizing carrier selection for a transportation planning system. In one embodiment, given a set of trips that have been defined to transport a set of configured loads, a carrier selection logic can be provided that is configured to analyze the set of trips and attempt to repair or cure one or more constraint violations that may exist in one or more of the trips. For example, the repair may include attempting to reassign a carrier (e.g. carrier/service/vehicle type) that is assigned to a trip to a different carrier in order to reduce overall constraint violations for the set of trips and may reduce the overall global cost for the set of trips.

Abstract: Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action.

Abstract: Systems, methods, and machine-readable media are disclosed to allocating inventory across a plurality of locations in a supply chain. In one embodiment, a method comprises determining a total time-phased inventory and target safety stock level for each of the items at each location based on the baseline inventory as determined from expected demand and lead times for each item at each location, a target service level, a demand uncertainty level, a lead time uncertainty level, carrying costs in the supply chain and user constraints on budget, capacity and inventory.

Abstract: Systems, methodologies, media, and other embodiments associated with multi-level pooling in transportation planning are described. One exemplary method embodiment includes, co-operatively and in parallel choosing pooling points and order-legs to consolidate. The example method may also include constructing a cost-optimal trip based, at least in part, on the contemporaneously chosen pooling points and orders-legs.

Abstract: Example systems, methods, computer-readable media, software, and other embodiments are described herein that relate to optimizing carrier selection for a transportation planning system. In one embodiment, given a set of trips that have been defined to transport a set of configured loads, a carrier selection logic can be provided that is configured to analyze the set of trips and attempt to repair or cure one or more constraint violations that may exist in one or more of the trips. For example, the repair may include attempting to reassign a carrier (e.g. carrier/service/vehicle type) that is assigned to a trip to a different carrier in order to reduce overall constraint violations for the set of trips and may reduce the overall global cost for the set of trips.

Abstract: Systems, methodologies, media, and other embodiments associated with parallel optimization in transportation planning are described. One exemplary method embodiment may include selecting, in parallel, candidate loads to satisfy a set of orders, selecting final loads from the candidate loads, and in parallel selectively manipulating the final loads into a transportation plan that reduces a transportation cost.

Abstract: Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action.