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.
Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re
... Show More<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi
... Show MoreBootstrap is one of an important re-sampling technique which has given the attention of researches recently. The presence of outliers in the original data set may cause serious problem to the classical bootstrap when the percentage of outliers are higher than the original one. Many methods are proposed to overcome this problem such Dynamic Robust Bootstrap for LTS (DRBLTS) and Weighted Bootstrap with Probability (WBP). This paper try to show the accuracy of parameters estimation by comparison the results of both methods. The bias , MSE and RMSE are considered. The criterion of the accuracy is based on the RMSE value since the method that provide us RMSE value smaller than other is con
... Show MoreData centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le
... Show MoreCloth simulation and animation has been the topic of research since the mid-80's in the field of computer graphics. Enforcing incompressible is very important in real time simulation. Although, there are great achievements in this regard, it still suffers from unnecessary time consumption in certain steps that is common in real time applications. This research develops a real-time cloth simulator for a virtual human character (VHC) with wearable clothing. This research achieves success in cloth simulation on the VHC through enhancing the position-based dynamics (PBD) framework by computing a series of positional constraints which implement constant densities. Also, the self-collision and collision wit
... Show MoreRA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2
Software-Defined Networking (SDN) has evolved network management by detaching the control plane from the data forwarding plane, resulting in unparalleled flexibility and efficiency in network administration. However, the heterogeneity of traffic in SDN presents issues in achieving Quality of Service (QoS) demands and efficiently managing network resources. SDN traffic flows are often divided into elephant flows (EFs) and mice flows (MFs). EFs, which are distinguished by their huge packet sizes and long durations, account for a small amount of total traffic but require disproportionate network resources, thus causing congestion and delays for smaller MFs. MFs, on the other hand, have a short lifetime and are latency-sensitive, but they accou
... Show MoreThe consumption of dried bananas has increased because they contain essential nutrients. In order to preserve bananas for a longer period, a drying process is carried out, which makes them a light snack that does not spoil quickly. On the other hand, machine learning algorithms can be used to predict the sweetness of dried bananas. The article aimed to study the effect of different drying times (6, 8, and 10 hours) using an air dryer on some physical and chemical characteristics of bananas, including CIE-L*a*b, water content, carbohydrates, and sweetness. Also predicting the sweetness of dried bananas based on the CIE-L*a*b ratios using machine learn- ing algorithms RF, SVM, LDA, KNN, and CART. The results showed that increasing the drying
... Show More