Multi-fleet feeder vehicle routing problem using hybrid metaheuristic

2022 ◽  
pp. 105696
Author(s):  
M. Salehi Sarbijan ◽  
J. Behnamian
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
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.

scholarly journals A Hybrid Metaheuristic For Solving Asymmetric Distance-Constrained Vehicle Routing Problem

2020 ◽  
Author(s):  
Bang Ha Ban ◽  
Phuong Khanh Nguyen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Natural Extension ◽  
Solution Space ◽  
Neighborhood Search ◽  
Solution Quality ◽  
Routing Problem ◽  
Hybrid Metaheuristic ◽  
Asymmetric Distance ◽  
Constrained Vehicle Routing

Abstract The Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is an NP-hard problems. In ADVRP problem, each customer is visited once by one vehicle; every tour starts and ends at a depot; and the travelled distance by each vehicle is required to be less than or equal to the given maximum value. The problem is a natural extension of Vehicle Routing Problem case. In our work, 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 for the search. Extensive numerical experiments on benchmark instances show that our algorithm can be comparable with the state-of-the-art previous algorithms in terms of solution quality and computation time. In many cases our proposed method is able to improve the best-known solution available from the literature.

Sign in / Sign up

Export Citation Format

Share Document