Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex space. In this research, A mathematical model of the scheduling problem was developed based on the above objectives. Here, we proposed a tailored tune-up of SA and BA, both of which have been specifically developed and implemented to solve the proposed model for integrated scheduling and delivery, geared for the bifunctional nature of the problem. Quantitative results indicate that the Bee Algorithm (BA) achieves a more diverse Pareto front, with an average improvement of approximately 12–18 % in solution diversity compared to Simulated Annealing (SA). In contrast, SA converges faster, reducing computational time by about 30–40 % for large problem instances (n ≥ 80). Overall, BA provides better trade-offs between objectives, while SA offers superior computational efficiency. The results showed that both algorithms can generate solutions that are balanced and time-efficient.
This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)
... Show MoreArtificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing flower pollination algorithm in the environmental field to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement. We estimate the regression function of the semi-parametric model by estimating the parametric model and estimating the non-parametric model, the parametric model is estimated by using an instrumental variables method (Wald method, Bartlett’s method, and Durbin
... Show MoreImage segmentation using bi-level thresholds works well for straightforward scenarios; however, dealing with complex images that contain multiple objects or colors presents considerable computational difficulties. Multi-level thresholding is crucial for these situations, but it also introduces a challenging optimization problem. This paper presents an improved Reptile Search Algorithm (RSA) that includes a Gbest operator to enhance its performance. The proposed method determines optimal threshold values for both grayscale and color images, utilizing entropy-based objective functions derived from the Otsu and Kapur techniques. Experiments were carried out on 16 benchmark images, which inclu
The impact of applying the K-W-L self-scheduling technique on first-year intermediate students' learning of basic volleyball skills, Ayad Ali Hussein*, Israa Fouad Salih
There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreThe structural, optical and electrical properties of ZnS films prepared by vacuum evaporation technique on glass substrate at room temperature and treated at different annealing temperatures (323, 373, 423)K of thickness (0.5)µm have been studied. The structure of these films is determined by X-ray diffraction (XRD). The X-ray diffraction studies show that the structure is polycrystalline with cubic structure, and there are strong peaks at the direction (111). The optical properties investigated which include the absorbance and transmittance spectra, energy band gab, absorption coefficient, and other optical constants. The results showed that films have direct optical transition. The optical band gab was found to be in the range t
... Show MoreLiquid-liquid membrane extraction technique, pertraction, using three types of solvents (methyl isobutyl ketone, n-butyl acetate, and n-amyl acetate) was used for recovery of penicillin V from simulated fermentation broth under various operating conditions of pH value (4-6) for feed and (6-8) for receiver phase, time (0-40 min), and agitation speed (300-500 rpm) in a batch laboratory unit system. The optimum conditions for extraction were at pH of 4 for feed, and 8 for receiver phase, rotation speed of 500 rpm, time of 40 min, and solvent of MIBK as membrane, where more than 98% of penicillin was extracted.