Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper, based on traditional genetic algorithm, adding time restriction to ensure the realization of real-time algorithm. It… 
2010
2010
The Vehicle Routing Problem (VRP) is a well-known problem studied by researchers in Operations Research and it deals with… 
2007
2007
The paper introduces the Genetic Algorithm and VRP Problem and genetic algorithm the vehicle routing problem is solved via the… 
2005
2005
The paper deals with the design of a route elimination (RE) algorithm for the vehicle routing problem with time windows (VRPTW… 
2004
2004
The vehicle routing problem (VRP) is a kind of combination NP problem which possesses important practical value. Particle swarm… 
2004
2004
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we show its successful… 
2001
2001
  • Jia Li
  • 2001
  • Corpus ID: 124585634
A special kind of vehicle routing problem was described and its characteristics were analyzed. By defining the “fleet pattern”, a… 
1999
1999
This paper describes a route construction method for the vehicle routing problem with multiple vehicle types and time window… 
1995
1995
Many transportation problems, such as the travelling salesman problem, are computationally hard but often solvable quickly…