GeneticClusterer.java example

Explorer
activityinfo-master
package org.activityinfo.server.report.generator.map.cluster;

/*
 * #%L
 * ActivityInfo Server
 * %%
 * Copyright (C) 2009 - 2013 UNICEF
 * %%
 * 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 3 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, see
 * <http://www.gnu.org/licenses/gpl-3.0.html>.
 * #L%
 */

import org.activityinfo.legacy.shared.model.SiteDTO;
import org.activityinfo.legacy.shared.reports.model.PointValue;
import org.activityinfo.server.report.generator.map.RadiiCalculator;
import org.activityinfo.server.report.generator.map.TiledMap;
import org.activityinfo.server.report.generator.map.cluster.genetic.BubbleFitnessFunctor;
import org.activityinfo.server.report.generator.map.cluster.genetic.GeneticSolver;
import org.activityinfo.server.report.generator.map.cluster.genetic.MarkerGraph;
import org.activityinfo.server.report.generator.map.cluster.genetic.MarkerGraph.IntersectionCalculator;
import org.activityinfo.server.report.generator.map.cluster.genetic.UpperBoundsCalculator;

import java.util.List;

/**
 * Clusters PointValues together in an optimal way using a genetic algorithm.
 */
public class GeneticClusterer implements Clusterer {
    private final RadiiCalculator radiiCalculator;
    private final IntersectionCalculator intersectionCalculator;

    public GeneticClusterer(RadiiCalculator radiiCalculator, IntersectionCalculator intersectionCalculator) {
        super();
        this.radiiCalculator = radiiCalculator;
        this.intersectionCalculator = intersectionCalculator;
    }

    /*
     * Clusters points using a genetic algorithm to determine what nearby points
     * are logical candidates to cluster
     * 
     * @see
     * org.activityinfo.legacy.shared.reports.model.clustering.Clustering#cluster(java
     * .util.List, org.activityinfo.server.report.generator.map.RadiiCalculator)
     */
    @Override
    public List<Cluster> cluster(TiledMap map, List<PointValue> points) {
        List<Cluster> clusters;

        MarkerGraph graph = new MarkerGraph(points, intersectionCalculator);

        GeneticSolver solver = new GeneticSolver();
        clusters = solver.solve(graph,
                radiiCalculator,
                new BubbleFitnessFunctor(),
                UpperBoundsCalculator.calculate(graph, radiiCalculator));

        return clusters;
    }

    @Override
    public boolean isMapped(SiteDTO site) {
        return site.hasLatLong();
    }
}