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

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 53; pp. 9 - 23
Main Authors: Rahimi-Vahed, Alireza, Gabriel Crainic, Teodor, Gendreau, Michel, Rei, Walter
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.01.2015
Pergamon Press Inc
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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