Multiobjective optimization: when objectives exhibit non-uniform latencies

DOI10.1016/j.ejor.2014.09.033zbMath1346.90727OpenAlexW2054640518WikidataQ104772120 ScholiaQ104772120MaRDI QIDQ319133

Julia Handl, Richard Allmendinger, Joshua D. Knowles

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/24295821/Allmendinger_EJOR_2014.pdf

zbMATH Keywords

multiobjective optimizationevolutionary computationbudgeted optimizationclosed-loop optimizationdelayed objective functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization

Uses Software

• jMetal
• SMS-EMOA

Cites Work

• Unnamed Item
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Working principles, behavior, and performance of MOEAs on MNK-landscapes
• Case studies in evolutionary experimentation and computation
• An efficient constraint handling method for genetic algorithms
• Performance analysis of randomised search heuristics operating with a fixed budget
• Upper and lower bounds for randomized search heuristics in black-box optimization

This page was built for publication: Multiobjective optimization: when objectives exhibit non-uniform latencies