Vehicle routing problem

Known as: VRP, VRPTW, Vehicle routing 
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a… (More)
Wikipedia

Related topics

Related topics

22 relations
2-optAnt colony optimization algorithmsArtificial antsBranch and price
(More)

Broader (1)

Operations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five diff erent variants of the vehicle routing problem: the vehicle… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
What You Should Know about the Vehicle Routing Problem
In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing… (More)
  • table 1
  • figure 2
  • table 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A simple and effective evolutionary algorithm for the vehicle routing problem
The NP-hard Vehicle Routing Problem (VRP) is defined on an undirected network G = (V,E) with a node set V = {0, 1, . . . , n} and… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
On the capacitated vehicle routing problem
We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known… (More)
  • figure 3
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Applying the ANT System to the Vehicle Routing Problem
In this paper we use a recently proposed metaheuristic, the Ant System, to solve the Vehicle Routing Problem (VRP) in its basic… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Sear ch (LNS) for solving vehicle routing problems. LNS meshes well with… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • table I
  • table I
  • table IV
  • table V
  • table VI
Is this relevant?