Add to ORKGDefryn, C., & Sörensen, K. (2017). A fast two-level variable neighborhood search for the clustered vehicle routing problem. Computers & Operations Research, 83, 78-94
The vehicle routing problem is investigated by using some adaptations of the variable neighborhood s...
The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing wi...
Distribution is a substantial cost in many companies and in some sectors it contributes a high perce...
Defryn, C., & Sörensen, K. (2017). A fast two-level variable neighborhood search for the clustered v...
In this paper, we present an improved two-level heuristic to solve the clustered vehicle routing pro...
A vehicle routing problem in which clients are par-titioned into clusters is called a clustered vehi...
The thesis at hand tackles two variants of the vehicle-routing problem (VRP) in which customers are ...
An aggrandized solution is designed for the vehicles to reduce the total cost of distribution by whi...
The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is investigated using the variable ne...
A well-known variant of the vehicle routing problem involves backhauls, where vehicles deliver goods...
The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines s...
International audienceFor a few decades vehicle routing problems have been studied and improved, it ...
A multi-level variable neighborhood search heuristic for a practical vehicle routing and driver sche...
The classic vehicle routing problem considers the distribution of goods to geographically scattered ...
This study presents new exact algorithms for the clustered vehicle routing problem (CluVRP). The Clu...
The vehicle routing problem is investigated by using some adaptations of the variable neighborhood s...
The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing wi...
Distribution is a substantial cost in many companies and in some sectors it contributes a high perce...
Defryn, C., & Sörensen, K. (2017). A fast two-level variable neighborhood search for the clustered v...
In this paper, we present an improved two-level heuristic to solve the clustered vehicle routing pro...
A vehicle routing problem in which clients are par-titioned into clusters is called a clustered vehi...
The thesis at hand tackles two variants of the vehicle-routing problem (VRP) in which customers are ...
An aggrandized solution is designed for the vehicles to reduce the total cost of distribution by whi...
The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is investigated using the variable ne...
A well-known variant of the vehicle routing problem involves backhauls, where vehicles deliver goods...
The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines s...
International audienceFor a few decades vehicle routing problems have been studied and improved, it ...
A multi-level variable neighborhood search heuristic for a practical vehicle routing and driver sche...
The classic vehicle routing problem considers the distribution of goods to geographically scattered ...
This study presents new exact algorithms for the clustered vehicle routing problem (CluVRP). The Clu...
The vehicle routing problem is investigated by using some adaptations of the variable neighborhood s...
The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing wi...
Distribution is a substantial cost in many companies and in some sectors it contributes a high perce...