A preference ordered classification for a multi-objective max–min redundancy allocation problem
| Autor: | Banu Soylu, Selda Kapan Ulusoy |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Mathematical optimization
Reliability optimization General Computer Science Small number Pareto principle Management Science and Operations Research Search engine Categorization Modeling and Simulation Redundancy (engineering) Multiobjective programming Algorithm Reliability (statistics) Mathematics |
| Zdroj: | Computers & Operations Research. 38:1855-1866 |
| ISSN: | 0305-0548 |
| DOI: | 10.1016/j.cor.2011.02.024 |
| Popis: | In this study, we consider a bi-objective redundancy allocation problem on a series-parallel system with component level redundancy strategy. Our aim is to maximize the minimum subsystem reliability, while minimizing the overall system cost. The Pareto solutions of this problem are found by the augmented epsilon-constraint approach for small and moderate sized instances. After finding the Pareto solutions, we apply a well known sorting procedure, UTADIS, to categorize the solutions into preference ordered classes, such as A, B, and C. In this procedure, consecutive classes are separated by thresholds determined according to the utility function constructed from reference sets of classes. In redundancy allocation problems, reference sets may contain a small number of solutions (even a single solution). We propose the tau-neighborhood approach to increase the number of references. We perform experiments on some reliability optimization test problems and general test problems. (C) 2011 Elsevier Ltd. All rights reserved. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect