Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

22 relations
2-optAnt colony optimization algorithmsArtificial antsBranch and price
Expand

Broader (1)

Operations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Collaborative vehicle routing: A survey
In horizontal collaborations, carriers form coalitions in order to perform parts of their logistics operations jointly. By… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2018
Review
2018
The unmanned aerial vehicle routing and trajectory optimisation problem, a taxonomic review
Abstract Over the past few years, Unmanned Aerial Vehicles (UAVs) have become more and more popular. The complexity of routing… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Review
2018
Review
2018
Applications of computational intelligence in vehicle traffic congestion problem: a survey
Vehicle traffic congestion is an increasing concern in metropolitan areas, with negative health, environment and economical… Expand
Highly Cited
2007
Highly Cited
2007
A general heuristic for vehicle routing problems
We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Highly Cited
2003
Highly Cited
2003
A genetic algorithm for the vehicle routing problem
This study considers the application of a genetic algorithm (GA) to the basic vehicle routing problem (VRP), in which customers… Expand
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. In this problem, lateness at… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
1993
Highly Cited
1993
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
  • I. Osman
  • Ann. Oper. Res.
  • 1993
    • Corpus ID: 6348700
The vehicle routing problem (VRP) under capacity and distance restrictions involves the design of a set of minimum cost delivery… Expand
  • figure 1
Highly Cited
1992
Highly Cited
1992
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
The vehicle routing problem with time windows VRPTW is a generalization of the vehicle routing problem where the service of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1991
Highly Cited
1991
A Tabu Search Heuristic for the Vehicle Routing Problem
The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and… Expand
Highly Cited
1987
Highly Cited
1987
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window… Expand
  • table I
  • table I
  • table IV
  • table V
  • table VI
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE