The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing with heterogeneous vehicles, is investigated. A mathematical formulation is given and lower as well as upper bounds are produced using a three hour execution time of CPLEX. An efficient implementation of variable neighborhood search that incorporates new features in addition to the adaptation of several existing neighborhoods and local search operators is proposed. These features include a preprocessing scheme for identifying borderline customers, a mechanism that aggregates and disaggregates routes between depots, and a neighborhood reduction test that saves nearly 80% of the CPU time, especially on the large instances. The proposed algorithm is highly competitive as it produces 23 new best results when tested on the 26 data instances published in the literature.

Dibuat oleh : Said Salhi, Arif Imran, Niaz A. Wassan

E-mail:  arifimr@yahoo.com
Kata Kunci :Multi-depot vehicle routing; Heterogeneous vehicles; Distribution network; ILP formulation; Variable neighborhood search

Keterangan :  Makalah ini  dimuat pada Jurnal of Computers & Operations Research, dengan alamat :

http://www.sciencedirect.com/science/article/pii/S0305054813001408

http://www.kent.ac.uk/kbs/documents/res/working-papers/2013/mdvfm%20paper%28May%202013%29%20Web.pdf

The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation