mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
add editorconfig - #174
This commit is contained in:
parent
33075b479f
commit
cc507e9cf5
42 changed files with 42 additions and 42 deletions
|
|
@ -110,7 +110,7 @@ public class ExperimentalSchrimpfAcceptance implements SolutionAcceptor, Iterati
|
|||
this.nOfTotalIterations = algorithm.getMaxIterations();
|
||||
|
||||
/*
|
||||
* randomWalk to determine standardDev
|
||||
* randomWalk to determine standardDev
|
||||
*/
|
||||
final double[] results = new double[nOfRandomWalks];
|
||||
|
||||
|
|
|
|||
|
|
@ -53,7 +53,7 @@ public class SchrimpfInitialThresholdGenerator implements AlgorithmStartsListene
|
|||
double now = System.currentTimeMillis();
|
||||
|
||||
/*
|
||||
* randomWalk to determine standardDev
|
||||
* randomWalk to determine standardDev
|
||||
*/
|
||||
final double[] results = new double[nOfRandomWalks];
|
||||
|
||||
|
|
|
|||
|
|
@ -167,7 +167,7 @@ public final class BestInsertionConcurrent extends AbstractInsertionStrategy {
|
|||
List<Batch> batches = new ArrayList<Batch>();
|
||||
for (int i = 0; i < nuOfBatches; i++) batches.add(new Batch());
|
||||
/*
|
||||
* if route.size < nuOfBatches add as much routes as empty batches are available
|
||||
* if route.size < nuOfBatches add as much routes as empty batches are available
|
||||
* else add one empty route anyway
|
||||
*/
|
||||
if (vehicleRoutes.size() < nuOfBatches) {
|
||||
|
|
|
|||
|
|
@ -71,7 +71,7 @@ class TimeWindowConstraint implements HardActivityConstraint {
|
|||
latestVehicleArrival < nextAct.getTheoreticalEarliestOperationStartTime()) {
|
||||
return ConstraintsStatus.NOT_FULFILLED_BREAK;
|
||||
}
|
||||
/*
|
||||
/*
|
||||
* if the latest operation start-time of new activity is smaller than the earliest start of prev. activity,
|
||||
* then
|
||||
*
|
||||
|
|
|
|||
|
|
@ -78,7 +78,7 @@ public class VehicleDependentTimeWindowConstraints implements HardActivityConstr
|
|||
latestVehicleArrival < nextAct.getTheoreticalEarliestOperationStartTime()) {
|
||||
return ConstraintsStatus.NOT_FULFILLED_BREAK;
|
||||
}
|
||||
/*
|
||||
/*
|
||||
* if the latest operation start-time of new activity is smaller than the earliest start of prev. activity,
|
||||
* then
|
||||
*
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue