Golden, B. I., A. A. Assad (Eds.): Vehicle Routing with Time-Window Constraints: Algorithmic Solutions. Vol. 15 of American Series in Mathematical and Management Sciences. American Sciences Press, Inc., Columbus, Ohio 1986, pp. 251–428, $49.75

1988 ◽  
Vol 30 (7) ◽  
pp. 873-873
Author(s):  
J. Sánchez
Keyword(s):  
Vehicle Routing ◽  
Time Window ◽  
Time Window Constraints

Recent progress of local search in handling the time window constraints of the vehicle routing problem

4OR ◽  
2010 ◽  
Vol 8 (3) ◽  
pp. 221-238 ◽  
Author(s):  
Hideki Hashimoto ◽  
Mutsunori Yagiura ◽  
Shinji Imahori ◽  
Toshihide Ibaraki
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Recent Progress ◽  
Time Window ◽  
Routing Problem ◽  
Time Window Constraints

scholarly journals VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING HYBRID ENCODING GENETIC ALGORITHM

2014 ◽  
Vol 12 (10) ◽  
pp. 3945-3951
Author(s):  
Dr P.K Chenniappan ◽  
Mrs.S.Aruna Devi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Minimal Cost ◽  
Total Size ◽  
Routing Problem ◽  
Time Window Constraints ◽  
Vehicle Capacity ◽  
Vehicle Routes

The vehicle routing problem is to determine K vehicle routes, where a route is a tour that begins at the depot, traverses a subset of the customers in a specified sequence and returns to the depot. Each customer must be assigned to exactly one of the K vehicle routes and total size of deliveries for customers assigned to each vehicle must not exceed the vehicle capacity. The routes should be chosen to minimize total travel cost. Thispapergivesasolutiontofindanoptimumrouteforvehicle routingproblem using Hybrid Encoding GeneticAlgorithm (HEGA)technique tested on c++ programming.The objective is to find routes for the vehicles to service all the customers at a minimal cost and time without violating the capacity, travel time constraints and time window constraints

scholarly journals A Bucket Graph–Based Labeling Algorithm with Application to Vehicle Routing

2020 ◽  
Author(s):  
Ruslan Sadykov ◽  
Eduardo Uchoa ◽  
Artur Pessoa
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Window ◽  
Time Windows ◽  
Routing Problem ◽  
Constrained Vehicle Routing ◽  
Time Window Constraints ◽  
Vehicle Capacity ◽  
First Time

We consider the shortest path problem with resource constraints arising as a subproblem in state-of-the-art branch-cut-and-price algorithms for vehicle routing problems. We propose a variant of the bidirectional label-correcting algorithm in which the labels are stored and extended according to the so-called bucket graph. This organization of labels helps to significantly decrease the number of dominance checks and the running time of the algorithm. We also show how the forward/backward route symmetry can be exploited and how to eliminate arcs from the bucket graph using reduced costs. The proposed algorithm can be especially beneficial for vehicle routing instances with large vehicle capacity and/or with time window constraints. Computational experiments were performed on instances from the distance-constrained vehicle routing problem, including multidepot and site-dependent variants, on the vehicle routing problem with time windows, and on the “nightmare” instances of the heterogeneous fleet vehicle routing problem. Significant improvements over the best algorithms in the literature were achieved, and many instances could be solved for the first time.

Sign in / Sign up

Export Citation Format

Share Document