Meta-harmony search algorithm for the vehicle routing problem with time windows
Authors:
- 1 December 2015
- journal article
- Published by Elsevier in Information Sciences
- Vol. 325, 140-158
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windowsComputers & Operations Research, 2013
- Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problemComputers & Operations Research, 2012
- A graph coloring constructive hyper-heuristic for examination timetabling problemsApplied Intelligence, 2011
- The variants of the harmony search algorithm: an overviewArtificial Intelligence Review, 2011
- Self-adaptive harmony search algorithm for optimizationExpert Systems with Applications, 2010
- Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithmExpert Systems with Applications, 2009
- Tabu search variants for the mix fleet vehicle routing problemJournal of the Operational Research Society, 2002
- Artificial intelligence heuristics in solving vehicle routing problems with time window constraintsEngineering Applications of Artificial Intelligence, 2001
- Optimization by Simulated AnnealingScience, 1983
- ADAPTIVE SEARCH USING A REPRODUCTIVE META‐PLANKybernetes, 1978