Cost and latency reductions through dynamic updates of order movement through a transportation network

A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process, the process comprising:

• identifying a set of orders to be shipped from a source region to a destination region using a transportation network;
• identifying candidate options for performing stops over possible routes between the source region and the destination region;
• performing a clustering analysis upon the candidate options, wherein the clustering analysis considers a plurality of order consolidation possibilities while observing timing constraints;
• identifying a lowest cost option from among the candidate options to form an identified lowest cost option;
• and
• generating a multi-stop route plan based at least in part upon the identified lowest cost option.

A computer system comprising:

• a first storage area to store a set of orders to be shipped from a source region to a destination region using a transportation network;
• a second storage area to store candidate options for performing stops over possible routes between the source region and the destination region;
• a dynamic clustering engine to perform clustering analysis upon the candidate options, wherein the clustering analysis considers a plurality of order consolidation possibilities while observing timing constraints;
• and
• a computer processor to identify at least one lower cost option from among the candidate options used to form a multi-stop route plan based at least in part upon the identified at least one lower cost option.