VRP Algorithms

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.

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)

• http://www.dim.uchile.cl/~tcapelle/TESIS/NanryPDPTW.pdf
• http://www.diku.dk/~sropke/Papers/Branch-and-Cut-and-Price%20for%20the%20Pickup%20and%20Delivery%20Problem%20with%20Time%20Windows.pdf
• http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2266430 Check this :VRP-SDP