Jurnal Teknik Industri
Vol 12, No 1 (2011): Februari

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

Imran, Arif (Unknown)
Okdinawati, Liane (Unknown)



Article Info

Publish Date
30 Mar 2012

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.

Copyrights © 2011






Journal Info

Abbrev

industri

Publisher

Subject

Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Industrial & Manufacturing Engineering

Description

Dr. Saiful Anwar Malang is a state hospital has done it is job and function, but in 3rd class of pavilion room, the number of patient decrease dramatically. It is concerned with quality of this hospital. To answer this problem, research was done using Quality Function Deployment (QFD). Quality ...