RESUMEN
Optimization is challenging even after numerous multi-objective evolutionary algorithms have been developed. Most of the multi-objective evolutionary algorithms failed to find out the best solutions spread and took more fitness evolution value to find the best solution. This article proposes an extended version of a multi-objective group counseling optimizer called MOGCO-II. The proposed algorithm is compared with MOGCO, MOPSO, MOCLPSO, and NSGA-II using the well-known benchmark problem such as Zitzler Deb Thieler (ZDT) function. The experiments show that the proposed algorithm generates a better solution than the other algorithms. The proposed algorithm also takes less fitness evolution value to find the optimal Pareto front. Moreover, the textile dyeing industry needs a large amount of fresh water for the dyeing process. After the dyeing process, the textile dyeing industry discharges a massive amount of polluted water, which leads to serious environmental problems. Hence, we proposed a MOGCO-II based optimization scheduling model to reduce freshwater consumption in the textile dyeing industry. The results show that the optimization scheduling model reduces freshwater consumption in the textile dyeing industry by up to 35% compared to manual scheduling.
RESUMEN
The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography. For CMMP the researchers have proposed various techniques such as dynamic approach, arithmetic approach, and sequential multiplication. However, these techniques are deficient for providing optimal results for CMMP in terms of computational time and significant amount of scalar multiplication. In this article, we proposed a new model to minimize the Chain Matrix Multiplication (CMM) operations based on group counseling optimizer (GCO). Our experimental results and their analysis show that the proposed GCO model has achieved significant reduction of time with efficient speed when compared with sequential chain matrix multiplication approach. The proposed model provides good performance and reduces the multiplication operations varying from 45% to 96% when compared with sequential multiplication. Moreover, we evaluate our results with the best known dynamic programing and arithmetic multiplication approaches, which clearly demonstrate that proposed model outperforms in terms of computational time and space complexity.