A GVNS Algorithm for Solving the Multi-Depot Vehicle Routing Problem

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 ve...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 66; pp. 167 - 174
Main Authors Bezerra, Sinaide Nunes, de Souza, Sérgio Ricardo, Souza, Marcone Jamilson Freitas
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2018
Subjects
Combinatorial Optimization
General Variable Neighborhood Search
Multi-Depot Vehicle Routing Problem
Combinatorial Optimization
Multi-Depot Vehicle Routing Problem
General Variable Neighborhood Search
Online AccessGet full text
ISSN1571-0653
1571-0653
DOI10.1016/j.endm.2018.03.022

Cover

More Information
Summary: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2018.03.022