Systems and methods for compressing shortest path matrices for delivery route optimization
US10248925B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 6, 2016 |
| Grant date | Apr 2, 2019 |
| Priority date | — |
| Expiry date | Mar 28, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG01C21/3446
- WIPO fieldMeasurement
- WIPO sectorInstruments
Abstract
Systems and methods including one or more processing modules and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform an act of preparing an initial shortest path matrix including a plurality of elements, an initial number of a plurality of map intersection nodes, and a plurality of full shortest paths between an origination map intersection node and a destination map intersection node. Each element can include a full shortest path, and each full shortest path can include one or more map intersection nodes. The one or more processing modules also can be configured to compress the initial shortest path matrix to form a compressed shortest path matrix that includes a compressed number of the plurality of map intersection nodes that is fewer than the initial number of the plurality of map intersection nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.