Convex preference cone-based approach for many objective optimization problems

DOI10.1016/j.cor.2018.02.015zbMath1458.90583OpenAlexW2793021467WikidataQ130154201 ScholiaQ130154201MaRDI QIDQ1652622

Ankur Sinha, Pekka Malo, Markku Kallio

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.02.015

zbMATH Keywords

interactiveevolutionary algorithmsmany-objective optimizationcone contractionpreference-based method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (3)

Decomposition-based co-evolutionary algorithm for interactive multiple objective optimization ⋮ Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs ⋮ EMOSOR: evolutionary multiple objective optimization guided by interactive stochastic ordinal regression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• An interactive evolutionary multi-objective optimization algorithm with a limited number of decision maker calls
• Dual cone approach to convex-cone dominance in multiple criteria decision making
• Interactive evolutionary multi-objective optimization for quasi-concave preference functions
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
• Cone contraction and reference point methods for multi-criteria mixed integer optimization
• Solving the Discrete Multiple Criteria Problem using Convex Cones
• Large-scale linearly constrained optimization
• Constructing a strict total order for alternatives characterized by multiple criteria: An extension

This page was built for publication: Convex preference cone-based approach for many objective optimization problems