Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm
- 31 May 2009
- journal article
- Published by Elsevier BV in Expert Systems with Applications
- Vol. 36 (4), 7758-7763
- https://doi.org/10.1016/j.eswa.2008.09.001
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time WindowsINFOR: Information Systems and Operational Research, 2003
- Artificial intelligence heuristics in solving vehicle routing problems with time window constraintsEngineering Applications of Artificial Intelligence, 2001
- Heuristic approaches to vehicle routing with backhauls and time windowsComputers & Operations Research, 1996
- Applying the genetic approach to simulated annealing in solving some NP-hard problemsIEEE Transactions on Systems, Man, and Cybernetics, 1993
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- A bi-criteria heuristic for the vehicle routing problem with time windowsEuropean Journal of Operational Research, 1988
- Vehicle Routing with Time WindowsOperations Research, 1987
- Local search in routing problems with time windowsAnnals of Operations Research, 1985
- A Sequential Route-building Algorithm Employing a Generalised Savings CriterionJournal of the Operational Research Society, 1976