[PDF] Top 20 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 ... See full document

... 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 ... See full document

... 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 ... See full document

... 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 ... See full document

... 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 ... See full document

... 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. ... See full document

... 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 ... See full document

... Since problem instances in sets A and B have less number of visits, the greedy evaluation in CGX is fast and helps in the convergence to better ...larger problem instances in sets D and E, FCX performed the ... See full document

... Since problem instances in sets A and B have less number of visits, the greedy evaluation in CGX is fast and helps in the convergence to better ...larger problem instances in sets D and E, FCX performed the ... See full document

... 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 ... See full document

... 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 ... See full document

... 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 fullled by a depot. An unlimited set of identical ... See full document

... 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 ... See full document

... 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 ... See full document

... 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 ... See full document

... to vehicle routing ...for vehicle routing, after which they describe a system for integrating constraint programming and iterative improvement ... See full document

... 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 ... See full document

... transportation problem of practical im- portance; the Consistent Vehicle Routing Problem with ...the vehicle routes that maximize the net profit, while satisfying vehicle ca- ... See full document

... Naturally, the probability p 2 to choose the second bridge is 1 − p 1 . As time goes by, shorter paths collect more pheromone than longer ones, which helps ants find good sources of food. There are certain aspects of ... See full document

... VEHICLE ROUTING PROBLEM FOR DELIVERY PERISHABLE FOOD Katrin ...the Vehicle Routing Problem (VRP) for delivery perishable food products by considering multi objective function and ... See full document