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

Merge remote-tracking branch 'origin/master'

This commit is contained in:
oblonski 2018-07-20 10:26:02 +02:00
commit 825472d755
No known key found for this signature in database
GPG key ID: 179DE487285680D1
2 changed files with 23 additions and 18 deletions

View file

@ -1,29 +1,34 @@
## Other Related Open Source Implementations
### VRP ### VRP
#### [Chris Groer's VRPH library](https://sites.google.com/site/vrphlibrary/)
An open source library for solving the capacitated vehicle routing problem written in C++.
#### [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).
#### [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.
#### [Hipster4j](http://www.hipster4j.org/) #### [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. 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.
#### [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).
#### [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](https://bitbucket.org/oscarlib/oscar/wiki/Home)
OscaR, an Open Source Toolbox for Optimising Logistics and Supply Chain Systems. OscaR, an Open Source Toolbox for Optimising Logistics and Supply Chain Systems.
#### [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 ### Territory Design
#### [OpenDoorLogistics](http://www.opendoorlogistics.com) #### [OpenDoorLogistics](http://www.opendoorlogistics.com)
Open Door Logistics Studio is an easy-to-use Open Door Logistics Studio is an easy-to-use
standalone open source application for performing geographic analysis of your customer base and sales territory design, mapping and management. standalone open source application for performing geographic analysis of your customer base and sales territory design, mapping and management.
### Other implementations
If you know another promising open source implementation, report it. If you know another promising open source implementation, report it.

View file

@ -22,7 +22,7 @@ import com.graphhopper.jsprit.core.problem.Capacity;
import com.graphhopper.jsprit.core.problem.Skills; import com.graphhopper.jsprit.core.problem.Skills;
/** /**
* Pickup extends Service and is intended to model a Service where smth is LOADED (i.e. picked up) to a transport unit. * Break extends Service and is intended to model a time-window based driver break.
* *
* @author schroeder * @author schroeder
*/ */
@ -31,7 +31,7 @@ public class Break extends Service {
public static class Builder extends Service.Builder<Break> { public static class Builder extends Service.Builder<Break> {
/** /**
* Returns a new instance of builder that builds a pickup. * Returns a new instance of builder that builds a break.
* *
* @param id the id of the pickup * @param id the id of the pickup
* @return the builder * @return the builder
@ -47,9 +47,9 @@ public class Break extends Service {
} }
/** /**
* Builds Pickup. * Builds Break.
* <p> * <p>
* <p>Pickup type is "pickup" * <p>Pickup type is "break"
* *
* @return pickup * @return pickup
* @throws IllegalStateException if neither locationId nor coordinate has been set * @throws IllegalStateException if neither locationId nor coordinate has been set