A General Vehicle Routing Problem
|Type of publication:||Article|
|Journal:||European Journal of Operational Research|
|Abstract:||In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications.
The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem.
Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times,
travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple
pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles.
The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go
from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement
approaches based on the idea of changing the neighbourhood structure during the search.
|Userfields:||Cited by (Google Scholar)|
|Keywords:||Large Neighbourhood Search, Pickup and Delivery Problem, Variable Neighbourhood Search, Vehicle Routing Problem|