Paper Info
Title
A variable neighbourhood search algorithm for the open vehicle routing problem
Abstract
In the open vehicle routing problem (OVRP), the objective is to minimise the number of vehicles and then minimise the total distance (or time) travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced by each vehicle must not exceed vehicle capacity. Additionally, in one variant of the problem, the travel time of each vehicle should not exceed an upper limit.
Year
DOI
Venue
2009
10.1016/j.ejor.2007.06.064
European Journal of Operational Research
Keywords
Field
DocType
Variable neighbourhood search,Vehicle routing,Metaheuristics
Heuristic,Vehicle routing problem,Mathematical optimization,Search algorithm,Reversing,Heuristics,Neighbourhood (mathematics),Open system (systems theory),Mathematics,Operations management,Metaheuristic
Journal
Volume
Issue
ISSN
195
3
0377-2217
Citations 
PageRank 
References 
64
1.97
15
Authors
3
Name
Order
Citations
PageRank
Krzysztof Fleszar136825.38
Ibrahim H. Osman281594.23
Khalil S. Hindi339822.75