JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

Optimal Components Assignment Problem for Stochastic-Flow Networks

Abdellah Aissou1, Abdelhamid Daamouche2 and Moatamad Refaat Hassan3
  • 1 Université de M’hamed Bougara Boumerdes, Algeria, Algeria
  • 2 Université de M'hamed Bougara Boumerdes, Algeria
  • 3 Aswan University, Egypt

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 of Computer Science
Volume 15 No. 1, 2019, 108-117

DOI: https://doi.org/10.3844/jcssp.2019.108.117

Submitted On: 24 July 2018 Published On: 10 January 2019

How to Cite: Aissou, A., Daamouche, A. & Hassan, M. R. (2019). Optimal Components Assignment Problem for Stochastic-Flow Networks. Journal of Computer Science, 15(1), 108-117. https://doi.org/10.3844/jcssp.2019.108.117

Open AccessCopyright: © 2019 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.

  • 3,970 Views
  • 1,868 Downloads
  • 3 Citations

Download

Keywords

  • Stochastic-Flow Networks
  • Components Assignment Problem
  • System Reliability
  • Multi-Objective Genetic Algorithm