@article {10.3844/jcssp.2019.108.117,
article_type = {journal},
title = {Optimal Components Assignment Problem for Stochastic-Flow Networks},
author = {Aissou, Abdellah and Daamouche, Abdelhamid and Hassan, Moatamad Refaat},
volume = {15},
number = {1},
year = {2019},
month = {Jan},
pages = {108-117},
doi = {10.3844/jcssp.2019.108.117},
url = {https://thescipub.com/abstract/jcssp.2019.108.117},
abstract = {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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}