Changes between Version 4 and Version 5 of Documentation/Reference/VehicleRoutingProblem

Timestamp:

09/06/11 13:00:58 (13 years ago)

Author:

svonolfe

Comment:

--

Documentation/Reference/VehicleRoutingProblem

@@ -1 +1 @@
 = Vehicle Routing Problem =
 The vehicle routing problem (VRP) is a class of problems that frequently occurs in the field of transportation logistics. The original formulation of the problem
-has been defined in the late 1950ies and consists of a fleet of vehicles serving a set of customers with a certain demand from a single depot. The implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW).
+has been defined in the late 1950ies and consists of a fleet of vehicles serving a set of customers with a certain demand from a single depot. The implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW). Additionally, pickup and delivery formulations are also supported (CVRPTW with pickups and deliveries).
 
 == Benchmark instances == 
 The following benchmark instances can be imported:
-* TSPLib format
+* TSPLib format (CVRP)
   - http://www.branchandcut.org/VRP/data/ (12-261 customers, includes optimal solution files)
   - http://www.rhsmith.umd.edu/faculty/bgolden/Golden.zip (~200-500 customers)
   - http://www.rhsmith.umd.edu/faculty/bgolden/Christofides_benchmarks.zip (50-200 customers)
 
-* Solomon format
+* Solomon format (CVRPTW)
   - http://neo.lcc.uma.es/radi-aeb/WebVRP/data/instances/solomon/solomon_100.zip (100 customers)
   - http://www.fernuni-hagen.de/WINF/touren/inhalte/probinst.htm (200-1000 customers)
 
-* ORLib format
+* ORLib format (CVRP)
   - http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/ 
+
+* Li & Lim format (CVRPTW with pickups and deliveries)
+  - http://www.sintef.no/Projectweb/TOP/Problems/PDPTW/Li--Lim-benchmark/
 
 == File formats ==