Benchmarks for dynamic multi-objective optimisation algorithms
DOI10.1145/2517649zbMath1306.90144OpenAlexW2023343291MaRDI 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 optimisationbenchmark functionscomplex Pareto-optimal setdeceptive Pareto-optimal frontideal benchmark function suiteisolated Pareto-optimal front
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
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
This page was built for publication: Benchmarks for dynamic multi-objective optimisation algorithms