A FULL RANKING METHOD USING INTEGRATED DEA MODELS AND ITS APPLICATION TO MODIFY GA FOR FINDING PARETO OPTIMAL SOLUTION OF MOP PROBLEM

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.

RAZAVIAN SHABNAM; TOHIDI GHASEM

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2011 | Volume:7 | Issue:15 Page(s): 8-14

Download Full-Text

View:

236

Download:

Cites:

Information Journal Paper

Title

A FULL RANKING METHOD USING INTEGRATED DEA MODELS AND ITS APPLICATION TO MODIFY GA FOR FINDING PARETO OPTIMAL SOLUTION OF MOP PROBLEM

Author(s)

RAZAVIAN SHABNAM | TOHIDI GHASEM | Issue Writer Certificate

Keywords

DATA ENVELOPMENT ANALYSIS (DEA)

RANKING

INTEGRATED DEA MODELS

MULTI-OBJECTIVE PROGRAMMING (MOP)

GENETIC ALGORITHM (GA)

EFFICIENCY

Abstract

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA RANKING method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi-Objective Programming (MOP) problem. The researchers have used RANKING method as a shortcut way to modify GA to decrease the iterations of GA. The modified algorithm reduces the computational efforts to find Pareto optimal solutions of MOP problem and can be used to find Pareto optimal solutions of MOP with convex and non-convex efficient frontiers. An example is given to illustrate the modified algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

RAZAVIAN, SHABNAM, & TOHIDI, GHASEM. (2011). A FULL RANKING METHOD USING INTEGRATED DEA MODELS AND ITS APPLICATION TO MODIFY GA FOR FINDING PARETO OPTIMAL SOLUTION OF MOP PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 7(15), 8-14. SID. https://sid.ir/paper/309889/en

Vancouver: Copy

RAZAVIAN SHABNAM, TOHIDI GHASEM. A FULL RANKING METHOD USING INTEGRATED DEA MODELS AND ITS APPLICATION TO MODIFY GA FOR FINDING PARETO OPTIMAL SOLUTION OF MOP PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2011;7(15):8-14. Available from: https://sid.ir/paper/309889/en

IEEE: Copy

SHABNAM RAZAVIAN, and GHASEM TOHIDI, “A FULL RANKING METHOD USING INTEGRATED DEA MODELS AND ITS APPLICATION TO MODIFY GA FOR FINDING PARETO OPTIMAL SOLUTION OF MOP PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 7, no. 15, pp. 8–14, 2011, [Online]. Available: https://sid.ir/paper/309889/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops