scispace - formally typeset
Topic

Vehicle routing problem

About: Vehicle routing problem is a(n) research topic. Over the lifetime, 12006 publication(s) have been published within this topic receiving 331631 citation(s).

...read more

Papers
More filters

Journal ArticleDOI
G. Clarke, J. W. Wright1Institutions (1)
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.

...read more

Abstract: The optimum routing of a fleet of trucks of varying capacities from a central depot to a number of delivery points may require a selection from a very large number of possible routes, if the number of delivery points is also large. This paper, after considering certain theoretical aspects of the problem, develops an iterative procedure that enables the rapid selection of an optimum or near-optimum route. It has been programmed for a digital computer but is also suitable for hand computation.

...read more

3,454 citations


MonographDOI
01 Jan 2001-
Abstract: The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of three parts containing contributions from well-known experts. The first part covers basic VRP, known more commonly as capacitated VRP. The second part covers three main variants of VRP with time windows, backhauls, and pickup and delivery. The third part covers issues arising in real-world VRP applications and includes both case studies and references to software packages. The book will be of interest to both researchers and graduate-level students in the communities of operations research and matematical sciences. It focuses on a specific family of problems while offering a complete overview of the effective use of the most important techniques proposed for the solution of hard combinatorial problems. Practitioners will find this book particularly usef

...read more

3,249 citations


Journal ArticleDOI
George B. Dantzig1, J. H. RamserInstitutions (1)
01 Oct 1959-Management Science
TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.

...read more

Abstract: The paper is concerned with the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. The shortest routes between any two points in the system are given and a demand for one or several products is specified for a number of stations within the distribution system. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied and total mileage covered by the fleet is a minimum A procedure based on a linear programming formulation is given for obtaining a near optimal solution. The calculations may be readily performed by hand or by an automatic digital computing machine. No practical applications of the method have been made as yet. A number of trial problems have been calculated, however.

...read more

3,248 citations


Journal ArticleDOI
Marius M. Solomon1Institutions (1)
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.

...read more

Abstract: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints. Given the intrinsic difficulty of this problem class, approximation methods seem to offer the most promise for practical size problems. After describing a variety of heuristics, we conduct an extensive computational study of their performance. The problem set includes routing and scheduling environments that differ in terms of the type of data used to generate the problems, the percentage of customers with time windows, their tightness and positioning, and the scheduling horizon. We found that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.

...read more

2,900 citations


Journal ArticleDOI
Gilbert Laporte1Institutions (1)
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.

...read more

Abstract: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed. The paper is organized as follows: (1) definition; (2) exact algorithms; (3) heuristic algorithms; (4) conclusion.

...read more

1,626 citations


Network Information
Related Topics (5)
Job shop scheduling

35.2K papers, 658.3K citations

93% related
Variable neighborhood search

2.2K papers, 55.9K citations

92% related
Flow shop scheduling

14.3K papers, 333.3K citations

90% related
Integer programming

25.3K papers, 618.8K citations

90% related
Metaheuristic

29.9K papers, 921K citations

90% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202218
2021795
2020836
2019824
2018799
2017729

Top Attributes

Show by:

Topic's top 5 most impactful authors

Gilbert Laporte

165 papers, 28.3K citations

Michel Gendreau

113 papers, 19.9K citations

Angel A. Juan

61 papers, 1.4K citations

Christian Prins

57 papers, 4.6K citations

Richard F. Hartl

54 papers, 4.7K citations