Dynamically routing salvage shipments and associated method
A system and method is disclosed for managing salvage shipments in a transportation network. The system includes a transportation planner coupled with one or more entities in the transportation network. The transportation planner determines an optimized transportation plan for delivery and pick-up of shipments throughout the transportation network.
1. A system for delivering regular shipments or picking-up salvage shipments at one or more locations of two or more entities in a transportation network, comprising:
a database that stores transportation data describing one or more locations of two or more entities and constraint data associated with the transportation network; and
a computer coupled with the database and configured to:
access the transportation data describing the one or more locations of the two or more entities within the transportation network;
access the constraint data associated with the transportation network, the constraint data describing a capacity of a transportation vehicle associated with regular shipments and salvage shipments;
model a transportation problem for the transportation network, based on at least a portion of the accessed transportation data describing the one or more locations of the two or more entities and the accessed constraint data describing the capacity of a transportation vehicle associated with the regular shipments and the salvage shipments;
determine an initial hub assignment of a virtual hub modeled as zero distance from at least one of the one or more locations of the two or more entities and an infinite distance from any other of the one or more locations of the two or more entities, the initial hub assignment based on the transportation problem and the accessed transportation data describing the one or more locations of the two or more entities within the transportation network;
generate multiple solutions of the initial hub assignment based on a local search operation;
generate an optimized transportation plan by merging the multiple solutions of the initial hub assignment;
communicate the optimized transportation plan to the two or more entities in the transportation network; and
route the transportation vehicle using the optimized transportation plan to one or more locations of the two or more entities in the transportation network to deliver the regular shipments or pick-up salvage shipments, wherein the salvage shipments comprise salvage equipment that is separated from the regular shipments based on the capacity of the transportation vehicle associated with regular shipments and the salvage shipments.
2. The system of claim 1 , wherein the transportation problem is modeled as dynamic hub routing problem.
3. The system of claim 1 , wherein the local search operation is selected from the group consisting of a consolidation operation, a continuous move operation, and a hub move operation.
4. The system of claim 1 , wherein the database further comprises:
transportation data describing business hours of the two or more entities;
constraint data describing a mix of salvage shipments based on the capacity of the transportation vehicle;
exclusion data describing commodity exclusions; and
a strategy file describing configurations.
5. The system of claim 1 , wherein the computer models the salvage shipments as a dynamic hub routing problem.
6. The system of claim 1 , wherein the salvage shipment is assigned an initial hub assignment.
7. The system of claim 6 , wherein the initial hub assignment is improved by a local search operation.
8. A computer-implemented method for delivering shipments or picking-up salvage shipments at one or more locations of two or more entities in a transportation network, comprising:
accessing transportation data describing the one or more locations of the two or more entities within the transportation network;
accessing constraint data associated with the transportation network, the constraint data describing a capacity of a transportation vehicle describing the one or more locations of the two or more entities;
modeling a transportation problem for the transportation network, based on at least a portion of the accessed transportation data describing the one or more locations of the two or more entities and the accessed constraint data describing the capacity of a transportation vehicle associated with the regular shipments and the salvage shipments;
determining an initial hub assignment of a virtual hub modeled as zero distance from at least one of the one or more locations of the two or more entities and an infinite distance from any other of the one or more locations of the two or more entities, the initial hub assignment based on the transportation problem and the accessed transportation data describing the one or more locations of the two or more entities within the transportation network;
generating multiple solutions of the initial hub assignment based on a local search operation;
generating an optimized transportation plan by merging the multiple solutions of the initial hub assignment;
communicating the optimized transportation plan to the two or more entities in the transportation network; and
routing the transportation vehicle using the optimized transportation plan to one or more locations of the two or more entities in the transportation network to deliver the regular shipments or pick-up salvage shipments, wherein the salvage shipments comprise salvage equipment that is separated from the regular shipments based on the capacity of the transportation vehicle associated with regular shipments and the salvage shipments.
9. The computer-implemented method of claim 8 , wherein the transportation data is data selected from the group consisting of:
data describing shipments of a transportation vehicle;
data describing capacity of a transportation vehicle;
data describing transportation costs;
data describing transportation rates;
data describing carriers; and
data describing lanes.
10. The computer-implemented method of claim 8 , wherein the transportation problem is modeled as a dynamic hub routing problem.
11. The computer-implemented method of claim 8 , wherein the local search operation selected from the group consisting of a consolidation operation, a continuous move operation, and a hub move operation.
12. The computer-implemented method of claim 11 , further comprising:
storing the optimized transportation plan in a database.
13. A non-transitory computer-readable storage media embodied with software for delivering shipments or picking-up salvage shipments at one or more locations of two or more entities in a transportation network, the software when executed using one or more computers is configured to:
access transportation data describing the one or more locations of the two or more entities within the transportation network;
access constraint data associated with the transportation network, the constraint data describing a capacity of a transportation vehicle associated with regular shipments and salvage shipments;
model a transportation problem for the transportation network, based on at least a portion of the accessed transportation data describing the one or more locations of the two or more entities and the accessed constraint data describing the capacity of a transportation vehicle associated with the regular shipments and the salvage shipments;
determine an initial hub assignment of a virtual hub modeled as zero distance from at least one of the one or more locations of the two or more entities and an infinite distance from any other of the one or more locations of the two or more entities, the initial hub assignment based on the transportation problem and the accessed transportation data describing the one or more locations of the two or more entities within the transportation network;
generate multiple solutions of the initial hub assignment based on a local search operation;
generate an optimized transportation plan by merging the multiple solutions of the initial hub assignment;
communicate the optimized transportation plan to the two or more entities in the transportation network; and
route the transportation vehicle using the optimized transportation plan to one or more locations of the two or more entities in the transportation network to deliver the regular shipments or pick-up salvage shipments, wherein the salvage shipments comprise salvage equipment that is separated from the regular shipments based on the capacity of the transportation vehicle associated with regular shipments and the salvage shipments.
14. The non-transitory computer-readable storage media of claim 13 , wherein the transportation data is data selected from the group consisting of:
data describing shipments of a transportation vehicle;
data describing capacity of a transportation vehicle;
data describing transportation costs;
data describing transportation rates;
data describing carriers; and
data describing lanes.
15. The non-transitory computer-readable storage media of claim 13 , wherein the transportation problem is modeled as a dynamic hub routing problem.
16. The non-transitory computer-readable storage media of claim 13 , wherein the local search operation selected from the group consisting of a consolidation operation, a continuous move operation, and a hub move operation.
17. The non-transitory computer-readable storage media of claim 16 , wherein the software is further configured to store the optimized transportation plan in a database.