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.
The Korteweg-de Vries equation plays an important role in fluid physics and applied mathematics. This equation is a fundamental within study of shallow water waves. Since these equations arise in many applications and physical phenomena, it is officially showed that this equation has solitary waves as solutions, The Korteweg-de Vries equation is utilized to characterize a long waves travelling in channels. The goal of this paper is to construct the new effective frequent relation to resolve these problems where the semi analytic iterative technique presents new enforcement to solve Korteweg-de Vries equations. The distinctive feature of this method is, it can be utilized to get approximate solutions for travelling waves of
... Show MoreIn this paper, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
The main object of this study is to solve a system of nonlinear ordinary differential equations (ODE) of the first order governing the epidemic model using numerical methods. The application under study is a mathematical epidemic model which is the influenza model at Australia in 1919. Runge-kutta methods of order 4 and of order 45 for solving this initial value problem(IVP) problem have been used. Finally, the results obtained have been discussed tabularly and graphically.
When scheduling rules become incapable to tackle the presence of a variety of unexpected disruptions frequently occurred in manufacturing systems, it is necessary to develop a reactive schedule which can absorb the effects of such disruptions. Such responding requires efficient strategies, policies, and methods to controlling production & maintaining high shop performance. This can be achieved through rescheduling task which defined as an essential operating function to efficiently tackle and response to uncertainties and unexpected events. The framework proposed in this study consists of rescheduling approaches, strategies, policies, and techniques, which represents a guideline for most manufacturing companies operatin
... Show MoreIn this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin
... Show MoreGiven the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init
... Show MoreGumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu
... Show More