Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its execution. Finally, this paper
concludes that the enhanced algorithm via diversity operators has discrepancies about the initial AFSA, and
it also provided both sound quality resolution and intersected rate.
The implementation of the concept of project scheduling in the organizations generally requires a set of procedures and requirements, So, most important of all is the understanding and knowledge of the tools and techniques which are called the methods of scheduling projects. Consequently, the projects of the municipality administration in the holy governorate of Karbala suffer from the problem of delaying their projects and chaos in the ways of implementation. To provide assistance to this directorate and to demonstrate how to schedule projects using one of the advanced scientific methods that proved their ability to schedule any project and its potential to accelerate the time of completion, as well as ease of use and effectiven
... Show MoreGiven a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.
In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show MoreThis article presents a new cascaded extended state observer (CESO)-based sliding-mode control (SMC) for an underactuated flexible joint robot (FJR). The control of the FJR has many challenges, including coupling, underactuation, nonlinearity, uncertainties and external disturbances, and the noise amplification especially in the high-order systems. The proposed control integrates the CESO and SMC, in which the CESO estimates the states and disturbances, and the SMC provides the system robustness to the uncertainty and disturbance estimation errors. First, a dynamic model of the FJR is derived and converted from an underactuated form to a canonical form via the Olfati transformation and a flatness approach, which reduces the complexity of th
... Show Moreis at an all-time high in the modern period, and the majority of the population uses the Internet for all types of communication. It is great to be able to improvise like this. As a result of this trend, hackers have become increasingly focused on attacking the system/network in numerous ways. When a hacker commits a digital crime, it is examined in a reactive manner, which aids in the identification of the perpetrators. However, in the modern period, it is not expected to wait for an attack to occur. The user anticipates being able to predict a cyberattack before it causes damage to the system. This can be accomplished with the assistance of the proactive forensic framework presented in this study. The proposed system combines
... Show MoreIn this paper, we propose a new approach of regularization for the left censored data (Tobit). Specifically, we propose a new Bayesian group Bridge for left-censored regression ( BGBRLC). We developed a new Bayesian hierarchical model and we suggest a new Gibbs sampler for posterior sampling. The results show that the new approach performs very well compared to some existing approaches.
The goal of this research is to solve several one-dimensional partial differential equations in linear and nonlinear forms using a powerful approximate analytical approach. Many of these equations are difficult to find the exact solutions due to their governing equations. Therefore, examining and analyzing efficient approximate analytical approaches to treat these problems are required. In this work, the homotopy analysis method (HAM) is proposed. We use convergence control parameters to optimize the approximate solution. This method relay on choosing with complete freedom an auxiliary function linear operator and initial guess to generate the series solution. Moreover, the method gives a convenient way to guarantee the converge
... Show MoreIn this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.
Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.