Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem

The vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra’s algorithm based on a cost network constructed by the sweep algorithm and the 2 opt. Our VNS algorithm use several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. The algorithm is thebn tested on the data sets from the literature and it produces competitve result if compared to teh solutions published.

Di buat oleh: Arif Imran (arifimran@itenas.ac.id / arifimr@yahoo.com), Liane Okdinawati (aneu88@yahoo.com).
Kata kunci : metaheuristic, routing, variable neighborhood
Keterangan : Jurnal Teknik Industri No.1, 2011, Universitas Muhammadiyah Malang ( Terakreditasi)

Adaptation of The Variable Neighborhood Search Heuristic to Solve The Vehicle Routing Problem