/** Start the background thread. */
public void start() {
// create a random list of cities
cities = new City[TravelingSalesman.CITY_COUNT];
for (int i = 0; i < TravelingSalesman.CITY_COUNT; i++) {
cities[i] =
new City(
(int) (Math.random() * (getBounds().width - 10)),
(int) (Math.random() * (getBounds().height - 60)));
}
// create the initial chromosomes
chromosomes = new Chromosome[TravelingSalesman.POPULATION_SIZE];
for (int i = 0; i < TravelingSalesman.POPULATION_SIZE; i++) {
chromosomes[i] = new Chromosome(cities);
chromosomes[i].setCut(cutLength);
chromosomes[i].setMutation(TravelingSalesman.MUTATION_PERCENT);
}
Chromosome.sortChromosomes(chromosomes, TravelingSalesman.POPULATION_SIZE);
// start up the background thread
started = true;
map.update(map.getGraphics());
generation = 0;
if (worker != null) worker = null;
worker = new Thread(this);
// worker.setPriority(Thread.MIN_PRIORITY);
worker.start();
}
/** Start the background thread. */
public void start() {
// create a random list of cities
cities = new City[TravelingSalesman.CITY_COUNT];
for (int i = 0; i < TravelingSalesman.CITY_COUNT; i++) {
cities[i] =
new City(
(int) (Math.random() * (getBounds().width - 10)),
(int) (Math.random() * (getBounds().height - 60)));
}
// start up the background thread
started = true;
map.update(map.getGraphics());
if (worker != null) worker = null;
worker = new SimulateAnnealing(this);
worker.setPriority(Thread.MIN_PRIORITY);
worker.start();
}
/** The main loop for the background thread. It is here that most of the work os orchestrated. */
public void run() {
double thisCost = 500.0;
double oldCost = 0.0;
double dcost = 500.0;
int countSame = 0;
map.update(map.getGraphics());
while (countSame < 100) {
generation++;
int ioffset = matingPopulationSize;
int mutated = 0;
// Mate the chromosomes in the favoured population
// with all in the mating population
for (int i = 0; i < favoredPopulationSize; i++) {
Chromosome cmother = chromosomes[i];
// Select partner from the mating population
int father = (int) (0.999999 * Math.random() * (double) matingPopulationSize);
Chromosome cfather = chromosomes[father];
mutated += cmother.mate(cfather, chromosomes[ioffset], chromosomes[ioffset + 1]);
ioffset += 2;
}
// The new generation is in the matingPopulation area
// move them to the correct area for sort.
for (int i = 0; i < matingPopulationSize; i++) {
chromosomes[i] = chromosomes[i + matingPopulationSize];
chromosomes[i].calculateCost(cities);
}
// Now sort the new mating population
Chromosome.sortChromosomes(chromosomes, matingPopulationSize);
double cost = chromosomes[0].getCost();
dcost = Math.abs(cost - thisCost);
thisCost = cost;
double mutationRate = 100.0 * (double) mutated / (double) matingPopulationSize;
NumberFormat nf = NumberFormat.getInstance();
nf.setMinimumFractionDigits(2);
nf.setMinimumFractionDigits(2);
status.setText(
"Generation "
+ generation
+ " Cost "
+ (int) thisCost
+ " Mutated "
+ nf.format(mutationRate)
+ "%");
if ((int) thisCost == (int) oldCost) {
countSame++;
} else {
countSame = 0;
oldCost = thisCost;
}
map.update(map.getGraphics());
}
status.setText("Solution found after " + generation + " generations.");
}
public void randomColor() {
Pixel[][] pixels = this.getPixels2D();
for (Pixel[] row : pixels) {
for (Pixel currentPixel : row) {
int randomRed, randomBlue, randomGreen;
randomRed = (int) (Math.random() * 256);
randomBlue = (int) (Math.random() * 256);
randomGreen = (int) (Math.random() * 256);
currentPixel.setBlue(randomBlue);
currentPixel.setRed(randomRed);
currentPixel.setGreen(randomGreen);
}
}
}
public static void doRandomCommand() throws Exception {
int commandCount = 6; // remember to count 0
int command = (int) (Math.random() * commandCount);
switch (command) {
case 0:
createFile();
break;
case 1:
readFile();
break;
case 2:
deleteFile();
break;
case 3:
createClient();
break;
case 4:
createServer();
break;
case 5:
exit();
break;
default:
System.out.println("Bad command number: " + command);
break;
}
}
public static void main(String[] args) {
ChartWindow cw = new ChartWindow("test");
double[] c1 = new double[100];
for (int i = 0; i < c1.length; i++) {
c1[i] = Math.random();
}
cw.draw(c1);
double[] c2 = new double[100];
for (int i = 0; i < c2.length; i++) {
c2[i] = Math.random();
}
cw.draw(c2);
}
double my_rand(double min, double max) {
double r = Math.random();
// r=r%1000;
return r * (max - min) + min;
};