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

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.

It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed 

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

The increase globally fossil fuel consumption as it represents the main source of energy around the world, and the sources of heavy oil more than light, different techniques were used to reduce the viscosity and increase mobility of heavy crude oil. this study focusing on the experimental tests  and modeling with Back Feed Forward Artificial Neural Network (BFF-ANN) of the dilution technique to reduce a  heavy oil viscosity that was collected from the south- Iraq oil fields using organic solvents, organic diluents with different weight percentage  (5, 10 and  20 wt.% )  of  (n-heptane, toluene, and a mixture of  different ratio

The finishing operation of the electrochemical finishing technology (ECF) for tube of steel was investigated In this study. Experimental procedures included qualitative
and quantitative analyses for surface roughness and material removal. Qualitative analyses utilized finishing optimization of a specific specimen in various design and operating conditions; value of gap from 0.2 to 10mm, flow rate of electrolytes from 5 to 15liter/min, finishing time from 1 to 4min and the applied voltage from 6 to 12v, to find out the value of surface roughness and material removal at each electrochemical state. From the measured material removal for each process state was used to verify the relationship with finishing time of work piece. Electrochemi

In this study, multi-objective optimization of nanofluid aluminum oxide in a mixture of water and ethylene glycol (40:60) is studied. In order to reduce viscosity and increase thermal conductivity of nanofluids, NSGA-II algorithm is used to alter the temperature and volume fraction of nanoparticles. Neural network modeling of experimental data is used to obtain the values of viscosity and thermal conductivity on temperature and volume fraction of nanoparticles. In order to evaluate the optimization objective functions, neural network optimization is connected to NSGA-II algorithm and at any time assessment of the fitness function, the neural network model is called. Finally, Pareto Front and the corresponding optimum points are provided and