mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
added resources and integration test
test.java....core.algorithm.PickupsAndDeliveries_IT to test components on pd-problems
This commit is contained in:
parent
40a1e45a0d
commit
231435bbcf
3 changed files with 1574 additions and 0 deletions
|
|
@ -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);
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
73
jsprit-core/src/test/resources/lilim_algorithmConfig.xml
Normal file
73
jsprit-core/src/test/resources/lilim_algorithmConfig.xml
Normal file
|
|
@ -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>
|
||||||
1473
jsprit-core/src/test/resources/lilim_lr101.xml
Normal file
1473
jsprit-core/src/test/resources/lilim_lr101.xml
Normal file
File diff suppressed because it is too large
Load diff
Loading…
Add table
Add a link
Reference in a new issue