Systems and methods for compressing shortest path matrices for delivery route optimization

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 ini...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Fu, Mingang, Deshpande, Deepak, Seetharaman, Prakash, Pattathil, Devadas
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES GYROSCOPIC INSTRUMENTS MEASURING MEASURING DISTANCES, LEVELS OR BEARINGS NAVIGATION PHOTOGRAMMETRY OR VIDEOGRAMMETRY PHYSICS SURVEYING SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR TESTING
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.