A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands

2018 ◽  
Vol 99 ◽  
pp. 135-147 ◽  
Author(s):  
Andres Gutierrez ◽  
Laurence Dieulle ◽  
Nacima Labadie ◽  
Nubia Velasco
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Metaheuristic Algorithm ◽  
Routing Problem ◽  
Hybrid Metaheuristic ◽  
Stochastic Demands

A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet

2016 ◽  
Vol 71 (1/2/3/4) ◽  
pp. 75 ◽  
Author(s):  
Seval Ene ◽  
N.A. �° ◽  
lker Küçükoğlu ◽  
Aslı Aksoy ◽  
Nursel Öztürk
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Metaheuristic Algorithm ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Hybrid Metaheuristic

scholarly journals A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Ha-Bang Ban ◽  
Phuong Khanh Nguyen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Natural Extension ◽  
Solution Space ◽  
Neighborhood Search ◽  
Np Hard ◽  
Routing Problem ◽  
Hybrid Metaheuristic ◽  
Asymmetric Distance ◽  
Constrained Vehicle Routing

AbstractThe Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it is a natural extension of the NP-hard Vehicle Routing Problem. In ADVRP problem, each customer is visited exactly once by a vehicle; every tour starts and ends at a depot; and the traveled distance by each vehicle is not allowed to exceed a predetermined limit. We propose a hybrid metaheuristic algorithm combining the Randomized Variable Neighborhood Search (RVNS) and the Tabu Search (TS) to solve the problem. The combination of multiple neighborhoods and tabu mechanism is used for their capacity to escape local optima while exploring the solution space. Furthermore, the intensification and diversification phases are also included to deliver optimized and diversified solutions. Extensive numerical experiments and comparisons with all the state-of-the-art algorithms show that the proposed method is highly competitive in terms of solution quality and computation time, providing new best solutions for a number of instances.

Sign in / Sign up

Export Citation Format

Share Document