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 paper considers approximate solution of the hyperbolic one-dimensional wave equation with nonlocal mixed boundary conditions by improved methods based on the assumption that the solution is a double power series based on orthogonal polynomials, such as Bernstein, Legendre, and Chebyshev. The solution is ultimately compared with the original method that is based on standard polynomials by calculating the absolute error to verify the validity and accuracy of the performance.
Physics and applied mathematics form the basis for understanding natural phenomena using differential equations depicting the flow in porous media, the motion of viscous liquids, and the propagation of waves. These equations provide a thorough study of physical processes, enhancing the understanding of complex applications in engineering, technology, and medicine. This paper presents novel approximate solutions for the Darcy-Brinkmann-Forchheimer moment equation, the Blasius equation and the FalknerSkan equation with initial / boundary conditions by using two iterative methods: the variational iteration method and the optimal variational iteration method. The variational iteration method is effectively developed by adding a control paramete
... Show MoreThe fuzzy assignment models (FAMs) have been explored by various literature to access classical values, which are more precise in our real-life accomplishment. The novelty of this paper contributed positively to a unique application of pentagonal fuzzy numbers for the evaluation of FAMs. The new method namely Pascal’s triangle graded mean (PT-GM) has presented a new algorithm in accessing the critical path to solve the assignment problems (AP) based on the fuzzy objective function of minimising total cost. The results obtained have been compared to the existing methods such as, the centroid formula (CF) and centroid formula integration (CFI). It has been demonstrated that operational efficiency of this conducted method is exquisitely deve
... Show MoreThe primary objective of the current paper is to suggest and implement effective computational methods (DECMs) to calculate analytic and approximate solutions to the nonlocal one-dimensional parabolic equation which is utilized to model specific real-world applications. The powerful and elegant methods that are used orthogonal basis functions to describe the solution as a double power series have been developed, namely the Bernstein, Legendre, Chebyshev, Hermite, and Bernoulli polynomials. Hence, a specified partial differential equation is reduced to a system of linear algebraic equations that can be solved by using Mathematica®12. The techniques of effective computational methods (DECMs) have been applied to solve some s
... Show MoreThe fuzzy assignment models (FAMs) have been explored by various literature to access classical values, which are more precise in our real-life accomplishment. The novelty of this paper contributed positively to a unique application of pentagonal fuzzy numbers for the evaluation of FAMs. The new method namely Pascal's triangle graded mean (PT-GM) has presented a new algorithm in accessing the critical path to solve the assignment problems (AP) based on the fuzzy objective function of minimising total cost. The results obtained have been compared to the existing methods such as, the centroid formula (CF) and centroid formula integration (CFI). It has been demonstrated that operational efficiency of this conducted method is exquisitely develo
... Show MoreMarkov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem
... Show MoreWith the wide developments of computer science and applications of networks, the security of information must be increased and make it more complex. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is important because of its strong encryption. The proposed updates are represented by encryption and decryption Rijndael S-Box using NTRU algorithm. These modifications enhance the degree of
... Show MoreWith the wide developments of computer applications and networks, the security of information has high attention in our common fields of life. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is widely accepted due to its strong encryption, and complex processing as well as its resistance to brute force attack. The proposed modifications are implemented by encryption and decryption Rijndael
... Show More