-
We might learn from Geoffrey
: http://www.optaplanner.org/blog/2015/01/27/ScalingVehicleRoutingAndTSPWithNearbySelection.html -
Solving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art
-
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
-
Very large-scale vehicle routing: new test problems, algorithms, and results
-
LARGE SCALE VEHICLE ROUTING PROBLEM: AN OVERVIEWOF ALGORITHMS AND AN INTELLIGENT PROCEDURE
-
D. Mester and O. Bräysy, “Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows”, Computers & Operations Research 32, 1593-1614 (2005).
-
D. Mester, O. Bräysy and W. Dullaert, “A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems”, Expert Systems with Applications 32, 508-517 (2006).
-
R. Bent and van Hentenryck P., “Randomized Adaptive Spatial decoupling for large-scale vehicle routing with time windows”, In Proceedings of the Twenty-Second Conference on Artificial Intelligence of the American Association for Artificial Intelligence, 2007, Vancouver, BC., pp.173-178.
: Latter seems to be very promising. It even uses a large neighborhood search as well. The idea is to constantly divide the large scale problem into subproblems that can then be solved independently and fast. These subproblem solutions can be merged easily to have this large scale problem again and so on …