Professional Documents
Culture Documents
ISSN No:-2456-2165
Abstract:- Most industrial and service organizations now putting sustainable transportation planning and policy into
include transportation logistics and management in their practice was examined in [3]. Three main issues: forecast-
business decision making process. The cost of led vs vision-led planning, congestion relief, and public
transportation and the distribution of goods from acceptance were considered. The study concluded that the
manufacturing facilities to depots raise transportation goal of lowering car use is at odds with the ongoing
costs, which will ultimately have an impact on the selling investment in expanding road capacity and switching from
price of the product and will then directly or indirectly forecast-led planning to back casting is challenging.
affect final consumers. Several academic publications Mishera[2] asserted that the transportation issue is regarded
had proposed linear programming transportation as being of the utmost importance and has been investigated
models for transport logistics problems. Thispaper, in a number of operational and research fields. It has
models and assesses the performance of the Vogel therefore been used to simulate a variety of issues from real
Approximation and North West Corner transportation life. The transportation problem is focused on the optimal
models on the logistics of optimal distribution bags of distribution of units of a product from various points of
cement of Dangote Cement Company Plc, Nigeria, from origin to various destinations
some cement facilities, to various depots while
minimizing transportation cost. The outcome of this A. Network flow programming
study demonstrated a considerable decrease on the A model that is a particular instance of the more general
transportation cost of the distribution of the product to linear problem is referred to as a "network flow program."
various depots as well as simple distribution from plants The transportation problem, assignment problem, maximum
to depots. The Vogel Approximation model showed a flow problem, pure minimum cost flow problem, and
slight improvement on distribution cost reduction by generalized minimum cost flow problem are only a few
eight thousand, three hundred naira compared to the examples of the problems that fall within the categories of
North-West Corner Rule. At the conclusion of the study, network flow programs. The model representation is
recommendations were given. substantially more compact than the general linear problem,
and many elements of real-world situations are easily
Keywords:- Vogel Approximation, North West Corner, recognized, making it an essential class. We frequently
Transportation Model, Optimal Distribution, Dangote encounter unique linear programming issues with a fairly
Cement. straightforward structure, and the transportation issue
dominates this category. The study of ideal transportation
I. INTRODUCTION and resource allocation is known as transportation theory in
Planning for sustainable mobility and management of both mathematics and economics. Although Tolstoi was one
transportation are essential for manufacturing and service of the first to examine the transportation problem
provider businesses. In terms of effectiveness and theoretically in the 1920s, the problem was formalized by
environmental friendliness, a well-planned transportation the French mathematician Gaspard in 1971. For the Soviet
system has many advantages. Over the years, plant product Union's national transportation commissariat, Volume 1 of
distributions have been carried out haphazardly without the series Transportation Planning was published in 1930.
taking into account an optimal distribution pattern, which B. Transportation Model
has an impact on the cost of the commodity. A The problem is represented by the network in the Figure
transportation problem is a linear programming problem that 1. There are m sources and n destinations, each represented
involves choosing the best route to take finished product by a node. The arcs represent the routes linking the sources
from plants to different locations (depots) and moving and the destinations. Arc (𝑖, 𝑗) joining sources i to
resources from one place to another while keeping costs to a destination j carries two pieces of information: the
minimum. The objective is to minimize the cost of
transportation cost per unit, cij, and the amount shipped, 𝑥𝑖𝑗.
distribution a product from a number of sources or origins to
The amount of supply at source i is 𝑎𝑖 , and the amount of
a number of destinations [1].Transportation problem is
demand at destination j is 𝑏𝑗 .
further describedin [2]as the most important and successful
applications in the optimization), that is a special class of the
linear programming (lp) in the operation research (or).The
planners’ mental models to comprehend the difficulties in
A. Experimental Results
For effective and a well detailed transportation model we
start by showing the costs of a bag of cement which is 50kg
in some selected destinations (deports) from plants
(sources). Here, it is assumed that the cost of transportation
from plants to deports is imbedded in the cost of receiving a
bag of cement from plants.
Apply this process once more to the tableau's We proceeded to construct a transportation tableau
northwest most cell that is not located in a crossed-out row based on the costs of a bag of cement from a plant against a
or column. You will eventually reach a situation where there depot in matrix form taking into account the plants (sources)
is just one cell that can be given a value. Cross out the cell's capacities and requirements (demands) at depots
row and column and give this cell a value equal to either (destinations).
requirement. Now that a fundamental workable solution has Table 4: Tableau 1.0 - Initial Transport Matrix for Dangote
been found. Cement Company (Nigeria)
E. The Vogel Approximation Method (VAM)
This method takes costs into account in allocation. Five
steps are involved in applying this heuristic:
Step 1: Determine the difference between the lowest two
cells in all rows and columns including the dummies as
the case may be.
Step 2: Identify the row and column with the largest
difference. ties may be broken arbitrarily
Step 3: Allocate as much as possible to the lowest cost
cell in the row or column with the highest difference. if
two or more differences are equal allocate as much as
possible to the lowest cost cell in these rows or columns.
Step 4: Stop the process if all row and column The North-West Corner Rule:
requirements are met if not, go to the next step. Since the total number of demand (depot requirements)
Step 5: Recalculate the differences between the two is equal to the total estimated capacity for the 5 depots the
lowest cells remaining in all rows and columns. Any row transportation problem is balanced, hence we construct the
and column with zero supply or demand should not be initial transportation problem using the Northwest Corner
used in calculating further differences, then go to step 2. Method. There would be no need for a dummy depot. Table.
The Vogel approximation method (VAM) usually
produces an optimal or near optimal solution.
ACKNOWLEDGMENT