No datasets match
- 1.eaf::CPFsConditional Pareto fronts obtained from Gaussian processes simulations.
- 2.eaf::gcp2x2Metaheuristics for solving the Graph Vertex Coloring Problem
- 3.eaf::HybridGAResults of Hybrid GA on vanzyl and Richmond water networks
- 4.eaf::SPEA2minstoptimeRichmondResults of SPEA2 when minimising electrical cost and maximising the minimum idle time of pumps on Richmond water network.
- 5.eaf::SPEA2relativeRichmondResults of SPEA2 with relative time-controlled triggers on Richmond water network.
- 6.eaf::SPEA2relativeVanzylResults of SPEA2 with relative time-controlled triggers on Vanzyl's water network.
- 7.moocore::CPFsConditional Pareto fronts obtained from Gaussian processes simulations.
- 8.moocore::HybridGAResults of Hybrid GA on Vanzyl and Richmond water networks
- 9.moocore::SPEA2minstoptimeRichmondResults of SPEA2 when minimising electrical cost and maximising the minimum idle time of pumps on Richmond water network.
- 10.moocore::SPEA2relativeRichmondResults of SPEA2 with relative time-controlled triggers on Richmond water network.
- 11.moocore::SPEA2relativeVanzylResults of SPEA2 with relative time-controlled triggers on Vanzyl's water network.
- 12.moocore::tpls50x20_1_MWTVarious strategies of Two-Phase Local Search applied to the Permutation Flowshop Problem with Makespan and Weighted Tardiness objectives.