The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

     The control charts are one of the scientific technical statistics tools that will be used to control of production and always contained from three lines  central line and upper, lower lines to control quality of production and represents set of numbers so finally the operating productivity under control or nor than depending on the actual observations. Some times to calculating the control charts are not accurate and not confirming, therefore the Fuzzy Control Charts are using instead of Process Control Charts so this method is more sensitive, accurate and economically for assisting decision maker to control the operation system as early time. In this project will be used set data fr

 According to the circumstances experienced by our country which led to Occurrence of many crises that are the most important crisis is gaining fuel therefore , the theory of queue ( waiting line ) had been used to solve this crisis and as the relevance of this issue indirect and essential role in daily life  .

This research aims to conduct a study of the distribution of gasoline station in (both sides AL – kharkh and AL Rusafa, for the purpose of reducing wasting time and services time through the criteria of the theory of queues and work to improve the efficiency of these stations by the other hand. we are working to reduce the cost of station and increase profits by reducing the active serv

The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

Abstract:-

            The approach maintenance and replacement one of techniques of operations research whom cares of the failure experienced by a lot of production lines which consist of a set of machines and equipment, which in turn exposed to the failure or work stoppages over the lifetime, which requires reducing the working time of these machines or equipment below what can or conuct  maintenance process once in a while or a replacement for one part of the machine or replace one of the machines in production lines. In this research is the study of the failure s that occur in some parts of one of the machines for the General Company for Vege

              The current paper proposes a new estimator for the linear regression model parameters under Big Data circumstances.  From the diversity of Big Data variables comes many challenges that  can be interesting to the  researchers who try their best to find new and novel methods to estimate the parameters of linear regression model. Data has been collected by Central Statistical Organization IRAQ, and the child labor in Iraq has been chosen as data. Child labor is the most vital phenomena that both society and education are suffering from and it affects the future of our next generation. Two methods have been selected to estimate the parameter

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord