| CPC H04L 45/24 (2013.01) [G06Q 10/08355 (2013.01); H04L 45/02 (2013.01); H04L 45/123 (2013.01)] | 20 Claims |

|
1. A non-transitory computer-readable medium comprising program code that is executable by one or more processors to cause the one or more processors to:
receive a predetermined set of routes for moving cargo through a network;
construct a model based on the predetermined set of routes, wherein the model includes a predefined objective function and one or more constraints, and wherein the model defines a combinatorial optimization problem that is solvable to identify an optimal set of routes from the predetermined set of routes that most closely satisfies the predefined objective function subject to the one or more constraints;
execute an iterative process using the model to solve the combinatorial optimization problem and thereby determine the optimal set of routes through the network, wherein executing the iterative process includes:
executing a first iteration of the model in which vias and diversions in the predetermined set of routes are ignored, to identify an initial set of routes from the predetermined set of routes that excludes the vias and the diversions;
executing a second iteration of the model in which the vias are ignored and the diversions are allowed, and starting from the initial set of routes, to determine an intermediate set of routes that excludes the vias; and
executing a third iteration of the model in which the vias are allowed, and starting from the intermediate set of routes, to determine the optimal set of routes; and
provide, to a client device, instructions generated based on the optimal set of routes for use in facilitating transport of the cargo through the network in accordance with the optimal set of routes.
|