Automated partitioning of transportation routing problems
First Claim
1. A method for automated partitioning of transportation routing problems by a data processing system, comprising:
- determining, by the data processing system, a threshold number of shipments per partition, wherein determining a threshold number of shipments per partition is determined dynamically based on a heuristic function;
initially dividing, by the data processing system, a routing problem into geographic centers to form a plurality of geographic center routing problems for each of the geographic centers;
selecting, by the data processing system, a geographic center from the geographic centers;
mapping, by the data processing system, delivery and/or pickup sites at geographic locations around the geographic center;
scanning, by the data processing system, radially around the geographic center to determine a sparsest or densest region of the sites and selecting a starting point in this region;
progressing, by the data processing system responsive to the scanning, from the starting point radially around the geographic center aggregating the sites into partitions with a maximum of the threshold number of shipments in each partition; and
outputting, for each of the partitions, a set of routes that each comprise a vehicle, a list of shipments for the vehicle, and unload events associated with the vehicle.
2 Assignments
0 Petitions
Accused Products
Abstract
Method and system are provided for automated partitioning of transportation routing problems. The method includes: determining a threshold number of shipments per partition; selecting a geographic center; mapping delivery and/or pickup sites at geographic locations; scanning radially around the geographic center to determine the sparsest or densest region of sites and selecting a starting point in this region; and progressing from the starting point radially around the geographic center aggregating sites into partitions with a maximum of the threshold number of shipments in a partition. The method may include: solving each partitioned instance of a problem to generate one or more optimized routes; and creating a union of all the instances solutions.
-
Citations
15 Claims
-
1. A method for automated partitioning of transportation routing problems by a data processing system, comprising:
-
determining, by the data processing system, a threshold number of shipments per partition, wherein determining a threshold number of shipments per partition is determined dynamically based on a heuristic function; initially dividing, by the data processing system, a routing problem into geographic centers to form a plurality of geographic center routing problems for each of the geographic centers; selecting, by the data processing system, a geographic center from the geographic centers; mapping, by the data processing system, delivery and/or pickup sites at geographic locations around the geographic center; scanning, by the data processing system, radially around the geographic center to determine a sparsest or densest region of the sites and selecting a starting point in this region; progressing, by the data processing system responsive to the scanning, from the starting point radially around the geographic center aggregating the sites into partitions with a maximum of the threshold number of shipments in each partition; and outputting, for each of the partitions, a set of routes that each comprise a vehicle, a list of shipments for the vehicle, and unload events associated with the vehicle. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A data processing system for automated partitioning of transportation routing problems, comprising:
-
a processor coupled to a memory device having executable program code stored therein, wherein the data processing system comprises; a threshold constant component that is configured to determine a threshold number of shipments per partition, wherein the threshold constant component includes a dynamic threshold adjusting component that is configured to determine a threshold number of shipments per partition dynamically based on a heuristic function; a center partitioning component that is configured to initially divide a routing problem into geographic centers to form a plurality of geographic center routing problems for each of the geographic centers; a center selection component that is configured to select a geographic center from the geographic centers; a site mapping component that is configured to map delivery and/or pickup sites at geographic locations around the geographic center; a radially scanning component that is configured to scan radially around the geographic center to determine a sparsest or densest region of the sites and select a starting point in this region; a site aggregating component that is configured to progress, responsive to the scan, from the starting point radially around the geographic center aggregating the sites into partitions with a maximum of the threshold number of shipments in each partition; and an output component configured to provide to a transportation routing system, for each of the partitions, a set of routes that each comprise a vehicle, a list of shipments for the vehicle, and unload events associated with the vehicle. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A non-transitory computer readable storage device storing a computer program thereon which, upon execution by a computer, causes the computer to perform steps comprising:
-
determining a threshold number of shipments per partition, wherein determining a threshold number of shipments per partition is determined dynamically based on a heuristic function; initially dividing a routing problem into geographic centers to form a plurality of geographic center routing problems for each of the geographic centers; selecting a geographic center from the geographic centers; mapping delivery and/or pickup sites at geographic locations around the geographic center; scanning radially around the geographic center to determine a sparsest or densest region of the sites and selecting a starting point in this region; responsive to the scanning, progressing from the starting point radially around the geographic center, aggregating the sites into partitions with a maximum of the threshold number of shipments in each partition; and outputting a set of routes, for each of the partitions, that each comprise a vehicle, a list of shipments for the vehicle, and unload events associated with the vehicle. - View Dependent Claims (15)
-
Specification