2016
DOI: 10.1016/j.cie.2015.12.007
|View full text |Cite
|
Sign up to set email alerts
|

The vehicle routing problem: State of the art classification and review

Abstract: Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever more popular in the academic literature. Yet, the problem characteristics and assumptions vary widely and few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the VRP literature published between 2009 and June 2015. Based on an adapted version of an existing comprehensive taxonomy, we classify 277 articles and analyze the trends in the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
400
0
37

Year Published

2017
2017
2022
2022

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 923 publications
(438 citation statements)
references
References 301 publications
1
400
0
37
Order By: Relevance
“…Travelling salesmen problem [5] has capacity restriction and mutual restriction. Unlike VLSI or TSP problem, this case is a 2D vehicle routing problem [6] with confliction and capacity restriction. To solve this problem, this article raised an improved greedy algorithm with complexity of O (M*n).…”
Section: Improved Greedy Algorithm Based Matrix Cable Connection Optimentioning
confidence: 99%
“…Travelling salesmen problem [5] has capacity restriction and mutual restriction. Unlike VLSI or TSP problem, this case is a 2D vehicle routing problem [6] with confliction and capacity restriction. To solve this problem, this article raised an improved greedy algorithm with complexity of O (M*n).…”
Section: Improved Greedy Algorithm Based Matrix Cable Connection Optimentioning
confidence: 99%
“…This trend continued with 277 articles appeared between 2009 and 2015 as cited in the latest survey [10]. Despite the massive amount of literature described above, heterogeneous VRP (HVRP) is rarely studied due to its increased complexity compared to the basic capacitated VRP (CVRP).…”
Section: Introductionmentioning
confidence: 96%
“…For a detailed review of multi-objective problems, see Jozefowiez et al [2]. Excellent references for the Traveling Salesman Problem (TSP), the Vehicle Routing Problem (VRP), and arc routing problems are by Gutin [3], Applegate et al [4], Golden et al [5], Dror [6], and Braekers et al [7].…”
Section: Literature Reviewmentioning
confidence: 99%