Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm

In this paper, we address the problem of determining the optimal fleet size for three vehicle routing problems, i.e., multi-depot VRP, periodic VRP and multi-depot periodic VRP. In each of these problems, we consider three kinds of constraints that are often found in reality, i.e., vehicle capacity,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 53; s. 9 - 23
Hlavní autoři: Rahimi-Vahed, Alireza, Gabriel Crainic, Teodor, Gendreau, Michel, Rei, Walter
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.01.2015
Pergamon Press Inc
Témata:
Algorithms
Computation
Exploration
Fleet-sizing
Heuristic
Heuristic methods
Mathematical problems
Modular
Modular heuristic algorithm
Motor vehicle fleets
Multi-depot periodic vehicle routing problem
Operations research
Optimization
Optimization algorithms
Route choice
Route selection
Strategy
Studies
Modular heuristic algorithm
Multi-depot periodic vehicle routing problem
Fleet-sizing
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we address the problem of determining the optimal fleet size for three vehicle routing problems, i.e., multi-depot VRP, periodic VRP and multi-depot periodic VRP. In each of these problems, we consider three kinds of constraints that are often found in reality, i.e., vehicle capacity, route duration and budget constraints. To tackle the problems, we propose a new Modular Heuristic Algorithm (MHA) whose exploration and exploitation strategies enable the algorithm to produce promising results. Extensive computational experiments show that MHA performs impressively well, in terms of solution quality and computational time, for the three problem classes.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2014.07.004