Communication has a remarkable and strategic role for the success of every enterprise. Nowadays, computer networks can be used as efficient tools to create connections between departments of an organization and to communicate with customers. Therefore, it is crucial for companies with IT-based activities to use computer networks so as to increase their efficiencies. In this paper, a bi-objective mathematical formulation is proposed for server farms. A server farm is a cluster of computer systems connected together to provide services to an organization and its customers. This model optimizes reliability and cost of server farms, concurrently. This problem is called the redundancy allocation problem that belongs to the class of NP-hard problems. Therefore, three meta-heuristics namely non-dominated sorting genetic algorithm II, pareto envelope-based selection algorithm II, and strength pareto evolutionary algorithm II have been hired to obtain feasible solutions in a reasonable computation time. To evaluate the performances of meta-heuristic methods, the ε-constraint method as an exact algorithm has also been used. The outputs demonstrate appropriate effectiveness of the employed algorithms.

沟通对于每个企业的成功都具有重要的战略意义。如今，计算机网络可以用作在组织部门之间建立连接并与客户进行沟通的有效工具。因此，对于从事基于IT的活动的公司来说，使用计算机网络以提高效率至关重要。本文针对服务器场提出了一种双目标数学公式。服务器场是连接在一起以向组织及其客户提供服务的计算机系统的集群。该模型可以同时优化服务器场的可靠性和成本。这个问题称为冗余分配问题，它属于NP-hard问题。因此，三种元启发式算法即非支配排序遗传算法II，已使用基于pareto包络的选择算法II和强度pareto进化算法II来在合理的计算时间内获得可行的解决方案。为了评估元启发式方法的性能，还使用了ε-约束方法作为精确算法。输出证明了所采用算法的适当有效性。