A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem
ABSTRAK
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.
Dibuat oleh : Arif Imran
E-mail: arifimr@yahoo.com
Kata Kunci : Meta-heuristic, routing, multi-depot, variable neighborhood.
Keterangan : Makalah ini dimuat pada Jurnal Teknik Industri Vol 15, No 2 (2013) : DECEMBER 2013