Vehicle Routing Problem (VRP)

by Wolfgang Garn ( Last update: 20.07.2007)

Introduction

A fleet of vehicles supplies customers. Each vehicle has a certain capacity and each customer has a certain demand. Further on there exists a depot(s) and a distance (length, cost, time) matrix between the customers. We look for optimal vehicle routes (minimum distance or number of vehicles).

The VRP is a Nonlinear Programming (NP) problem. The special cases of the VRP result in other popular problems like the Traveling Salesman Problem (TSP) or even Scheduling .

Links

Related Papers

Books

There exist a few good papers, which enable you to implement VRP algorithms straigth away. Most papers provide you with ideas and results. Domschkes book assists you well to implement a VRP. If you know of any other VRP book please send me an E-Mail

Commercial Software

A comrehensive survey can be found at ORMS - VR .

Free Software (Code)

A comrehensive survey can be found at ORMS - VR .

Variants

There are several different variants of the VRP.