The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), Teaching Learning Based Algorithm and Harmony Search Algorithm (GA, TLBO and HS). This segment of the research constitutes of two parts the first emphasises on the outcome of the five simulation algorithms and then identifies the best, while the second part is about comparing the best with the search algorithm work in 2009, the applicability of BAT Algorithm and Gravitational Search Algorithm (GSABAT) to planning problems, the technique used for calculating master production scheduling, and the very important results and recommendations for future studies
This paper proposes a completion that can allow fracturing four zones in a single trip in the well called “Y” (for confidential reasons) of the field named “X” (for confidential reasons). The steps to design a well completion for multiple fracturing are first to select the best completion method then the required equipment and the materials that it is made of. After that, the completion schematic must be drawn by using Power Draw in this case, and the summary installation procedures explained. The data used to design the completion are the well trajectory, the reservoir data (including temperature, pressure and fluid properties), the production and injection strategy. The results suggest that multi-stage hydraulic fracturing can
... Show MoreThe conventional procedures of clustering algorithms are incapable of overcoming the difficulty of managing and analyzing the rapid growth of generated data from different sources. Using the concept of parallel clustering is one of the robust solutions to this problem. Apache Hadoop architecture is one of the assortment ecosystems that provide the capability to store and process the data in a distributed and parallel fashion. In this paper, a parallel model is designed to process the k-means clustering algorithm in the Apache Hadoop ecosystem by connecting three nodes, one is for server (name) nodes and the other two are for clients (data) nodes. The aim is to speed up the time of managing the massive sc
... Show MoreIrrigation scheduling techniques is one of the suggested solutions for water scarcity problem. The study aims to show the possibility of using practical and applicable irrigation scheduling program which was designed by Water Resources Department at the University of Baghdad by using Spreadsheet Formulas for Microsoft Excel program, version 2007, with some modification to generalize it and made it applicable to various climatic zone and different soil types, as a salvation for the shortage of irrigation water inside the irrigation projects. Irrigation projects which incidence of Tigris River basin will be taken as an applicable example. This program was based on water budgeting and programmed depending on scientific concepts which facili
... Show MoreMining association rules is a popular and well-studied method of data mining tasks whose primary aim is the discovers of the correlation among sets of items in the transactional databases. However, generating high- quality association rules in a reasonable time from a given database has been considered as an important and challenging problem, especially with the fast increasing in database's size. Many algorithms for association rules mining have been already proposed with promosing results. In this paper, a new association rules mining algorithm based on Bees Swarm Optimization metaheuristic named Modified Bees Swarm Optimization for Association Rules Mining (MBSO-ARM) algorithm is proposed. Results show that the proposed algorithm can
... Show MoreThis paper presents a comparative study of two learning algorithms for the nonlinear PID neural trajectory tracking controller for mobile robot in order to follow a pre-defined path. As simple and fast tuning technique, genetic and particle swarm optimization algorithms are used to tune the nonlinear PID neural controller's parameters to find the best velocities control actions of the right wheel and left wheel for the real mobile robot. Polywog wavelet activation function is used in the structure of the nonlinear PID neural controller. Simulation results (Matlab) and experimental work (LabVIEW) show that the proposed nonlinear PID controller with PSO
learning algorithm is more effective and robust than genetic learning algorithm; thi
The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.
The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.
The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man
... Show More