Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve
Résumé
A method to generate various size tunable benchmarks for multi-objective AI planning with a known Pareto Front has been recently proposed in order to provide a wide range of Pareto Front shapes and different magnitudes of difficulty. The performance of the Pareto-based multi-objective evolutionary planner DaEYAHSP are evaluated on some large instances with singular Pareto Front shapes, and compared to those of the single-objective aggregation-based approach.
Domaines
Intelligence artificielle [cs.AI]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...