The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation
| Autor: | Arif Imran, Said Salhi, Niaz A. Wassan |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Scheme (programming language)
Mathematical optimization Static routing General Computer Science business.industry Computer science Management Science and Operations Research Modeling and Simulation Vehicle routing problem Local search (optimization) Routing (electronic design automation) business computer Variable neighborhood search computer.programming_language |
| Zdroj: | Computers & Operations Research. 52:315-325 |
| ISSN: | 0305-0548 |
| DOI: | 10.1016/j.cor.2013.05.011 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect