Do you want to publish a course? Click here

Optimization Of Earthmoving Problem With Multiple Soil Types Using Linear Programing

أمثلة مسألة توزيع الكتل الترابية متعددة الأنواع باستخدام البرمجة الخطية

1205   0   71   0 ( 0 )
 Publication date 2016
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

Earthmoving is the process of moving and processing soil from one location to another to alter an existing land surface into a desired configuration. Highways, dams, and airports are typical examples of heavy earthmoving projects. Over the years, construction managers have devised ways to determine the quantities of material to be moved from one place to another. Various types of soil (soft earth, sand, hard clay, …, etc.) create different level of difficulty of the problem. Earthmoving problem has traditionally been solved using mass diagram method or variety of operational research techniques. However, existing models do not present realistic solution for the problem. Multiple soil types are usually found in cut sections and specific types of soil are required in fill sections. Some soil types in cut sections are not suitable to be used in fill sections and must be disposed of. In this paper a new mathematical programming model is developed to find-out the optimum allocation of earthmoving works. In developing the proposed model, different soil types are considered as well as variation of unit cost with earth quantities moved. Suggested borrow pits and/or disposal sites are introduced to minimize the overall earthmoving cost. The proposed model is entirely formulated using the programming capabilities of VB6 while LINDO is used to solve the formulated model to get the optimum solution. An example project is presented to show how the developed model can be implemented.

References used
BRENTWOD, T. B. C., and WEBER. S. L. (1999). “Effect of Truck Payload Weight on Production.” J. of Construction Engrg. and Mngt., ASCE, 125(1), 1-7
EASA, S. M. (1987). “Earthwork Allocations with Nonconstant Unit Costs.” J. of Construction Engrg. and Mngt., ASCE, 113(1), 34-50
JARAD. F. (2002). “Analysis of Earthmoving Systems by Optimization.” Faculty of Engineering, Alexandria University, Egypt
rate research

Read More

Linear programming (LP, or linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polyhedron, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this function has the smallest (or largest) value if such a point exists.
This paper presents a method for finding online adaptive optimal controllers for continuous-time linear systems without knowing the system dynamical matrices. The proposed method employs one of Intelligent Operations Research Techniques, this tech nique is the adaptive dynamic programming, to iteratively solve the algebraic Riccati equation using the online information of state and input, without requiring the a priori knowledge of the system dynamics. In addition, all iterations can be conducted by using repeatedly the same state and input information on some fixed time intervals. A practical online algorithm is developed in this paper, and is applied to the controller design for a turbocharged diesel engine with exhaust gas recirculation.
In this paper we offer a new interactive method for solving Multiobjective linear programming problems. This method depends on forming the model for reducing the relative deviations of objective functions from their ideal standard, and dealing with the unsatisfying deviations of objective functions by reacting with decision maker. The results obtained from using this method were compared with many interactive methods as (STEM Method[6] – Improvement STEM Method[7] – Matejas-peric Method[8]). Numerical results indicate that the efficiency of purposed method comparing with the obtained results by using that methods at initial solution point and the other interactive points with decision maker.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا