New decision-making methods for ranking of non-dominated points for multi-objective optimization problems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Dolatnezhadsomarin A.; Khorram E.; Yousefi khoshbakht M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Scientia Iranica Year:2024 | Volume:31 | Issue:Transactions on Industrial Engineering (E)3 Page(s): 252-268

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

New decision-making methods for ranking of non-dominated points for multi-objective optimization problems

Author(s)

Dolatnezhadsomarin A. | Khorram E. | Yousefi khoshbakht M. | Issue Writer Certificate

Keywords

Multi-objective optimization problem

Pareto optimal solution

Weighted Sum Method

Decision-Making

Abstract

A Multi-objective optimization problem (MOP) is a simultaneous optimization of more than one real-valued conflicting objective function subject to some constraints. Most MOP algorithms try to provide a set of Pareto optimal solutions which are equally good in terms of the objective functions. The set can be infinite, and hence, analysis and choice task of one or several solutions among the equally good solutions is hard for a decision maker (DM). In this paper, a new scalarization approach is proposed to select a Pareto optimal solution for convex MOPs such that the relative importance assigned to its objective functions is very close together. In addition, two Decision-Making methods are developed to analyze convex and non-convex MOPs based on evaluating a set of Pareto optimal solutions and the relative importance of the objective functions. These methods support the DM to rank the solutions and obtain one or several of them for real implementation without having any familiarity about MOPs.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans