Variants to the classical Vehicle Routing Problem
A Survey on the Vehicle Routing Problem and Its Variants
... to vehicle routing ...for vehicle routing, after which they describe a system for integrating constraint programming and iterative improvement ...
9
Vehicle routing problem, its variants and solving methods
... exact problem specification, but mostly it is minimizing the sum of route ...the problem known as Capacitated Vehicle Routing Problem ...
57
Automatic mathematical model development for vehicle routing problem variants
... successful implementations by Fukasawa et al,2016 (24) and by Baldacci et al.,2008 (25), are based on this methodology. The development of modern heuristics for the VRP really started in the 1990s with the advent of ...
156
Tabu search variants for the mix fleet vehicle routing problem
... important problem. It generalises the classical vehicle rout- ing problem as it includes the strategic decision on the vehicle fleet ...delivery problem, 1 the pet food and flour ...
15
VEHICLE ROUTING PROBLEM
... • Traverse the route from the starting point and make the swap once an eligible pair of arcs (feasible and cost savings) is found?. Example of Inter-route improvement: Relocate?[r] ...
22
Electric Vehicle Routing Problem
... Electric Vehicle Routing Problem (EVRP), in which electric commercial vehicles with a limited range may recharge at a charging station during their daily delivery (and pickup) operations, provided ...
14
The Vehicle Routing Problem with Compartments
... Ceselli et al. [8] provided a B&P approach for a general VRP with multiple depots and cus- tomers that were arranged in groups according to the corresponding geographical region. Further the customers have time windows ...
103
THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES
... The vehicle routing problem (VRP) has been an important research topic during the last decades because of his vital role in the productive systems ...the problem when limited vehicle ...
9
The Vehicle routing problem with a volunteer workforce
... Figure 10 shows the performance of each objective, labeled with C if consolidation was used and NC otherwise, broken down by instance solved. The wait listing objective WL is measured by how effectively it promotes ...
92
Stochastic Dynamic Vehicle Routing Problem
... Figure 6.8 (left) shows an average number of visited warehouses over time on different pro- blem types. It is clearly visible that the Greedy algorithm needed much less warehouse visits than the two remaining solvers. ...
89
The Pyramidal Capacitated Vehicle Routing Problem
... the problem was not solved to ...the problem to optimality, and the size of the search tree (branch-and-bound ...the problem was not solved within a time limit of two CPU ...
17
The time-dependent vehicle routing problem
... VRP variants like the CVRP or the VRPTW have been widely studied during the last decades. In contrast to this, papers discussing the TDVRP were published not until the early 1990s. The late introduction can be ...
73
Effective solutions for the capacitated vehicle routing problem and for the split delivery vehicle routing problem with time windows. (c2013)
... the vehicle, or if the closest selected customer satisfies the time ...ery vehicle routing problem with time windows is solved via a column generation method that is applied by fulfilling a ...
52
The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
... locomotives routing policy can be an important decision in railroad companies and it has attracted considerable attention from academics, consultants, and operations research groups within the railroads ...
18
Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem
... As for the average CPU time, algorithm ELTG is faster than algorithms VCGLR12 and CM12, which were able to nd the previous best results in terms of the average value of Gap BKS and of the values of NBKS and NIBS. On the ...
82
A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem and the Capacitated Vehicle Routing Problem with Time Windows
... Initially in the ACS hybrid, m ants are positioned on all the graph vertices and a quantity of initial pheromone is applied on the arcs. Each ant takes its departure from the depot to visit the clients. Each client is ...
17
Dynamic Vehicle Routing Problem with Multiple Depots
... Metaheuristics are developed after heuristics and also appeared in many researches lately. The acclaimed metaheuristics are Simulated Annealing, Tabu Search, Genetic Algorithm, Neural Nets Algorithm, and Ant Colony ...
16
Automated tuning of an algorithm for the vehicle routing problem
... a problem instance as expensive, since it is the time a planner has to ...a problem instance, but beforehand at moments when an abundance of computational resources is ...the problem, known as online ...
81
Exact algorithms for the clustered vehicle routing problem
... Figure 6 Comparison between hand-made and heuristic solutions of a real-world waste collection problem with four routes. The hand-made solution (left) is about 4% longer but more compact than the heuristic one ...
26
The Multi-shift Vehicle Routing Problem with Overtime
... this problem travel through multiple urban areas and are operated on a 24/7 basis in three consecutive shifts in each ...the vehicle depot where all routes in a shift start and ...
37