| 11 | | The vehicle routing problem (VRP) is a class of problems that frequently occurs in the field of transportation logistics. In plugin version 3.4, the implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW), pickup and delivery formulations (PDPTW) and multiple depots (MDCVRPTW). Additional information and benchmark instances can be found at the [[wiki:Vehicle Routing Problem|Vehicle Routing Problem page]]. [[br]] [[http://builder.heuristiclab.com:8080/repository/download/bt4/.lastSuccessful/HeuristicLab%20VRP%20r%7Bbuild.number%7D.zip?guest=1|Download the VRP 3.4 daily build]] |
| | 11 | The vehicle routing problem (VRP) is a class of problems that frequently occurs in the field of transportation logistics. In plugin version 3.4, the implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW), pickup and delivery formulations (PDPTW) and multiple depots (MDCVRPTW). Additional information and benchmark instances can be found at the [[wiki:Vehicle Routing Problem|Vehicle Routing Problem page]]. |
| | 12 | * [[http://builder.heuristiclab.com:8080/repository/download/bt4/.lastSuccessful/HeuristicLab%20VRP%20r%7Bbuild.number%7D.zip?guest=1|Download the VRP 3.4 daily build]] |
