The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
berturut-turut linear-k-daripada-n: Sistem F ialah urutan tertib bagi n komponen. Sistem ini gagal jika, dan hanya jika, k atau lebih banyak komponen berturut-turut gagal. Susunan optimum adalah salah satu masalah utama untuk sistem sedemikian. Dalam masalah ini, kami ingin mendapatkan susunan komponen yang optimum untuk memaksimumkan kebolehpercayaan sistem, apabila semua komponen sistem tidak perlu mempunyai kebarangkalian kegagalan komponen yang sama dan semua komponen adalah bebas dari segi statistik. Sebagai n menjadi besar, bagaimanapun, jumlah pengiraan akan menjadi terlalu banyak untuk diselesaikan dalam masa pengkomputeran yang munasabah walaupun dengan menggunakan komputer berprestasi tinggi. Hanafusa dan Yamamoto mencadangkan penggunaan Algoritma Genetik (GA) untuk mendapatkan susunan kuasi optimum secara linear berturut-turut-k-daripada-n: Sistem F. GA dikenali sebagai alat yang berkuasa untuk menyelesaikan banyak masalah pengoptimuman. Mereka juga mencadangkan perwakilan ordinal, yang menghasilkan hanya perkiraan yang memenuhi syarat yang diperlukan untuk pengaturan optimum dan menghapuskan pengaturan berlebihan dengan kebolehpercayaan sistem yang sama yang dihasilkan oleh pembalikan pengaturan tertentu. Dalam kertas ini, kami mencadangkan GA yang cekap. Kami telah mengubah suai kerja sebelumnya yang dinyatakan di atas untuk memperuntukkan komponen dengan kebarangkalian kegagalan yang rendah, iaitu komponen yang boleh dipercayai, pada selang masa yang sama, kerana pengaturan sedemikian nampaknya mempunyai kebolehpercayaan sistem yang agak tinggi. Melalui eksperimen berangka, kami memerhatikan cadangan GA kami dengan selang waktu k menyediakan penyelesaian yang lebih baik daripada kerja sebelumnya untuk kebanyakan kes.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Koji SHINGYOCHI, Hisashi YAMAMOTO, "Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n: F System" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 7, pp. 1578-1584, July 2009, doi: 10.1587/transfun.E92.A.1578.
Abstract: A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement is one of the main problems for such kind of system. In this problem, we want to obtain an optimal arrangement of components to maximize system reliability, when all components of the system need not have equal component failure probability and all components are mutually statistically independent. As n becomes large, however, the amount of calculation would be too much to solve within a reasonable computing time even by using a high-performance computer. Hanafusa and Yamamoto proposed applying Genetic Algorithm (GA) to obtain quasi optimal arrangement in a linear consecutive-k-out-of-n: F system. GA is known as a powerful tool for solving many optimization problems. They also proposed ordinal representation, which produces only arrangements satisfying the necessary conditions for optimal arrangements and eliminates redundant arrangements with same system reliabilities produced by reversal of certain arrangements. In this paper, we propose an efficient GA. We have modified the previous work mentioned above to allocate components with low failure probabilities, that is to say reliable components, at equal intervals, because such arrangements seem to have relatively high system reliabilities. Through the numerical experiments, we observed that our proposed GA with interval k provides better solutions than the previous work for the most cases.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1578/_p
Salinan
@ARTICLE{e92-a_7_1578,
author={Koji SHINGYOCHI, Hisashi YAMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n: F System},
year={2009},
volume={E92-A},
number={7},
pages={1578-1584},
abstract={A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement is one of the main problems for such kind of system. In this problem, we want to obtain an optimal arrangement of components to maximize system reliability, when all components of the system need not have equal component failure probability and all components are mutually statistically independent. As n becomes large, however, the amount of calculation would be too much to solve within a reasonable computing time even by using a high-performance computer. Hanafusa and Yamamoto proposed applying Genetic Algorithm (GA) to obtain quasi optimal arrangement in a linear consecutive-k-out-of-n: F system. GA is known as a powerful tool for solving many optimization problems. They also proposed ordinal representation, which produces only arrangements satisfying the necessary conditions for optimal arrangements and eliminates redundant arrangements with same system reliabilities produced by reversal of certain arrangements. In this paper, we propose an efficient GA. We have modified the previous work mentioned above to allocate components with low failure probabilities, that is to say reliable components, at equal intervals, because such arrangements seem to have relatively high system reliabilities. Through the numerical experiments, we observed that our proposed GA with interval k provides better solutions than the previous work for the most cases.},
keywords={},
doi={10.1587/transfun.E92.A.1578},
ISSN={1745-1337},
month={July},}
Salinan
TY - JOUR
TI - Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n: F System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1578
EP - 1584
AU - Koji SHINGYOCHI
AU - Hisashi YAMAMOTO
PY - 2009
DO - 10.1587/transfun.E92.A.1578
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2009
AB - A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement is one of the main problems for such kind of system. In this problem, we want to obtain an optimal arrangement of components to maximize system reliability, when all components of the system need not have equal component failure probability and all components are mutually statistically independent. As n becomes large, however, the amount of calculation would be too much to solve within a reasonable computing time even by using a high-performance computer. Hanafusa and Yamamoto proposed applying Genetic Algorithm (GA) to obtain quasi optimal arrangement in a linear consecutive-k-out-of-n: F system. GA is known as a powerful tool for solving many optimization problems. They also proposed ordinal representation, which produces only arrangements satisfying the necessary conditions for optimal arrangements and eliminates redundant arrangements with same system reliabilities produced by reversal of certain arrangements. In this paper, we propose an efficient GA. We have modified the previous work mentioned above to allocate components with low failure probabilities, that is to say reliable components, at equal intervals, because such arrangements seem to have relatively high system reliabilities. Through the numerical experiments, we observed that our proposed GA with interval k provides better solutions than the previous work for the most cases.
ER -