A new algorithm has shown in simulations that traffic jams can be considerably reduced — even if just 10 percent of cars on the road follow its guidelines.

In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show ...

N. Wassan, Reactive Tabu Adaptive Memory Programming Search for the Vehicle Routing Problem with Backhauls, The Journal of the Operational Research Society, Vol. 58, No. 12 (Dec., 2007), ... We ...