Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
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 ad...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Jurusan Teknik Industri, Fakultas Teknik Universitas Muhammadiyah Malang
2012-03-01
|
| Series: | Jurnal Teknik Industri |
| Subjects: | |
| Online Access: | http://ejournal.umm.ac.id/index.php/industri/article/view/648 |