The Vehicle Routing Problem with Future Insertions (VRPFI)
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 paper is organized as follows. Section 2 introduces the Capacitated Prize-Collecting PTSP which arises as the column generation subproblem for the SPP formulation, along with an exact algorithm as well as a heuristic ...
17
The time-dependent vehicle routing problem
... 4.6.7 Eglese et al. (2006) Eglese et al. (2006) use time-dependent travel time information to develop a road timetable for a road network. This timetable provides data on the shortest-time paths and minimum travel times ...
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
... J = 1, . . . , n of customers. Each potential depot i ∈ I has a capacity w i and an opening cost o i . Each customer j ∈ J has a nonnegative demand d j which must be ful lled by a depot. An unlimited set of identical ...
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 ...to future, unseen ...the ...
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
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
Metaheuristics for the Vehicle Routing Problem with Loading Constraints
... lem combines together the vehicle routing problem and the parallel pro- cessor scheduling problem. We developed heuristics and implemented a dynamic programming algorithm for solving the ...
40
Multiple Vehicle Routing Problem with Fuel Constraints
... 9 3.3 Partitioning The next step in the algorithm is to determine partitions for the vehicles. This consists of assigning groups of nodes to certain vehicles, based on some criteria. The partitioning algorithm used in ...
49
VEHICLE ROUTING PROBLEM FOR DELIVERY PERISHABLE FOOD
... VEHICLE ROUTING PROBLEM FOR DELIVERY PERISHABLE FOOD Katrin ...the Vehicle Routing Problem (VRP) for delivery perishable food products by considering multi objective function and ...
17
The periodic vehicle routing problem: a case study.
... the problem-specific constraints mentioned above. In the resulting routing algorithm, an initial solution to the VRP is con- structed using a standard savings heuristic, which makes a trade off between more ...
16