The capacitated vehicle routing problem (CVRP) is the problem in which a set of identical vehicles located at a central depot is to be optimally routed to supply customers with known demands subject ...

Routing algorithms complement MINs by dynamically determining the most efficient paths for data transmission, thereby minimising latency, balancing load and enhancing fault-tolerance.

In recent years new insights and algorithms have been obtained for the classical, deterministic vehicle routing problem as well as for natural stochastic and dynamic variations of it. These new ...