The Vehicle Routing Problem is well known in the Operations Research and Just in Time literature. Its
application is well suited to situations in which full truck loads are not possible, and the consolidation of
orders or loads from several points are required to achieve higher capacity utilization levels for reducing
transportation cost. From the O.R. point of view, the interest is concentrated on the development of
algorithms to achieve an optimal or near-optimal solution to the problem. From the JIT literature, Vehicle
routing is also known as a milk run. It is a key aspect to enable frequent shipments of small lots from
suppliers to customers, and therefore allowing for a Just in Time integration with them.