Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem

Arif Imran, Liane Okdinawati


Abstract


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 and the 2-opt. Our VNS algorithm use several neighborhoods which were adapted for this problem. In addition, a number of local search methods together with a diversification procedure were used. The algorithm was then tested on the data sets from the literature and it produced competitive results if compared to the solutions published.

Keywords


metaheuristic, routing, variable neighborhood

Full Text:

pdf


DOI: https://doi.org/10.22219/JTIUMM.Vol12.No1.10-15 | Abstract views : 188 | pdf views : 47

Copyright (c) 2018 Jurnal Teknik Industri

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


 
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.