-
Notifications
You must be signed in to change notification settings - Fork 612
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
added resources and integration test
test.java....core.algorithm.PickupsAndDeliveries_IT to test components on pd-problems
- Loading branch information
Showing
3 changed files
with
1,574 additions
and
0 deletions.
There are no files selected for viewing
28 changes: 28 additions & 0 deletions
28
jsprit-core/src/test/java/jsprit/core/algorithm/PickupsAndDeliveries_IT.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,28 @@ | ||
package jsprit.core.algorithm; | ||
|
||
import static org.junit.Assert.*; | ||
|
||
import java.util.Collection; | ||
|
||
import jsprit.core.algorithm.io.VehicleRoutingAlgorithms; | ||
import jsprit.core.problem.VehicleRoutingProblem; | ||
import jsprit.core.problem.io.VrpXMLReader; | ||
import jsprit.core.problem.solution.VehicleRoutingProblemSolution; | ||
import jsprit.core.util.Solutions; | ||
|
||
import org.junit.Test; | ||
|
||
public class PickupsAndDeliveries_IT { | ||
|
||
@Test | ||
public void whenSolvingLR101InstanceOfLiLim_solutionsMustNoBeWorseThan5PercentOfBestKnownSolution(){ | ||
VehicleRoutingProblem.Builder vrpBuilder = VehicleRoutingProblem.Builder.newInstance(); | ||
new VrpXMLReader(vrpBuilder).read("src/test/resources/lilim_lr101.xml"); | ||
VehicleRoutingProblem vrp = vrpBuilder.build(); | ||
VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "src/test/resources/lilim_algorithmConfig.xml"); | ||
Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions(); | ||
assertEquals(1650.8,Solutions.bestOf(solutions).getCost(),80.); | ||
assertEquals(19,Solutions.bestOf(solutions).getRoutes().size(),1); | ||
} | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,73 @@ | ||
<?xml version="1.0" encoding="UTF-8"?> | ||
<!-- | ||
Copyright (C) 2013 Stefan Schroeder | ||
This program is free software; you can redistribute it and/or | ||
modify it under the terms of the GNU General Public License | ||
as published by the Free Software Foundation; either version 2 | ||
of the License, or (at your option) any later version. | ||
This program is distributed in the hope that it will be useful, | ||
but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
GNU General Public License for more details. | ||
You should have received a copy of the GNU General Public License | ||
along with this program; if not, write to the Free Software | ||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. | ||
Contributors: | ||
Stefan Schroeder - initial API and implementation | ||
--> | ||
<algorithm xmlns="http://www.w3schools.com" | ||
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.w3schools.com algorithm_schema.xsd"> | ||
|
||
<iterations>2000</iterations> | ||
|
||
<construction> | ||
<insertion name="bestInsertion"> | ||
</insertion> | ||
</construction> | ||
|
||
<strategy> | ||
<memory>1</memory> | ||
<searchStrategies> | ||
<searchStrategy name="radialRuinAndRecreate"> | ||
<selector name="selectBest"/> | ||
<acceptor name="schrimpfAcceptance"> | ||
<alpha>0.1</alpha> | ||
<warmup>20</warmup> | ||
</acceptor> | ||
<modules> | ||
<module name="ruin_and_recreate"> | ||
<ruin name="randomRuin"> | ||
<share>0.4</share> | ||
</ruin> | ||
<insertion name="bestInsertion"/> | ||
</module> | ||
|
||
</modules> | ||
<probability>0.5</probability> | ||
</searchStrategy> | ||
|
||
<searchStrategy name="radialRuinAndRecreate"> | ||
<selector name="selectBest"/> | ||
<acceptor name="schrimpfAcceptance"/> | ||
|
||
<modules> | ||
<module name="ruin_and_recreate"> | ||
<ruin name="radialRuin"> | ||
<share>0.3</share> | ||
</ruin> | ||
<insertion name="bestInsertion"/> | ||
</module> | ||
|
||
</modules> | ||
<probability>.5</probability> | ||
</searchStrategy> | ||
|
||
</searchStrategies> | ||
</strategy> | ||
|
||
|
||
</algorithm> |
Oops, something went wrong.