org.drools.planner.examples.tsp.persistence.TspSolutionImporter Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of drools-planner-examples Show documentation
Show all versions of drools-planner-examples Show documentation
Drools Planner optimizes automated planning by combining metaheuristic search algorithms with rule
engine powered score calculation. This is the drools-planner-examples module which contains examples on how to use
Drools Planner.
/*
* Copyright 2011 JBoss Inc
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.drools.planner.examples.tsp.persistence;
import java.io.IOException;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.List;
import org.drools.planner.core.solution.Solution;
import org.drools.planner.examples.common.persistence.AbstractTxtSolutionImporter;
import org.drools.planner.examples.tsp.domain.City;
import org.drools.planner.examples.tsp.domain.Domicile;
import org.drools.planner.examples.tsp.domain.Visit;
import org.drools.planner.examples.tsp.domain.TravelingSalesmanTour;
public class TspSolutionImporter extends AbstractTxtSolutionImporter {
private static final String INPUT_FILE_SUFFIX = ".tsp";
public static void main(String[] args) {
new TspSolutionImporter().convertAll();
}
public TspSolutionImporter() {
super(new TspDaoImpl());
}
@Override
public String getInputFileSuffix() {
return INPUT_FILE_SUFFIX;
}
public TxtInputBuilder createTxtInputBuilder() {
return new TravelingSalesmanTourInputBuilder();
}
public class TravelingSalesmanTourInputBuilder extends TxtInputBuilder {
private TravelingSalesmanTour travelingSalesmanTour;
private int cityListSize;
public Solution readSolution() throws IOException {
travelingSalesmanTour = new TravelingSalesmanTour();
travelingSalesmanTour.setId(0L);
readHeaders();
readCityList();
readConstantLine("EOF");
createVisitList();
logger.info("TravelingSalesmanTour with {} cities.",
travelingSalesmanTour.getCityList().size());
BigInteger possibleSolutionSize = factorial(travelingSalesmanTour.getCityList().size() - 1);
String flooredPossibleSolutionSize = "10^" + (possibleSolutionSize.toString().length() - 1);
logger.info("TravelingSalesmanTour with flooredPossibleSolutionSize ({}) and possibleSolutionSize ({}).",
flooredPossibleSolutionSize, possibleSolutionSize);
return travelingSalesmanTour;
}
private void readHeaders() throws IOException {
travelingSalesmanTour.setName(readStringValue("NAME :"));
readUntilConstantLine("TYPE : TSP");
cityListSize = readIntegerValue("DIMENSION :");
String edgeWeightType = readStringValue("EDGE_WEIGHT_TYPE :");
if (!edgeWeightType.equalsIgnoreCase("EUC_2D")) {
// Only Euclidean distance is implemented in City.getDistance(City)
throw new IllegalArgumentException("The edgeWeightType (" + edgeWeightType + ") is not supported.");
}
}
private void readCityList() throws IOException {
readConstantLine("NODE_COORD_SECTION");
List cityList = new ArrayList(cityListSize);
for (int i = 0; i < cityListSize; i++) {
String line = bufferedReader.readLine();
String[] lineTokens = splitBySpace(line, 3, 4);
City city = new City();
city.setId(Long.parseLong(lineTokens[0]));
city.setLatitude(Double.parseDouble(lineTokens[1]));
city.setLongitude(Double.parseDouble(lineTokens[2]));
if (lineTokens.length >= 4) {
city.setName(lineTokens[3]);
}
cityList.add(city);
}
travelingSalesmanTour.setCityList(cityList);
}
private void createVisitList() {
List cityList = travelingSalesmanTour.getCityList();
int domicileListSize = 1;
List domicileList = new ArrayList(domicileListSize);
List visitList = new ArrayList(cityList.size() - domicileListSize);
int count = 0;
for (City city : cityList) {
if (count < domicileListSize) {
Domicile domicile = new Domicile();
domicile.setId(city.getId());
domicile.setCity(city);
domicileList.add(domicile);
} else {
Visit visit = new Visit();
visit.setId(city.getId());
visit.setCity(city);
// Notice that we leave the PlanningVariable properties on null
visitList.add(visit);
}
count++;
}
travelingSalesmanTour.setDomicileList(domicileList);
travelingSalesmanTour.setVisitList(visitList);
}
private BigInteger factorial(int base) {
BigInteger value = BigInteger.ONE;
for (int i = 1; i <= base; i++) {
value = value.multiply(BigInteger.valueOf(base));
}
return value;
}
}
}