- Timestamp:
- 07/29/11 11:38:02 (13 years ago)
- Location:
- branches/QAPAlgorithms
- Files:
-
- 4 edited
- 1 copied
Legend:
- Unmodified
- Added
- Removed
-
branches/QAPAlgorithms
- Property svn:mergeinfo changed
/trunk/sources merged: 6571-6585,6587-6592,6596-6606,6609
- Property svn:mergeinfo changed
-
branches/QAPAlgorithms/HeuristicLab.Problems.VehicleRouting
- Property svn:mergeinfo changed
/trunk/sources/HeuristicLab.Problems.VehicleRouting merged: 6600
- Property svn:mergeinfo changed
-
branches/QAPAlgorithms/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/Potvin/PotvinEncoding.cs
r6569 r6611 75 75 place = -1; 76 76 bool bestFeasible = false; 77 double minDetour = 0;77 double minDetour = double.MaxValue; 78 78 79 79 for (int tour = 0; tour < Tours.Count; tour++) { … … 87 87 capacity, distMatrix); 88 88 89 if ( (!allowInfeasible && feasible) || (allowInfeasible && (!bestFeasible || feasible))) {89 if (feasible || allowInfeasible && !bestFeasible) { 90 90 double newLength = Tours[tour].GetLength(distMatrix); 91 91 double detour = newLength - length; 92 92 93 if (route <= 0 || detour < minDetour || 94 (allowInfeasible && ((!(bestFeasible && !feasible)) && detour < minDetour || (feasible && !bestFeasible)))) { 93 if (route < 0 || detour < minDetour || feasible && !bestFeasible) { 95 94 route = tour; 96 95 place = i; -
branches/QAPAlgorithms/HeuristicLab.Problems.VehicleRouting/3.3/HeuristicLab.Problems.VehicleRouting-3.3.csproj
r6569 r6611 114 114 <Compile Include="Encodings\Alba\LocalImprovement\AlbaLambdaInterchangeLocalImprovementOperator.cs" /> 115 115 <Compile Include="Encodings\General\Creators\IterativeInsertionCreator.cs" /> 116 <Compile Include="Encodings\Potvin\Crossovers\PotvinInsertionBasedCrossover.cs" /> 116 117 <Compile Include="Encodings\Potvin\Manipulators\PotvinLocalSearchManipulator.cs" /> 117 118 <Compile Include="Interfaces\IVRPMultiNeighborhoodShakingOperator.cs" />
Note: See TracChangeset
for help on using the changeset viewer.