Examples of de.mh4j.examples.Sorting

de.mh4j.examples.Sorting
A Sorting represents a not necessarily ordered array of the numbers from 0 to 99. This is the {@link Solution} class for the first set of exampleimplementations of MH4J.

The goal of the optimization algorithms is to find the correct arrangement of the numbers, so that each number stands at its correct array index (number zero is at array index 0 and number three is at index 3)

Of course the correct solution to this problem is trivial, but this is only an easy example implementation that should help you to understand the concrete algorithm implementations.

    public void testCreateRandomNeighbor() {
        LocalSearchSorter sorter = new LocalSearchSorter(10);
        // invoke step to initialize the solver
        sorter.step();


        Sorting initialSorting = sorter.getCurrentSolution();
        Sorting neighbor = sorter.createRandomNeighbor();


        assert initialSorting.equals(neighbor) == false;
    }

View Full Code Here

     * Hopefully one of the swapped numbers will be nearer to its optimal
     * position in the sorting and decrease the cost of the whole new sorting.
     */
    @Override
    protected Sorting createRandomNeighbor() {
        Sorting neighbor = new Sorting(currentSolution);


        int randomIndex1 = randomizer.nextInt(currentSolution.getAmountOfNumbers());
        int randomIndex2 = randomizer.nextInt(currentSolution.getAmountOfNumbers() - 1);


        if (randomIndex1 <= randomIndex2) {
            randomIndex2++;
        }


        neighbor.swapIndices(randomIndex1, randomIndex2);
        return neighbor;
    }

View Full Code Here

     * Hopefully one of the swapped numbers will be nearer to its optimal
     * position in the sorting and decrease the cost of the whole new sorting.
     */
    @Override
    protected Sorting createRandomNeighbor() {
        Sorting neighbor = new Sorting(currentSolution);


        int randomIndex1 = randomizer.nextInt(currentSolution.getAmountOfNumbers());
        int randomIndex2 = randomizer.nextInt(currentSolution.getAmountOfNumbers());


        neighbor.swapIndices(randomIndex1, randomIndex2);
        return neighbor;
    }

View Full Code Here

TOP

Related Classes of de.mh4j.examples.Sorting

de.mh4j.examples.solver.LocalSearchSorter

de.mh4j.examples.solver.LocalSearchSorterTest

de.mh4j.examples.solver.SimulatedAnnealingSorter

java.util.Random

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.