Convex preference cone-based approach for many objective optimization problems-Reference-Cited by-同舟云学术

Convex preference cone-based approach for many objective optimization problems

Published:2018-07 Issue: Volume:95 Page:1-11
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Sinha Ankur^ORCID,Malo Pekka,Kallio Markku

Funder

SERB

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference26 articles.

1. Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems;Alves;Eur. J. Oper. Res.,1999

2. Integrating user preferences into evolutionary multi-objective optimization;Branke,2004

3. Approximating a multi-dimensional Pareto front for a land use management problem: A modified MOEA with an epigenetic silencing metaphor;Chikumbo,2012

4. Multi-objective optimization using evolutionary algorithms;Deb,2001

5. Simulated binary crossover for continuous search space;Deb;Complex Syst.,1995

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A comprehensive survey on interactive evolutionary computation in the first two decades of the 21st century;Applied Soft Computing;2024-10

2. Co-evolution improves the efficiency of preference learning methods when the Decision Maker's aspirations develop over time;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12

3. Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs;European Journal of Operational Research;2023-07

4. Detecting Hidden and Irrelevant Objectives in Interactive Multi-Objective Optimization;IEEE Transactions on Evolutionary Computation;2023

5. MCDM, EMO and Hybrid Approaches: Tutorial and Review;Mathematical and Computational Applications;2022-12-19