Optimal Components Assignment Problem for Stochastic-Flow Networks

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.

[1]  Amir Azaron,et al.  Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm , 2009, Comput. Oper. Res..

[2]  Wei-Chang Yeh,et al.  An efficient alternative to the exact evaluation of the quickest path flow network reliability problem , 2016, Comput. Oper. Res..

[3]  Yi-Kuei Lin,et al.  Multistate components assignment problem with optimal network reliability subject to assignment budget , 2011, Appl. Math. Comput..

[4]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[5]  Paul R. Harper,et al.  A genetic algorithm for the project assignment problem , 2005, Comput. Oper. Res..

[6]  Tom V. Mathew.  Genetic Algorithm , 2022 .

[7]  Yi-Kuei Lin,et al.  A two-stage approach for a multi-objective component assignment problem for a stochastic-flow network , 2013 .

[8]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[9]  Yi-Kuei Lin,et al.  Search for All Minimal Paths in a General Large Flow Network , 2012, IEEE Transactions on Reliability.

[10]  Shin-Guang Chen.  Optimal double-resource assignment for a distributed multistate network , 2015 .

[11]  Yi-Kuei Lin,et al.  MAXIMIZING NETWORK RELIABILITY FOR STOCHASTIC TRANSPORTATION NETWORKS UNDER A BUDGET CONSTRAINT BY USING A GENETIC ALGORITHM , 2011 .

[12]  Alice E. Smith,et al.  Reliability optimization of computer communication networks using genetic algorithms , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[13]  David W. Coit,et al.  MOMS-GA: A Multi-Objective Multi-State Genetic Algorithm for System Reliability Optimization Design Problems , 2008, IEEE Transactions on Reliability.

[14]  M. Hassan.  Solving a Component Assignment Problem for a Stochastic Flow Network under Lead-Time Constraint , 2015 .

[15]  Yi-Kuei Lin,et al.  Network Reliability of a Time-Based Multistate Network Under Spare Routing With $p$ Minimal Paths , 2011, IEEE Transactions on Reliability.

[16]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[17]  Yen-Zen Wang.  An application of genetic algorithm methods for teacher assignment problems , 2002, Expert Syst. Appl..

[18]  Yi-Kuei Lin,et al.  System reliability maximization for a computer network by finding the optimal two-class allocation subject to budget , 2015, Appl. Soft Comput..

[19]  Alice E. Smith,et al.  Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks , 1997, ICGA.

[20]  Alice E. Smith,et al.  A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS , 1995 .

[21]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[22]  H. Ishibuchi,et al.  MOGA: multi-objective genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[23]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[24]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[25]  Ernesto de Queirós Vieira Martins,et al.  An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[26]  Yi-Kuei Lin,et al.  Reliability of $k$ Separate Minimal Paths Under Both Time and Budget Constraints , 2010, IEEE Transactions on Reliability.

[27]  Yi-Kuei Lin,et al.  Two-commodity reliability evaluation for a stochastic-flow network with node failure , 2002, Comput. Oper. Res..

[28]  Yi-Kuei Lin,et al.  Routing policy of stochastic-flow networks under time threshold and budget constraint , 2009, Expert Syst. Appl..

[29]  Gen-Huey Chen,et al.  On the Quickest Path Problem , 1990, Inf. Process. Lett..

[30]  Yi-Kuei Lin.  Time version of the shortest path problem in a stochastic-flow network , 2009 .

[31]  Shin-Guang Chen,et al.  Optimal double-resource assignment for the robust design problem in multistate computer networks , 2014 .

[32]  L. J. Liu.  Optimization Design of Computer Network Reliability Based on Genetic Algorithms , 2016 .

[33]  Antonio Sedeño-Noda,et al.  Fast and fine quickest path algorithm , 2014, Eur. J. Oper. Res..

[34]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[35]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[36]  Yi-Kuei Lin,et al.  Evaluation of Optimal Network Reliability Under Components-Assignments Subject to a Transmission Budget , 2010, IEEE Transactions on Reliability.