A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks

2019 ◽  
Vol 27 (1) ◽  
pp. 112-137 ◽  
Author(s):  
Jonatas B. C. Chagas ◽  
Ulisses E. F. Silveira ◽  
André G. Santos ◽  
Marcone J. F. Souza
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Search Heuristic

scholarly journals ADAPTATION OF THE VARIABLE NEIGHBORHOOD SEARCH HEURISTIC TO SOLVE THE VEHICLE ROUTING PROBLEM

2012 ◽  
Vol 12 (1) ◽  
pp. 10 ◽  
Author(s):  
ARIF IMRAN ◽  
LIANE OKDINAWATI
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Search Methods ◽  
Routing Problem ◽  
Search Heuristic ◽  
Dijkstra's Algorithm ◽  
Sweep Algorithm

The vehicle routing problem is investigated by using some adaptations of the variable neighborhood search (VNS).The initial solution was obtained by Dijkstra’s algorithm based on cost network constructed by the sweep algorithm andthe 2-opt. Our VNS algorithm use several neighborhoods which were adapted for this problem. In addition, a number oflocal search methods together with a diversification procedure were used. The algorithm was then tested on the data setsfrom the literature and it produced competitive results if compared to the solutions published.

Sign in / Sign up

Export Citation Format

Share Document