scholarly journals Hybrid metaheuristics for the Clustered Vehicle Routing Problem

2015 ◽  
Vol 58 ◽  
pp. 87-99 ◽  
Author(s):  
Thibaut Vidal ◽  
Maria Battarra ◽  
Anand Subramanian ◽  
Güneş Erdogˇan
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Metaheuristics ◽  
Routing Problem

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

2005 ◽  
Vol 5 (1) ◽  
pp. 91-110 ◽  
Author(s):  
Leonora Bianchi ◽  
Mauro Birattari ◽  
Marco Chiarandini ◽  
Max Manfrin ◽  
Monaldo Mastrolilli ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Metaheuristics ◽  
Routing Problem ◽  
Stochastic Demands

Measuring and evaluating hybrid metaheuristics for solving the multi-compartment vehicle routing problem

Measurement ◽  
2019 ◽  
Vol 141 ◽  
pp. 407-419 ◽  
Author(s):  
Islem Kaabachi ◽  
Hiba Yahyaoui ◽  
Saoussen Krichen ◽  
Abdelkader Dekdouk
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Metaheuristics ◽  
Routing Problem

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

2016 ◽  
Vol 3 (1) ◽  
pp. 55-73 ◽  
Author(s):  
Gautham Puttur Rajappa ◽  
Joseph H. Wilck ◽  
John E. Bell
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Research Effort ◽  
Ant Colony ◽  
Hybrid Metaheuristics ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery

Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) that allows the same customer to be served by more than one vehicle. Existing literature has applied Ant Colony Optimization (ACO) and Genetic Algorithm (GA) to other variants of VRP but no known research effort has applied ACO or a combination of ACO and GA to solve the Split Delivery Vehicle Routing Problem (SDVRP). Hence, two algorithms using ACO and hybrid metaheuristics algorithm comprising a combination of ACO, Genetic Algorithm (GA) and heuristics is proposed and tested on existing benchmark SDVRP problems. The results indicate that the two proposed algorithms are competitive in both solution quality and solution time and for some problem instances, the best ever solutions have been found.

Sign in / Sign up

Export Citation Format

Share Document