VRP Algorithms - pgRouting/pgrouting GitHub Wiki

List of VRP algorithms with basic information, links, etc. All of these problems are NP-hard and exact solutions are not worth the effort to implement. They are only interesting from an academic point of view. In the real world there are many iterative solutions the give good results in reasonable run-times. Our current TSP solution uses simulated annealing, our single depot with time windows uses a TABU search. If you are interested in working on these I strongly recommend that you read up on TABU search and plan to implement it using a TABU search algorithm. We are open to others solvers but I would be good to discuss that on the dev list and explain the benefits of another algorithm so we can all learn from the discussion.

Links

Test Cases

TABU Search

One of the key optimiation algorithms used for solving VRP problems is based on the Tabu Search Algorithm. This was developed by Fred Glover and here are some critical papers that you will find referenced in most all VRP papers that use Tabu Search:

Papers

Here are a collection of links to papers that I found interesting. There are tons of papers on the web just google for the terms you are interested in:

TABU search related :

https://class.coursera.org/optimization-002/lecture/57 @12:48

https://class.coursera.org/optimization-002/lecture/59

TSP - Traveling Salesman Problem

  • [...]

DARP - Dial A Ride Problem

Also see VRPPD below.

  • [...]

VRP - Vehicle Routing Problem

  • [...]

VRPH - Vehicle Routing Problem with Heuristic

  • [...]

CVRP - Capacitated Vehicle Routing Problem

  • [...]

VRPTW - Vehicle Routing Problem with Time Windows

  • [...]

CVRPTW - Capacitated Vehicle Routing Problem with Time Windows

  • [...]

VRPPD - Vehicle Routing Problem, Pickup and Delivery

Also see [VRP Pickup Delivery Problem](VRP Pickup Delivery Problem)