You can search our database using more advanced options!

Sign In |

New User? Sign Up

Page Options

font size

Inside JIEI

EDITORIAL BOARD

Editorial board members' detail

ARCHIVE

The archive of journal

FAQ

Frequently Asked Questions

Order Issue

Name
Email

A full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem

View Full Details

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.