A hybrid algorithm for vehicle routing problem with time windows
- 31 January 2011
- journal article
- Published by Elsevier BV in Expert Systems with Applications
- Vol. 38 (1), 435-441
- https://doi.org/10.1016/j.eswa.2010.06.082
Abstract
No abstract availableFunding Information
- National Science Foundation for Post-Doctoral Scientists of China (20080440168)
- Doctoral Program Foundation for Young Scholar of Institutions of Higher Education of China (20070151013)
This publication has 37 references indexed in Scilit:
- Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithmExpert Systems with Applications, 2009
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windowsComputers & Operations Research, 2007
- A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time WindowsTransportation Science, 2004
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windowsComputers & Operations Research, 2004
- A parallel tabu search algorithm for solving the container loading problemParallel Computing, 2003
- Tabu Search heuristics for the Vehicle Routing Problem with Time WindowsTOP, 2002
- An Evolutionary Parallel Tabu Search approach for distribution systems reinforcement planningAdvanced Engineering Informatics, 2002
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- An improved Ant System algorithm for theVehicle Routing ProblemAnnals of Operations Research, 1999
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time WindowsINFORMS Journal on Computing, 1997