A variable neighbourhood search algorithm for the open vehicle routing problem
Authors:
- Krzysztof FleszarKFKrzysztof Fleszar
- Ibrahim H. OsmanIOIbrahim H. Osman
- Khalil S. HindiKHKhalil S. Hindi
- 1 June 2009
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 195 (3) , 803-809
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- The open vehicle routing problem: Algorithms, large-scale test problems, and computational resultsComputers & Operations Research, 2007
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- Erratum: A new tabu search heuristic for the open vehicle routing problemJournal of the Operational Research Society, 2006
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhaulsJournal of the Operational Research Society, 2005
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithmJournal of the Operational Research Society, 2005
- A new tabu search heuristic for the open vehicle routing problemJournal of the Operational Research Society, 2005
- A tabu search algorithm for the open vehicle routing problemEuropean Journal of Operational Research, 2004
- A heuristic method for the open vehicle routing problemJournal of the Operational Research Society, 2000
- Variable neighborhood searchComputers & Operations Research, 1997
- Formulation and structure of more complex/realistic routing and scheduling problemsNetworks, 1981