trans/graphhopper-jsprit
1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00
Code Issues Releases Wiki Activity

alphabetize other projects

Browse source
This commit is contained in:
Alastair Firth 2018-04-19 10:24:49 +10:00
parent 6b716779cf
commit 11b649a806
1 changed files with 12 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

24
docs/Other-Projects.md
View file

@ -2,27 +2,27 @@
### VRP
#### [VRPH library](https://sites.google.com/site/vrphlibrary/)
An open source library by Chris Groer for solving the capacitated vehicle routing problem written in C++.
Now hosted by [coin-or](https://projects.coin-or.org/VRPH)
#### [OptaPlanner](https://www.optaplanner.org/)
OptaPlanner is a lightweight, embeddable planning engine written in Java™. It can be used to solve the capacitated vehicle routing problem (with time windows).
#### [Hipster4j](http://www.hipster4j.org/)
Hipster is an easy to use yet powerful and flexible type-safe library for heuristic search, written in pure Java. It relies on a flexible model with generic operators to define search problems. So you can also model and solve vehicle routing problems.
#### [Open-VRP](https://github.com/mck-/Open-VRP)
Open-VRP is a framework to model and solve various vehicle routing problems.
#### [VROOM](https://github.com/jcoupey/vroom)
VROOM is an optimization engine written in C++14 that aim at providing good solutions to various real-life vehicle routing problems within a small computing time. It is free software, distributed under the term of the GNU General Public License V3.
#### [OptaPlanner](https://www.optaplanner.org/)
OptaPlanner is a lightweight, embeddable planning engine written in Java™. It can be used to solve the capacitated vehicle routing problem (with time windows).
#### [Hipster4j](http://www.hipster4j.org/)
Hipster is an easy to use yet powerful and flexible type-safe library for heuristic search, written in pure Java. It relies on a flexible model with generic operators to define search problems. So you can also model and solve vehicle routing problems.
#### [OR-Tools](https://developers.google.com/optimization/)
Google Optimization Tools (OR-Tools) is a fast and portable software suite for solving combinatorial optimization problems, including the VRP. Open-source, written in C++ and available through SWIG for Python, Java, and .NET (using Mono on non-Windows platforms). You can compile OR-Tools on Linux, Mac OS X, and Windows (with Visual Studio).
#### [OscaR](https://bitbucket.org/oscarlib/oscar/wiki/Home)
OscaR, an Open Source Toolbox for Optimising Logistics and Supply Chain Systems.
#### [OR-Tools](https://developers.google.com/optimization/)
Google Optimization Tools (OR-Tools) is a fast and portable software suite for solving combinatorial optimization problems, including the VRP. Open-source, written in C++ and available through SWIG for Python, Java, and .NET (using Mono on non-Windows platforms). You can compile OR-Tools on Linux, Mac OS X, and Windows (with Visual Studio).
#### [VROOM](https://github.com/jcoupey/vroom)
VROOM is an optimization engine written in C++14 that aim at providing good solutions to various real-life vehicle routing problems within a small computing time. It is free software, distributed under the term of the GNU General Public License V3.
#### [VRPH library](https://sites.google.com/site/vrphlibrary/)
An open source library by Chris Groer for solving the capacitated vehicle routing problem written in C++.
Now hosted by [coin-or](https://projects.coin-or.org/VRPH)
### Territory Design