Results of SPEA2 with relative time-controlled triggers on Richmond water network. The data has the only goal of providing an example of use of eafplot.
Results of SPEA2 when minimising electrical cost and maximising the minimum idle time of pumps on Richmond water network. The data has the only goal of providing an example of use of eafplot.
gcp2x2
(Package: eaf) :
Metaheuristics for solving the Graph Vertex Coloring Problem
Two metaheuristic algorithms, TabuCol (Hertz et al., 1987) and simulated annealing (Johnson et al., 1991), to find a good approximation of the chromatic number of two random graphs. The data here has the only goal of providing an example of use of eafplot for comparing algorithm performance with respect to both time and quality when modelled as two objectives in trade off.
Results of SPEA2 with relative time-controlled triggers on Vanzyl's water network. The data has the only goal of providing an example of use of eafplot.
providing 
.