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

@article{Salhi2014TheMV,
  title={The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation},
  author={Sa{\"i}d Salhi and Arif Imran and Niaz A. Wassan},
  journal={Computers & OR},
  year={2014},
  volume={52},
  pages={315-325}
}
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… CONTINUE READING