Optimal Components Assignment Problem for Stochastic-Flow Networks
- 1 UniversitÃ© de Mâ€™hamed Bougara Boumerdes, Algeria, Algeria
- 2 Université de M'hamed Bougara Boumerdes, Algeria
- 3 Aswan University, Egypt
Copyright: © 2020 Abdellah Aissou, Abdelhamid Daamouche and Moatamad Refaat Hassan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Components assignment problem to maximize the network reliability in the case of each component has both an assignment cost and lead-time is never discussed. Therefore, this paper focuses on solving this problem under the above mentioned constraints. The presented problem is called an Optimal Components Assignment Problem (OCAP) and it is formulated based on three constraints namely total assignment cost, total lead-time and system reliability. Also, an approach based on a Random Weighted Genetic Algorithm (RWGA) is presented to solve the OCAP. The results revealed that an optimal components assignment leads to the maximum reliability, minimum assignment cost and minimum total lead-time using the proposed approach.
- 862 Views
- 614 Downloads
- 0 Citations
- Stochastic-Flow Networks
- Components Assignment Problem
- System Reliability
- Multi-Objective Genetic Algorithm