Utilisation of pruned Pareto-optimal solutions in the multi objective optimisation: an application to system redundancy allocation problems
by Asghar Moeini; Mehdi Foumani; Kouroush Jenab
International Journal of Applied Decision Sciences (IJADS), Vol. 6, No. 1, 2013

Abstract: Multi-objective optimisation problems normally have not one but a set of solutions, which are called Pareto-optimal solutions or non-dominated solutions. Once a Pareto-optimal set has been obtained, the decision-maker faces the challenge of analysing a potentially large set of solutions. Selecting one solution over others can be quite a challenging task because the Pareto set can contain an unmanageable number of solutions. This process is called post-Pareto optimality analysis. To deal with this difficulty, this study proposes the approach that promisingly prunes the Pareto optimal set. In this study, the newly developed approach uses Monte-Carlo simulation taking into account the decision maker's prioritisation to prune the Pareto optimal set. Then, the central weight vector, the optimal frequently appearance index and upper and lower bands of weights are enclosed to each solution to facilitate selecting a final solution. The well-known redundancy allocation problem is used to show the performance of the proposed method.

Online publication date: Thu, 28-Nov-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com