An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- 1 April 2010
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 37 (4) , 712-723
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A simple and efficient tabu search heuristic for solving the open vehicle routing problemJournal of the Operational Research Society, 2009
- A branch-and-cut algorithm for the capacitated open vehicle routing problemJournal of the Operational Research Society, 2007
- Erratum: A new tabu search heuristic for the open vehicle routing problemJournal of the Operational Research Society, 2006
- 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 threshold accepting approach to the Open Vehicle Routing problemRAIRO - Operations Research, 2004
- The school bus routing problem: a case studyJournal of the Operational Research Society, 2002
- A heuristic method for the open vehicle routing problemJournal of the Operational Research Society, 2000
- Train Plan Model for British Rail Freight Services Through the Channel TunnelJournal of the Operational Research Society, 1994
- Formulation and structure of more complex/realistic routing and scheduling problemsNetworks, 1981