A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem
| Main Author: | Imran, Arif; Department of Industrial Engineering, National Institute of Technology, Jl. P.H.H Mustafa 23 Bandung 40124 |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Institute of Research and Community Outreach - Petra Christian University
, 2013
|
| Subjects: | |
| Online Access: |
http://jurnalindustri.petra.ac.id/index.php/ind/article/view/18846 http://jurnalindustri.petra.ac.id/index.php/ind/article/view/18846/18542 |
Daftar Isi:
- The multi-depot vehicle routing problem (MDVRP) is addressed using an adaptation of the variable neighborhood search (VNS). The proposed VNS algorithm besides using several neighborhoods and a number of local searches has a number of additional features. These include a scheme for identifying borderline customers, a diversivication procedure and a mechanism that aggregates and disaggregates routes between depots. The proposed algorithm is tested on the data instances from the literature and produces competitive results.