Benchmarks for dynamic multi-objective optimisation algorithms
DOI10.1145/2517649zbMath1306.90144MaRDI QIDQ5176171
Andries P. Engelbrecht, Mardé Helbig
Publication date: 2 March 2015
Published in: ACM Computing Surveys (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2263/43823
dynamic multi-objective optimisation; benchmark functions; complex Pareto-optimal set; deceptive Pareto-optimal front; ideal benchmark function suite; isolated Pareto-optimal front
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C39: Dynamic programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Performance measures for dynamic multi-objective optimisation algorithms
- Evolutionary multi-objective optimization in uncertain environments. Issues and algorithms
- An evolutionary algorithm for dynamic multi-objective optimization
- Approaching Dynamic Multi-Objective Optimization Problems by Using Parallel Evolutionary Algorithms
- A Memetic Algorithm for Dynamic Multiobjective Optimization
- Benchmarks for dynamic multi-objective optimisation algorithms
- A data mining approach to evolutionary optimisation of noisy multi-objective problems
- A dynamic route guidance system based on real traffic data