Towards Fast and Accurate Solutions to Vehicle Routing in a Large-Scale and Dynamic Environment
Authors:
- Yaguang LiYLYaguang Li
- Siva RavadaSRSiva Ravada
- 13 August 2015
- book chapter
- Published by Springer Nature
- p. 119-136
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Online Computation of Fastest Path in Time-Dependent Spatial Networks2011
- Efficient K-Nearest Neighbor Search in Time-Dependent Spatial NetworksLecture Notes in Computer Science, 2010
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windowsDiscrete Optimization, 2008
- Very large-scale vehicle routing: new test problems, algorithms, and resultsComputers & Operations Research, 2005
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- A guide to vehicle routing heuristicsJournal of the Operational Research Society, 2002
- Classical and modern heuristics for the vehicle routing problemInternational Transactions in Operational Research, 2000
- The Vehicle Routing Problem with Time Windows Part I: Tabu SearchINFORMS Journal on Computing, 1996
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic AlgorithmsTransportation Science, 1992
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964