Abstract: The embodiments disclosed herein relate to concurrently displaying maps visualizing different subsets of transportation planning data. The concurrently displayed maps are automatically updated based on changes to the transportation planning data. A map locking functionality prevents the locked map from being updated based on changes to the transportation planning data. Other non-locked maps continue to be updated based on the changes to the transportation planning data. The map locking functionality allows for visualizing and comparing different states of the transportation planning data.

Abstract: The embodiments disclosed herein relate to computing a transportation plan for transporting goods from one place to another across a number of shipments and that satisfy multiple shipment orders. The transportation plan may specify a transportation channel that includes one or more segments selected from service provider rate offerings that may include a means of transportation, starting location, destination location, and cost of the segment. An actionable transportation plan may be computed based on current transportation planning data. Alternative plans may be computed for a variety of scenarios in which hypothetical changes are introduced to the transportation planning data. Any combination of an actionable transportation plan and alternative plans may be computed concurrently with computations sharing a common cache of production data.

Abstract: The embodiments disclosed herein relate to concurrently displaying maps visualizing different subsets of transportation planning data. The concurrently displayed maps are automatically updated based on changes to the transportation planning data. A map locking functionality prevents the locked map from being updated based on changes to the transportation planning data. Other non-locked maps continue to be updated based on the changes to the transportation planning data. The map locking functionality allows for visualizing and comparing different states of the transportation planning data.

Abstract: The embodiments disclosed herein relate to computing a transportation plan for transporting goods from one place to another across a number of shipments and that satisfy multiple shipment orders. The transportation plan may specify a transportation channel that includes one or more segments selected from service provider rate offerings that may include a means of transportation, starting location, destination location, and cost of the segment. An actionable transportation plan may be computed based on current transportation planning data. Alternative plans may be computed for a variety of scenarios in which hypothetical changes are introduced to the transportation planning data. Any combination of an actionable transportation plan and alternative plans may be computed concurrently with computations sharing a common cache of production data.

Abstract: A method, system, and computer program product for shipping management. The computer implemented method commences upon identifying a set of orders to be shipped from a source region to a destination region using a transportation network, and determining candidate options for performing stops over possible routes between the source region and the destination region. A clustering analysis process is performed over the candidate options such that the clustering analysis considers many order consolidation possibilities while observing timing constraints. Low-cost options from among the candidate options are considered to identify one or more low-cost options, and a multi-stop route plan is generated to correspond to a selected low-cost option. The orders are shipped in accordance with the multi-stop route plan, and in accordance with the corresponding consolidation of the set of orders.

Abstract: A method, system, and computer program product for enterprise software application modules for order consolidation management. The method commences by receiving a set of orders where individual orders have one or more order constraints, then mapping the orders onto one or more transportation legs, where the individual transportation legs have leg constraints. A set of feasible paths through the legs for the orders is generated and ranked based on a total cost through the legs to pick-up an order from a source location and deliver it to a destination location. The method continues by determining a set of shortest paths through a transportation network for the set of orders, wherein the determination of any one of the shortest paths is made subject to honoring respective order constraints while concurrently honoring the leg constraints. The orders are then remapped onto one of the shortest paths.

Abstract: A method, system, and computer program product for shipping management. The computer implemented method commences upon receiving a first set of orders to be shipped to a destination region in accordance with a first set of timing constraints, then building a first set of multi-stop shipments, the first set of multi-stop shipments comprising a first multi-stop carrier schedule that satisfies the set of timing constraints. The method waits a calculated duration before receiving a second set of orders to be shipped to the destination region in accordance with a second set of timing constraints. A second set of multi-stop shipments is built, wherein the second set of multi-stop shipments comprises a second multi-stop carrier schedule for at least one stop not included in the first set of multi-stop shipments, and the second multi-stop carrier schedule satisfies both the first set of timing constraints and the second set of timing constraints.

Abstract: One embodiment is a three dimensional load method for simulating loading of items into at least one container to be transported to at least one destination. The method includes receiving a list of items to be transported, determining at least one container as an optimal number and type of container to be used for transporting the items, and initializing an empty space list to include one space equal to a size of the at least one container. The method also includes initializing a placed item list and an unplaced item list, such that the placed item list includes a list of items already loaded on the at least one container and the unplaced item list includes a list of items to be loaded on the at least one container.

Abstract: A method, system, and computer program product for shipment consolidation in high-performance transportation systems. The method commences upon receiving a plurality of orders to be transported from a source location to a destination location over a transportation lane, then retrieving one or more records that describe transportation carrier resource capacity covering at least a portion of the transportation lane. An enumerator facility of the method generates a plurality of candidate shipments using the transportation carrier resource capacities. Infeasible candidate shipments such as where the transportation carrier resource capacity is exceeded are eliminated, and the remaining feasible shipments are evaluated to determine a respective cost. Then the remaining shipments are ordered based at least in part on the cost, and one of the low cost feasible shipments is selected to be used for transporting the shipment.

Abstract: A method, system, and computer program product for enterprise software application modules for order consolidation management. The method commences by receiving a set of orders where individual orders have one or more order constraints, then mapping the orders onto one or more transportation legs, where the individual transportation legs have leg constraints. A set of feasible paths through the legs for the orders is generated and ranked based on a total cost through the legs to pick-up an order from a source location and deliver it to a destination location. The method continues by determining a set of shortest paths through a transportation network for the set of orders, wherein the determination of any one of the shortest paths is made subject to honoring respective order constraints while concurrently honoring the leg constraints. The orders are then remapped onto one of the shortest paths.

Abstract: A method, system, and computer program product for shipping management. The computer implemented method commences upon receiving a first set of orders to be shipped to a destination region in accordance with a first set of timing constraints, then building a first set of multi-stop shipments, the first set of multi-stop shipments comprising a first multi-stop carrier schedule that satisfies the set of timing constraints. The method waits a calculated duration before receiving a second set of orders to be shipped to the destination region in accordance with a second set of timing constraints. A second set of multi-stop shipments is built, wherein the second set of multi-stop shipments comprises a second multi-stop carrier schedule for at least one stop not included in the first set of multi-stop shipments, and the second multi-stop carrier schedule satisfies both the first set of timing constraints and the second set of timing constraints.

Abstract: A method, system, and computer program product for shipping management. The computer implemented method commences upon identifying a set of orders to be shipped from a source region to a destination region using a transportation network, and determining candidate options for performing stops over possible routes between the source region and the destination region. A clustering analysis process is performed over the candidate options such that the clustering analysis considers many order consolidation possibilities while observing timing constraints. Low-cost options from among the candidate options are considered to identify one or more low-cost options, and a multi-stop route plan is generated to correspond to a selected low-cost option. The orders are shipped in accordance with the multi-stop route plan, and in accordance with the corresponding consolidation of the set of orders.

Abstract: A method, system, and computer program product for shipping route selection and transportation planning systems. The computer-implemented method commences upon receiving a set of candidate transportation carrier descriptions, individual ones of the set of candidate transportation carrier descriptions having one or more shipping mode options and having one or more shipping unit options. Then, the method evaluates combinations of using multiple transportation carriers that provide any of the one or more shipping mode options with compatible shipping unit options to determine a combination cost for each of the combinations. Based on the combination costs, the method selects an equipment option that corresponds to the lowest combination cost. Low-cost itineraries can be formed by calculating the cost of a particular itinerary by summing combination costs of constituent legs.

Abstract: One embodiment is directed to a method of optimally packing items into at least one resource. The method includes receiving at least one of items, resources, and parameters, and setting up a set partitioning mixed integer programming (MIP) using the received items, resources, and parameters. The method further includes solving liner programming (LP) relaxation of the MIP, generating new packings, and checking whether new packings have been generated. When no new packings have been generated, solving the final MIP and creating a model of at least one resource packed according to the final MIP.

Abstract: One embodiment is a three dimensional load method for simulating loading of items into at least one container to be transported to at least one destination. The method includes receiving a list of items to be transported, determining at least one container as an optimal number and type of container to be used for transporting the items, and initializing an empty space list to include one space equal to a size of the at least one container. The method also includes initializing a placed item list and an unplaced item list, such that the placed item list includes a list of items already loaded on the at least one container and the unplaced item list includes a list of items to be loaded on the at least one container.

Abstract: Disclosed herein is a transport manager and related method for determining an optimal, cost-minimizing set of product transportation decisions based upon expected transportation costs. Additionally, disclosed herein is an electronic execution and related method for tracking and controlling the delivery and/or pickup of products according to the optimal transportation plan and a payment manager and related method for forwarding payments and invoices for the transport of the products.