In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of

            In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f

The paper uses the Direct Synthesis (DS) method for tuning the Proportional Integral Derivative (PID) controller for controlling the DC servo motor. Two algorithms are presented for enhancing the performance of the suggested PID controller. These algorithms are Back-Propagation Neural Network and Particle Swarm Optimization (PSO). The performance and characteristics of DC servo motor are explained. The simulation results that obtained by using Matlab program show that the steady state error is eliminated with shorter adjusted time when using these algorithms with PID controller. A comparative between the two algorithms are described in this paper to show their effectiveness, which is found that the PSO algorithm gives be

     The main task of creating new digital images of different skin diseases is to increase the resolution of the specific textures and colors of each skin disease. In this paper, the performance of generative adversarial networks has been optimized to generate multicolor and histological color digital images of a variety of skin diseases (melanoma, birthmarks, and basal cell carcinomas). Two architectures for generative adversarial networks were built using two models: the first is a model for generating new images of dermatology through training processes, and the second is a discrimination model whose main task is to identify the generated digital images as either real or fake. The gray wolf swarm algorithm and the whale swarm alg

Background: Large amounts of oily wastewater and its derivatives are discharged annually from several industries to the environment. Objective: The present study aims to investigate the ability to remove oil content and turbidity from real oily wastewater discharged from the wet oil's unit (West Qurna 1-Crude Oil Location/ Basra-Iraq) by using an innovated electrocoagulation reactor containing concentric aluminum tubes in a monopolar mode. Methods: The influences of the operational variables (current density (1.77-7.07 mA/cm2) and electrolysis time (10-40 min)) were studied using response surface methodology (RSM) and Minitab-17 statistical program. The agitation speed was taken as 200 rpm. Energy and electrodes consumption had been studi

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operation

This paper includes an experimental study of hydrogen mass flow rate and inlet hydrogen pressure effect on the fuel cell performance. Depending on the experimental results, a model of fuel cell based on artificial neural networks is proposed. A back propagation learning rule with the log-sigmoid activation function is adopted to construct neural networks model. Experimental data resulting from 36 fuel cell tests are used as a learning data. The hydrogen mass flow rate, applied load and inlet hydrogen pressure are inputs to fuel cell model, while the current and voltage are outputs. Proposed model could successfully predict the fuel cell performance in good agreement with actual data. This work is extended to developed fuel cell feedback

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t

Data-driven models perform poorly on part-of-speech tagging problems with the square Hmong language, a low-resource corpus. This paper designs a weight evaluation function to reduce the influence of unknown words. It proposes an improved harmony search algorithm utilizing the roulette and local evaluation strategies for handling the square Hmong part-of-speech tagging problem. The experiment shows that the average accuracy of the proposed model is 6%, 8% more than HMM and BiLSTM-CRF models, respectively. Meanwhile, the average F1 of the proposed model is also 6%, 3% more than HMM and BiLSTM-CRF models, respectively.

     The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a via