| | 1 | = HeuristicLab Branches Daily Builds = |
| | 2 | |
| | 3 | Besides daily builds of the trunk we also provide daily builds of some branches. Branches contain additional features for HeuristicLab which haven't yet been integrated in the trunk and are often under heavy development. Though these features haven't yet reached maturity, they may be useful for some people. |
| | 4 | '''Please note''' that branches are always developed against the trunk, so you need to either compile the trunk version of HeuristicLab by yourself or download the latest trunk daily build from [[http://builder.heuristiclab.com:8080/repository/download/bt3/.lastSuccessful/HeuristicLab%20trunk%20r{build.number}.zip?guest=1|this location]]. |
| | 5 | |
| | 6 | Below is a list of branches for which we provide daily builds as well as the links to the download location. |
| | 7 | The file which you get when you click on the download link is a zip file containing additional plugins. |
| | 8 | Extract these files in your HeuristicLab folder and restart HeuristicLab. The plugins will be automatically discovered and the new functionality can then be used. |
| | 9 | |
| | 10 | === Vehicle Routing Problem (VRP)=== |
| | 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 HeuristicLab VRP 3.4 daily build]] |
