Transportation problems are considered as a type of operation research problems. In fact, they deal with scheduling transportation of goods from their source to delivery sites in the minimum cost.

Such problems can be solved by the available traditional methods, which include; North-West corner, Least cost and Vogel’s method. As well as if this transportation problem is considered as a linear program it can also be solved by using Simplex method

The goal of the present study is to compare different research methods to provide the optimal and minimum cost.

This study was applied to resolve a transportation problem related to land Transportation Company, w

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

The researcher studied transportation problem because it's great importance in the country's economy. This paper which ware studied several ways to find a solution closely to the optimization, has applied these methods to the practical reality by taking one oil derivatives which is benzene product, where the first purpose of this study is, how we can reduce the total costs of transportation for product of petrol from warehouses in the province of Baghdad, to some stations in the Karsh district and Rusafa in the same province. Secondly, how can we address the Domandes of each station by required quantity which is depending on absorptive capacity of the warehouses (quantities supply), And through r

The evaluation process of transportation problem required finding basic feasible solution (bfs). Represent the base of decision making process. To purpose start anther batter solution to able from decisions taking process, consider the decision making process, find (bfs) represent the standard form in linear programming (LP). Most important stage of update (bsf) stages that achieved minimum cost (the optimal solution). the goal of paper to improving & evaluation (bfs) by new procedure (proposed method) comparison with Vogel method.

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

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 opti

We have provided in this research model multi assignment  with  fuzzy function goal has been to build programming model is correct Integer Programming fogging  after removing the case from the objective function data and convert it to real data .Pascal triangular graded mean using Pascal way to the center of the triangular.

The data processing to get rid of the case fogging which is surrounded by using an Excel 2007 either model multi assignment  has been used program LNDO to reach the optimal solution, which represents less than what can be from time to accomplish a number of tasks by the number of employees on the specific amount of the Internet, also included a search on some of the

Barhi dates fruit are one of the most important date palm cultivars which are some of their properties they are mostly eaten and sold at the khalal stage when it has become yellow compared with rutab stage. At this stage the fruit loses its astringency and becomes sweet and best texture, therefore. High moisture content and rapid ripening of Barhi dates shorten their shelf life, as well the Khalal stage lasts for about 4 weeks until the ripening of the fruits begins and transfer to rutab stage. In the present study, Barhi dates packaging in the first by common air - packaging and
second by Modified atmosphere packaging, MAP A (5% O2 + 20% CO2) and MAP B (40%O2+20%CO2) and stored for 30 days at different temperatures 5 and 20 °C, re

The study deals with the issue of multi-choice linear mathematical programming. The right side of the constraints will be multi-choice. However, the issue of multi-purpose mathematical programming can not be solved directly through linear or nonlinear techniques. The idea is to transform this matter into a normal linear problem and solve it In this research, a simple technique is introduced that enables us to deal with this issue as regular linear programming. The idea is to introduce a number of binary variables And its use to create a linear combination gives one parameter was used multiple. As well as the options of linear programming model to maximize profits to the General Company for Plastic Industries product irrigation sy