Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating optimal timetable schedules with different copies by increasing the probability of giving the best schedule for each stage in the campus with the ability to replace the timetable when needed. The Evolutionary Algorithm (EA) utilized in this paper is the Genetic Algorithm (GA) which is a common multi-solution metaheuristic search based on the evolutionary population that can be applied to solve complex combinatorial problems like timetabling problems. In this work, all inputs: courses, teachers, and time acted by one array to achieve local search and combined this acting of the timetable by using the heuristic crossover to ensure that the essential conditions are not broken. The result of this work is a flexible scheduling system, which shows the diversity of all possible timetables that can be created depending on user conditions and needs.
This work aims to find a solution to the problem under investigation and to study non-local boundary-value problems for rectangular domains and two-dimensional thirdorder partial differential equations (PDEs). A finite-difference method combined with the trapezoidal rule is used to solve problems. The numerical results were determined to be steady and accurate.
Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to
... Show Moreplanning is among the most significant in the field of robotics research. As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the
... Show MoreIt is an established fact that substantial amounts of oil usually remain in a reservoir after primary and secondary processes. Therefore; there is an ongoing effort to sweep that remaining oil. Field optimization includes many techniques. Horizontal wells are one of the most motivating factors for field optimization. The selection of new horizontal wells must be accompanied with the right selection of the well locations. However, modeling horizontal well locations by a trial and error method is a time consuming method. Therefore; a method of Artificial Neural Network (ANN) has been employed which helps to predict the optimum performance via proposed new wells locations by incorporatin
This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.
A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever
... Show MoreThe research aims to know the impact of the innovative matrix strategy and the problem tree strategy in teaching mathematics to intermediate grade female students on mathematical proficiency. To achieve the research objectives, an experimental approach and a quasi-experimental design were used for two equivalent experimental groups. The first is studied according to the innovative matrix strategy, the second group is studied according to the problem tree strategy. The research sample consisted of (32) female students of the first intermediate grade, who were intentionally chosen after ensuring their equivalence, taking into several factors, most notably (chronological age, previous achievement, and intelligence test). The research tools con
... Show MoreAbstract
The current research aims to identify the effectiveness of concept maps in the academic achievement of the art of elegance and fashion for third vocational students. The current research is a quasi-experimental one. The research sample consisted of (74) female students in Al-Saydiyah secondary school for girls, they were divided into two groups: the experimental group and the control group. The following hypothesis was developed: There are no statistically significant differences at the level (0.05) between the average scores of the students who studied the subject using concept maps and the average scores of the students who studied the subject in the traditional method in the post-achievement test. The
... Show MoreAbstract
Objectives: this study aims to: (1). Assess self-esteem level and academic achievement for students of nursing colleges in southern Iraq. (2). Determine the relationship between levels of self-esteem and academic achievement of the student in the first semester. (3). Identify differences of self-esteem with gender and different age groups.
Methodology: a sample of (426 students) was purposively selected then collected by using a questionnaire which consisted of: I- Sociodemographic characteristics for assessing some important aspects of students, II- Rosenberg's Self-Esteem Scale (RSES) III- Iraq Grading Scale for assessing student achievement. Finally statistical analysis (SPSS) for data processing.
Results: study resu