A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

2015 ◽  
Vol 11 (2) ◽  
pp. 313-327 ◽  
Author(s):  
Jack Brimberg ◽  
Nenad Mladenović ◽  
Raca Todosijević ◽  
Dragan Urošević
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Center Problem ◽  
Basic Variable ◽  
Search Heuristic ◽  
Multiple Allocation

scholarly journals Less is more approach: basic variable neighborhood search for the obnoxiousp-median problem

2019 ◽  
Vol 27 (1) ◽  
pp. 480-493 ◽  
Author(s):  
Nenad Mladenović ◽  
Abdulaziz Alkandari ◽  
Jun Pei ◽  
Raca Todosijević ◽  
Panos M. Pardalos
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Basic Variable ◽  
Median Problem ◽  
Less Is More

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