A new algorithm for finding Pareto optimal points of multiobjective 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.

AKBARI FERESHTEH; KHORRAM ESMAILE; Ghaznavi Mehrdad

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: MODERN RESEARCHES IN DECISION MAKING Year:2020 | Volume:5 | Issue:1 Page(s): 141-169

Download Full-Text

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

Persian Verion

View:

955

Download:

Cites:

Information Journal Paper

Title

A new algorithm for finding Pareto optimal points of multiobjective optimization problems

Author(s)

AKBARI FERESHTEH | KHORRAM ESMAILE | Ghaznavi Mehrdad | Issue Writer Certificate

Keywords

Multiobjective optimization problemQ1

ScalarizationQ1

NormalizationQ1

Pareto pointsQ1

Properly efficient solutionsQ1

Abstract

In this paper, a modified Scalarization technique for finding Pareto optimal points of Multiobjective optimization problems is provided. The proposed method is a combination of the normal constraint and elastic constraint method. First, we introduce the optimization problem of the modified method and then we present an algorithm for obtaining the set of Pareto points. Thereafter, the relationship between optimal solutions of this Scalarization problem and (weakly, properly) efficient solutions of the Multiobjective optimization problems are analyzed. Indeed, some necessary conditions for (weak, proper) efficiency are presented. All the provided results are established without any convexity assumption. Furthermore, we propose a new algorithm for approximating the Pareto front of Multiobjective optimization problems. We solve some test problems by applying the suggested algorithm and compare the results with some existing methods, including the epsilon-constraint method, the Pascolleti-Serafini method and the NBI method. The obtained results highlight the efficiency of our approach in comparison with examined methods.

Cites

No record.

References

No record.

Cite

APA: Copy

AKBARI, FERESHTEH, KHORRAM, ESMAILE, & Ghaznavi, Mehrdad. (2020). A new algorithm for finding Pareto optimal points of multiobjective optimization problems. MODERN RESEARCHES IN DECISION MAKING, 5(1 ), 141-169. SID. https://sid.ir/paper/397996/en

Vancouver: Copy

AKBARI FERESHTEH, KHORRAM ESMAILE, Ghaznavi Mehrdad. A new algorithm for finding Pareto optimal points of multiobjective optimization problems. MODERN RESEARCHES IN DECISION MAKING[Internet]. 2020;5(1 ):141-169. Available from: https://sid.ir/paper/397996/en

IEEE: Copy

FERESHTEH AKBARI, ESMAILE KHORRAM, and Mehrdad Ghaznavi, “A new algorithm for finding Pareto optimal points of multiobjective optimization problems,” MODERN RESEARCHES IN DECISION MAKING, vol. 5, no. 1 , pp. 141–169, 2020, [Online]. Available: https://sid.ir/paper/397996/en

Related Journal Papers