A GVNS Algorithm for Solving the Multi-Depot Vehicle Routing Problem
| Autor: | Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza, Sinaide Nunes Bezerra |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
021103 operations research
Total cost business.industry Applied Mathematics 0211 other engineering and technologies 02 engineering and technology Set (abstract data type) Variable (computer science) Vehicle routing problem 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Combinatorial optimization 020201 artificial intelligence & image processing Local search (optimization) business Algorithm Metaheuristic Variable neighborhood search Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 66:167-174 |
| ISSN: | 1571-0653 |
| Popis: | This paper presents an algorithm based on the General Variable Neighborhood Search (GVNS) metaheuristic for solving the Multi-Depot Vehicle Routing Problem (MDVRP). The MDVRP consists in designing a set of vehicle routes serving all customers, such that the maximum number of vehicle per depot and vehicle-capacity are respected, and the total cost of transportation is minimized. The proposed algorithm uses Randomized Variable Neighborhood Descent (RVND) as local search method and it is tested in classical instances of the problem. The obtained results are presented and discussed in this paper. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect