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.
Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreThe performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show MoreConstruction contractors usually undertake multiple construction projects simultaneously. Such a situation involves sharing different types of resources, including monetary, equipment, and manpower, which may become a major challenge in many cases. In this study, the financial aspects of working on multiple projects at a time are addressed and investigated. The study considers dealing with financial shortages by proposing a multi-project scheduling optimization model for profit maximization, while minimizing the total project duration. Optimization genetic algorithm and finance-based scheduling are used to produce feasible schedules that balance the finance of activities at any time w
High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination
... Show MoreTransportation and distribution are the most important elements in the work system for any company, which are of great importance in the success of the chain work. Al-Rabee factory is one of the largest ice cream factories in Iraq and it is considered one of the most productive and diversified factories with products where its products cover most areas of the capital Baghdad, however, it lacks a distribution system based on scientific and mathematical methods to work in the transportation and distribution processes, moreover, these processes need a set of important data that cannot in any way be separated from the reality of fuzziness industrial environment in Iraq, which led to use the fuzzy sets theory to reduce the levels of uncertainty.
... Show MoreConstruction project life-cycle processes must be managed in a more effective and predictable way to meet project stakeholder needs , However, there is increasing concern about whether know-how effectively improves understanding of underlying theories of project management processes for construction organizations and their project managers Project planning and scheduling are considered as key and challenging tools in controlling and monitoring project performance , but many worldwide construction projects appear to give insufficient attention to effective management and definition of project planning, including pre planning stages . Indeed, some planning issues indeed, some planning issues have been completely ove
... Show MoreLeaching scheduling techniques are one of the suggested solutions for water scarcity problems .The aim of the study is to show the possibility of using leaching scheduling, when applying the irrigation scheduling program for a certain irrigation project, which was prepare by Water Resources Engineering –University of Baghdad with some modifications to generalized it and it make applicable to various climatic zone and different soil types.
The objectives of this research is to build a system that concerns the prediction of the leaching scheduling (depth and date of leaching water), illustrating the main problems (soil salinity, save the amount of leaching requirement, and to maintain crops growth).The other objective is to compare be
Scheduling problems have been treated as single criterion problems until recently. Many of these problems are computationally hard to solve three as single criterion problems. However, there is a need to consider multiple criteria in a real life scheduling problem in general. In this paper, we study the problem of scheduling jobs on a single machine to minimize total tardiness subject to maximum earliness or tardiness for each job. And we give algorithm (ETST) to solve the first problem (p1) and algorithm (TEST) to solve the second problem (p2) to find an efficient solution.
لم تكن المخدرات وليدة هذا العصر فقد عرفها الانسان منذ القدم وحاربتها المجتمعات القديمة ثقافياً واجتماعياً ودينياً ، حيث تعتبر المخدرات اخطر كارثة عرفتها البشرية في تاريخها وبدأت تتطور لتصبح تجارة عالمية غير مشروعة ترعاها عصابات منظمةهدفها تدمير طاقات وقدرات وقيم الشباب آمال هذه الامة وكنزها الحقيقي وهذا يعني تفريغ المجتمع من العقول المبدعة فيه حتى يبقى مجتمعنا متخلفاً من السهل السيطرة عليه.
... Show More