OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

scholarly journals Sensitivity Analysis of Road Freight Transportation of a Mega Non-Alcoholic Beverage Industry

2020 ◽  
Vol 24 (3) ◽  
pp. 449-454
Author(s):  
T. Latunde ◽  
J.O. Richard ◽  
O.O. Esan ◽  
O.O. Dare
Keyword(s):  
Sensitivity Analysis ◽  
Alcoholic Beverage ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Demand And Supply ◽  
North West ◽  
The North ◽  
Beverage Industry ◽  
Road Freight ◽  
Road Freight Transportation

Re-optimization can be very costly for gathering and obtaining more data for a particular problem, to curb this very expensive investment.  Sensitivity analysis has been used in this work to determine the behaviour of input parameters of the formulated problem. The main goal of the study is to respectively provide, derive, observe, compare and discuss the sensitivity analysis of data that has been optimized using different methods of the optimal solution. The best method, saving the highest percentage of transportation cost, for the formulated problem is determined to be the North-West Corner method. This was carried out by arbitrarily assigning values to the available warehouses to determine the best possible demand and supply cases rather than the initial cases. Thus, more cases are advised to be supplied to FID from the Asejire plant for the optimum reduced value of transportation cost. Keywords: Sensitivity, Parameters, Transportation Problem.

Trapezoidal fuzzy model to optimize transportation problem

2016 ◽  
Vol 07 (03) ◽  
pp. 1650028 ◽  
Author(s):  
Nirbhay Mathur ◽  
Pankaj Kumar Srivastava ◽  
Ajit Paul
Keyword(s):  
Transportation Problem ◽  
Fuzzy Numbers ◽  
Fuzzy Model ◽  
Optimal Solution ◽  
Transportation Cost ◽  
New Method ◽  
Trapezoidal Fuzzy Numbers ◽  
North West ◽  
Fuzzy Environment ◽  
Practical Usefulness

The main aim of this paper is to develop an approach based on trapezoidal fuzzy numbers to optimize transportation problem in fuzzy environment. The present algorithm has representation of availability, demand and transportation cost as trapezoidal fuzzy numbers. This algorithm is found quicker in terms of runtime as comparison to fuzzy VAM discussed in [Kaur A., Kumar A., A new method for solving fuzzy transportation problem using ranking function, Appl. Math. Model. 35:5652–5661, 2011; Ismail Mohideen S., Senthil Kumar P., A comparative study on transportation problem in fuzzy environment, Int. J. Math. Res. 2:151–158, 2010]. On the other hand this technique gives much better results than some classical methods like north-west corner and least cost method. Another benefit of this algorithm is that for certain transportation problems it directly gives optimal solution. It is one of the simplest methods to apply and perceive. Practical usefulness of the new method over other existing methods is demonstrated with two numerical examples.

Transportation Problem in Neutrosophic Environment

2020 ◽  
pp. 180-212 ◽  
Author(s):  
Jayanta Pratihar ◽  
Ranjan Kumar ◽  
Arindam Dey ◽  
Said Broumi
Keyword(s):  
Linear Programming ◽  
Fuzzy Set ◽  
Transportation Problem ◽  
Intuitionistic Fuzzy Set ◽  
Real Life ◽  
Neutrosophic Set ◽  
Neutrosophic Sets ◽  
North West ◽  
Life Problems ◽  
The Cost

The transportation problem (TP) is popular in operation research due to its versatile applications in real life. Uncertainty exists in most of the real-life problems, which cause it laborious to find the cost (supply/demand) exactly. The fuzzy set is the well-known field for handling the uncertainty but has some limitations. For that reason, in this chapter introduces another set of values called neutrosophic set. It is a generalization of crisp sets, fuzzy set, and intuitionistic fuzzy set, which is handle the uncertain, unpredictable, and insufficient information in real-life problem. Here consider some neutrosophic sets of values for supply, demand, and cell cost. In this chapter, extension of linear programming principle, extension of north west principle, extension of Vogel's approximation method (VAM) principle, and extended principle of MODI method are used for solving the TP with neutrosophic environment called neutrosophic transportation problem (NTP), and these methods are compared using neutrosophic sets of value as well as a combination of neutrosophic and crisp value for analyzing the every real-life uncertain situation.

scholarly journals ESTIMATED TRANSPORTATION COST OF LOW-TONNAGE LNG

2020 ◽  
Vol 17 (5) ◽  
pp. 130-163
Author(s):  
O. V. Tarovik ◽  
O. M. Mudrova
Keyword(s):  
Coastal Waters ◽  
Unit Cost ◽  
Transportation Cost ◽  
Model Calculations ◽  
Inland Waterways ◽  
Universal Approach ◽  
Environmental Requirements ◽  
Regression Relations ◽  
The Cost ◽  
Cost Of Transportation

Demand for low-tonnage transportation of LNG requires improved logistics. Assessing the value of all parts of the supply chain is an important component of solving the problem of optimizing transportation costs for both consumers and LNG suppliers. In connection with tightening of environmental requirements regarding bunker fuel, the task of optimizing the supply of LNG for water transport by the cost of transportation becomes particularly relevant.The objective of the study is to develop a universal approach to estimating the cost of transporting low-tonnage LNG for bunkering vessels in the Russian Federation.The research methodology is focused on the analytical method based on a system-structural approach.As part of the departmental project of the Russian Ministry of Industry and Trade «Development of  gaspowered fleet for navigation in coastal waters and inland waterways», the authors developed technical and economic models for calculating the unit cost of LNG transportation by road and water. To calculate the unit cost of LNG transportation by rail, the data of TMkarta information and reference system were used. Based on model calculations and data of TMkarta system, regression relations were obtained that allow one to determine the cost of transportation for various options of transport and technological schemes based on a limited set of parameters. An approach has also been proposed for estimating the cost of LNG transshipment. The regression ratios were tested for selected routes. As a result,conclusions were drawn about the most effective LNG transportation options.

Solving Solid Transportation Problems With Multi-Choice Cost and Stochastic Supply and Demand

2018 ◽  
pp. 137-170 ◽  
Author(s):  
Sankar Kumar Roy ◽  
Deshabrata Roy Mahapatra
Keyword(s):  
Stochastic Programming ◽  
Objective Function ◽  
Transportation Problem ◽  
Supply And Demand ◽  
Optimal Solution ◽  
Programming Approach ◽  
Solid Transportation Problem ◽  
New Approach ◽  
Non Linear Programming ◽  
The Cost

In this chapter, the authors propose a new approach to analyze the Solid Transportation Problem (STP). This new approach considers the multi-choice programming into the cost coefficients of objective function and stochastic programming, which is incorporated in three constraints, namely sources, destinations, and capacities constraints, followed by Cauchy's distribution for solid transportation problem. The multi-choice programming and stochastic programming are combined into a solid transportation problem, and this new problem is called Multi-Choice Stochastic Solid Transportation Problem (MCSSTP). The solution concepts behind the MCSSTP are based on a new transformation technique that will select an appropriate choice from a set of multi-choice, which optimize the objective function. The stochastic constraints of STP converts into deterministic constraints by stochastic programming approach. Finally, the authors construct a non-linear programming problem for MCSSTP, and by solving it, they derive an optimal solution of the specified problem. A realistic example on STP is considered to illustrate the methodology.

scholarly journals Multiobjective Scheduling of Remote-Area Employees with Minimum Cost of Transportation

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Hesham K. Alfares
Keyword(s):  
Programming Model ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Solution Procedure ◽  
Primary Objective ◽  
Remote Work ◽  
Optimal Procedures ◽  
Oil Company ◽  
Cost Of Transportation

An integer programming model and optimal solution procedure are presented for assigning employees to the (10, 14) days-off schedule. This schedule is used by a large oil company to schedule employees in remote work locations. The primary objective is to minimize the total number of employees. Since employees are flown to their remote work sites, the company also aims to minimize transportation cost. Therefore, secondary objectives include (1) minimizing the number of active days-off work patterns, (2) consistently using the same set of active days-off patterns, (3) assigning work schedules fairly among employees, and (4) avoiding the use of specialized optimization solvers. A rotation schedule is used in which two scheduling rules are enforced: a minimum proportion of weekend days off needs to be given and a maximum limit on the number of successive workdays cannot be exceeded. Utilizing the problem structure, simple optimal procedures are developed to solve this unique complex scheduling problem.

scholarly journals A NEW APPROACH TO FIND THE INITIAL BASIC FEASIBLE SOLUTION OF A TRANSPORTATION PROBLEM

2018 ◽  
Vol 6 (5) ◽  
pp. 321-325 ◽  
Author(s):  
Ravi Kumar R ◽  
Radha Gupta ◽  
Karthiyayini O
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
Cost Minimization ◽  
Optimization Technique ◽  
Transportation Cost ◽  
Basic Feasible Solution ◽  
Standard Methods ◽  
North West ◽  
A New Technique ◽  
Optimum Solution

Transportation problem (TP) in operations research is a widely used optimization technique to study the problems concerned with transporting goods from production places to sale points. The TP may have one or more objectives such as minimization of transportation cost, minimization of distance with respect to time, and so on. There is a systematic method to solve such problems. For this, we find the Initial Basic Feasible Solution (IBFS) to the given problem. North West corner method, least cost method, Vogel’s approximation method are the standard methods one uses to find the IBFS.  In recent years, there are several other methods are proposed to solve such problems. In this paper, we propose a new technique named as Direct Sum Method (DSM) and its effectiveness is compared with the standard methods. The result shows that it is easy to compute and near to the optimum solution of the problem.

A Decision-Making Tool for the Optimization of Empty Containers' Return in the Liner Shipping: Optimization by Using the Genetic Algorithm

2018 ◽  
Vol 10 (3) ◽  
pp. 39-56
Author(s):  
Naima Belayachi ◽  
Fouzia Amrani ◽  
Karim Bouamrane
Keyword(s):  
Decision Making ◽  
Lower Cost ◽  
Optimal Solution ◽  
Maritime Transportation ◽  
Initial Population ◽  
Transportation Sector ◽  
Empty Containers ◽  
Feasible Solutions ◽  
The Cost ◽  
Decision Making Tool

This article describes how in the maritime transportation sector, containerization represents one of the most remarkable improvements. In fact, the different shipping companies provide great efforts, whose purpose is to reduce the cost of this transport. However, these companies are facing a problem of empty containers, which are not available at some ports of Maritime Transport Network (MTN) to meet the clients' demands. This problem is simply a consequence of the imbalance in the distribution of containers through the MTN due to the set of containers that do not return to the origin port. This work offers a decision-making tool to this problem by proposing an optimal return of empty containers. The proposed application is based on evolutionary heuristics. Its principle is to find an optimal solution from a set of several feasible solutions generated during an initial population in order to enable the search of empty containers at lower cost.

scholarly journals Stability of Solutions for Parametric Inverse Nonlinear Cost Transportation Problem

Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 2027
Author(s):  
Abd Allah A. Mousa ◽  
Yousria Abo-Elnaga
Keyword(s):  
Nonlinear Programming ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Optimal Solution ◽  
Solution Stability ◽  
Tuning Parameters ◽  
Input Parameters ◽  
Feasible Alternative ◽  
The Stability ◽  
The Cost

This paper investigates the solution for an inverse of a parametric nonlinear transportation problem, in which, for a certain values of the parameters, the cost of the unit transportation in the basic problem are adapted as little as possible so that the specific feasible alternative become an optimal solution. In addition, a solution stability set of these parameters was investigated to keep the new optimal solution (feasible one) is unchanged. The idea of this study based on using a tuning parameters λ∈Rm in the function of the objective and input parameters υ∈Rl in the set of constraint. The inverse parametric nonlinear cost transportation problem P(λ,υ), where the tuning parameters λ∈Rm in the objective function are tuned (adapted) as less as possible so that the specific feasible solution x∘ has been became the optimal ones for a certain values of υ∈Rl, then, a solution stability set of the parameters was investigated to keep the new optimal solution x∘ unchanged. The proposed method consists of three phases. Firstly, based on the optimality conditions, the parameter λ∈Rm are tuned as less as possible so that the initial feasible solution x∘ has been became new optimal solution. Secondly, using input parameters υ∈Rl resulting problem is reformulated in parametric form P(υ). Finally, based on the stability notions, the availability domain of the input parameters was detected to keep its optimal solution unchanged. Finally, to clarify the effectiveness of the proposed algorithm not only for the inverse transportation problems but also, for the nonlinear programming problems; numerical examples treating the inverse nonlinear programming problem and the inverse transportation problem of minimizing the nonlinear cost functions are presented.

scholarly journals Optimization of total transportation cost

2020 ◽  
Vol 26 (1) ◽  
pp. 57-63
Author(s):  
Adamu Isah Kamba ◽  
Suleiman Mansur Kardi ◽  
Yunusa Kabir Gorin Dikko
Keyword(s):  
Transportation Problem ◽  
Research Work ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Strategic Decision ◽  
Distribution Method ◽  
North West ◽  
Total Transportation Cost ◽  
Transportation Schedule ◽  
Furniture Factory

In this research work, the study used transportation problem techniques to determine minimum cost of transportation of Gimbiya Furniture Factory using online software, Modified Distribution Method (MODI). The observation made was that if Gimbiya furniture factory, Birnin Kebbi could apply this model to their transportation schedule, it will help to minimize transportation cost at the factory to ₦1,125,000.00 as obtained from North west corner method, since it was the least among the two methods, North west corner method and Least corner method. This transportation model willbe useful for making strategic decision by the logistic managers of Gimbiya furniture factory, in making optimum allocation of the production from the company in Kebbi to various customers (key distributions) at a minimum transportation cost. Keywords: North West corner, Least corner, Transportation problem, minimum transportation.

Sign in / Sign up

Export Citation Format

Share Document