期刊名称:IAENG International Journal of Computer Science
印刷版ISSN:1819-656X
电子版ISSN:1819-9224
出版年度:2021
卷号:48
期号:1
语种:English
出版社:IAENG - International Association of Engineers
摘要:Components assignment problem subject to multiple constraints is generally considered as a multiobjective components assignment problem (MCAP). In this research work, an MCAP subject to three constraints, namely the network reliability, the total assignment cost, and the total lead-time is considered and solved. The mathematical formulation of the MCAP is given based on the constraints mentioned above (network reliability, total assignment cost, and total lead-time). Furthermore, an approach based on multiobjective particle swarm optimization (MOPSO) is presented to solve the MCAP problem. The main goal is to search for the best-assigned components that maximize network reliability and minimize both the total assignment cost and the total lead-time. The results revealed that MOPSO is more efficient than other optimization approaches based on single or multiobjective genetic algorithms. In addition, there is no need to convert the problem into minimization or maximization and normalize the solutions based on RWGA or NSGA approaches.