A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem  

Oleh:

Imran, Arif

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI - non-atma jaya
Dalam koleksi: Jurnal Teknik Industri vol. 15 no. 2 (Dec. 2013), page 95-102.
Topik: Meta-heuristic; routing; multi-depot; variable neighborhood.
Fulltext: 18846-22475-2-PB.pdf (772.99KB)

Isi artikel

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 diversification 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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali