Anda belum login :: 04 Jun 2023 04:39 WIB
A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem
Article from Journal - ilmiah nasional - terakreditasi DIKTI - non-atma jaya
Jurnal Teknik Industri vol. 15 no. 2 (Dec. 2013)
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.
Klik untuk menuliskan opini Anda tentang koleksi ini!
Copyright © 2006, 2007
Unika Atma Jaya
, all rights reserved
Process time: 0.015625 second(s)