scholarly journals The optimization of distribution and transportation costs for common good products

2020 ◽  
Vol 1 (2) ◽  
pp. 111
Author(s):  
Fibi Eko Putra ◽  
Humiras Hardi Purba ◽  
Indah Astri Anggraeni
Keyword(s):  
Cost Reduction ◽  
Common Good ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Distribution Model ◽  
Transportation Problems ◽  
Stepping Stone ◽  
North West ◽  
Long Time ◽  
Single Method

Transportation problems, which concerned in finding the minimum cost of transporting a single commodity from a given number of sources to a given number of destinations, are an integral part of the industrial system that has been around for a long time. The number of potential losses caused by transportation problems has made many parties take initiatives and efforts to solve those problems, usually by designing an optimal distribution model. The current study employs two methods named North West Corner (NWC) and Stepping Stone (SS) method in order to find distribution model with the most optimal costs for common good products. Through this research, the NWC method is utilized to generate initial model or solution, while the SS method is used afterward to find the optimal solution. According to it scheme, the result shows that through the NWC method there was cost reduction of $ 8,301, while the distribution model obtained from the Stepping Stone method resulted in a significant cost increased of $ 307,369. Thus, it can be concluded that the use of single method, namely NWC method, in this study provides much better results than using the combined NWC and Stepping Stone method.

scholarly journals Least-looping stepping-stone-based ASM approach for transportation and triangular intuitionistic fuzzy transportation problems

2021 ◽  
Author(s):  
Kedar Nath Das ◽  
Rajeev Das ◽  
Debi Prasanna Acharjya
Keyword(s):  
Optimal Solution ◽  
Transportation Engineering ◽  
Key Factors ◽  
Solution Quality ◽  
Transportation Problems ◽  
Stepping Stone ◽  
Intuitionistic Fuzzy ◽  
Real World Problem ◽  
Statistical Results ◽  
Made In

AbstractTransportation problem (TP) is a popular branch of Linear Programming Problem in the field of Transportation engineering. Over the years, attempts have been made in finding improved approaches to solve the TPs. Recently, in Quddoos et al. (Int J Comput Sci Eng (IJCSE) 4(7): 1271–1274, 2012), an efficient approach, namely ASM, is proposed for solving crisp TPs. However, it is found that ASM fails to provide better optimal solution in some cases. Therefore, a new and efficient ASM appoach is proposed in this paper to enhance the inherent mechanism of the existing ASM method to solve both crisp TPs and Triangular Intuitionistic Fuzzy Transportation Problems (TIFTPs). A least-looping stepping-stone method has been employed as one of the key factors to improve the solution quality, which is an improved version of the existing stepping-stone method (Roy and Hossain in, Operation research Titus Publication, 2015). Unlike stepping stone method, least-looping stepping-stone method only deals with few selected non-basic cells under some prescribed conditions and hence minimizes the computational burden. Therefore, the framework of the proposed method (namely LS-ASM) is a combination of ASM (Quddoos et al. 2012) and least-looping stepping-stone approach. To validate the performance of LS-ASM, a set of six case studies and a real-world problem (those include both crisp TPs and TIFTPs) have been solved. The statistical results obtained by LS-ASM have been well compared with the existing popular modified distribution (MODI) method and the original ASM method, as well. The statistical results confirm the superiority of the LS-ASM over other compared algorithms with a less computationl effort.

scholarly journals A PIONEERING AND COMPREHENSIVE DATABASE OF BALANCED AND UNBALANCED TRANSPORTATION PROBLEMS FOR READY PERFORMANCE EVALUATION OF EXISTING AND NEW METHODS

2020 ◽  
Vol 15 (11) ◽  
Author(s):  
Huzoor Bux Kalhoro
Keyword(s):  
Performance Evaluation ◽  
Optimal Solution ◽  
Test Problems ◽  
Optimal Solutions ◽  
Transportation Problems ◽  
North West ◽  
New Methods ◽  
Comprehensive Database ◽  
Solution Methods ◽  
Data Tables

In this paper, we present a comprehensive database of the data tables of some important transportation problems from literature, and experience with the proposition of new initial basic feasible (IBF) solution methods for the transportation problems. The paper contains a comprehensive database of 140 transportation problems, of which 103 are balanced, 25 are unbalanced and 12 are from research papers. The detailed description of the varying-nature test problems is described, and the optimal solutions of the 140 problems have been obtained by using the TORA software with the modified distribution (MODI) method. The algorithms of three methods: North-West-Corner (NWCM), Least cost (LCM) and Vogel’s approximation (VAM) have been used for IBF solutions. The final optimal results are also quoted for the ready reference of researchers and practitioners. The database of problems and their optimal solutions will be a great aid to researchers and practitioners working with the existing and new methods for solving transportation problems. A pioneering investigation of the performance evaluation of NWCM, LCM and VAM has also been conducted as a benchmark for the similar assessment of other existing and forthcoming IBF and /or optimal solution methods for the transportation problems.

scholarly journals A New Neuroinformatics Approach to Optimize Diagnosis Cost in Neurology: An Operational Research Tool

2019 ◽  
Vol 15 (06) ◽  
pp. 31
Author(s):  
Mohammad Rashid Hussain ◽  
Mohammad Equebal Hussain
Keyword(s):  
Operational Research ◽  
Treatment Cost ◽  
Cost Optimization ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Healthcare Management ◽  
Research Tool ◽  
Management Decision ◽  
Optimization Approach ◽  
North West

<p>Cost optimization approach of operational research is a predictive power and economy of compactness that is applied to solve specific clinical needs relevant to healthcare cost reduction. Technology helps the healthcare management, decision making, and policy that we have implemented in the interest of improving quality of patient care and treatment outcomes, thereby reducing costs and improving efficiency. The treatment cost of brain tumor is high. Sometimes, cost becomes a problem for individuals to get their complete treatment, which makes their health at risk and may lead to higher cost in future. Here we address neuroinformatics approach to optimize diagnosis cost in neurology through an operational research tool (optimization) on how the diagnosis cost of neuro-patient can optimize. In this context, we introduce a new and unique optimization approach in healthcare, yet what we are clearly lacking for applying applications of operational tools to translate this understanding to the different level to apply the concept in healthcare. The costs of treatment achieved by three standard initial basic feasible solutions (IBFS) methods (North-west corner method, Minimum cost method, Vogel’s approximation method) are 763, 763, and 779. The optimal solution is 761, and three random tests (RT’s) are 826, 783, and 788. Optimal solution provided an overall difference in treatment cost with IBFS 2, 2, 18 and with RT’s 65, 22, and 27. These results establish the basis for a deliberate integration of operational research tools and neuroscience into diagnosis of cost optimization mechanisms for neuro- patient.</p>

scholarly journals Sorting Out Fuzzy Transportation Problems via ECCT and Standard Deviation

2021 ◽  
Vol 12 (2) ◽  
pp. 1-14
Author(s):  
Krishna Prabha Sikkannan ◽  
Vimala Shanmugavel
Keyword(s):  
Standard Deviation ◽  
Approximation Method ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
New Method ◽  
Transportation Problems ◽  
North West ◽  
Numerical Example ◽  
Optimum Solution ◽  
Better Than

A well-organized arithmetical procedure entitled standard deviation is employed to find the optimum solution in this paper. This technique has been divided into two parts. The first methodology deals with constructing the entire contingency cost table, and the second deals with optimum allocation. In this work, the method of magnitude is used for converting fuzzy numbers into crisp numbers as this method is better than the existing methods. This technique gives a better optimal solution than other methods. A numerical example for the new method is explained, and the authors compared their method with existing methods such as north west corner method, least cost method, and Vogel's approximation method.

scholarly journals IMPLEMENTASI KARAGUL-SAHIN APPROXIMATION METHOD UNTUK MEMINIMALISASI BIAYA PENDISTRIBUSIAN AIR PADA MASALAH TRANSPORTASI

2021 ◽  
Vol 5 (1) ◽  
pp. 46-53
Author(s):  
Sri Basriati ◽  
Elfira Safitri ◽  
Dinda Kurniyawan Nusantoro
Keyword(s):  
Approximation Method ◽  
Water Distribution ◽  
Optimal Solution ◽  
Cost Savings ◽  
Minimum Cost ◽  
Basic Feasible Solution ◽  
Stepping Stone ◽  
Level Of Satisfaction ◽  
The Cost ◽  
Made In

Transportation problems such as transportation activities and allocation to reach consumers is one of the factors that determine the level of satisfaction. To find the level of customer satisfaction, it requires an appropriate and efficient transportation model. One of which is in the Air Minum Mata Air Sikumbang business owned by Mr. Zulfikar, located in Rumbio, Kampar. Based on the results of the study the cost of distributing drinking water is still not efficient because it still uses estimation and there is no separate technique used to allocate water distribution. The solution made in this study using the Karagul-Sahin Approximation Method for the initial basic feasible solution and Stepping Stone for the optimal solution value so as to obtain the distribution of water at a minimum cost. Based on research using the method of  Karagul-Sahin Approximation and Stepping Stone, a weekly cost savings of Rp.469.515,00 is obtained.

scholarly journals Kajian Tentang Metode Zero Suffix Menggunakan Teknik Robust Ranking Pada Masalah Transportasi Dengan Variabel Fuzzy

2018 ◽  
Vol 1 (1) ◽  
pp. 016-023
Author(s):  
Siti Ramadhani ◽  
Ujian Sinulingga ◽  
Esther Nababan
Keyword(s):  
Everyday Life ◽  
Fuzzy Numbers ◽  
Optimal Solution ◽  
Minimum Cost ◽  
Transportation Costs ◽  
Transportation Problems ◽  
Fuzzy Variables ◽  
Ranking Technique ◽  
Reduction Of Costs

Permasalahan transportasi merupakan permasalahan yang sering terjadi dalam kehidupan sehari-hari. Masalah transportasi dengan jumlah supply, jumlah demand, dan biaya angkutannya dinyatakan dengan bilangan fuzzy disebut sebagai masalah transportasi fuzzy. Dalam menyelesaikan masalah transportasi fuzzy, tabel fuzzy harus diubah terlebih dahulu ke bentuk linier agar lebih mudah dalam mengerjakannya.Teknik Robust Ranking merupakan suatu teknik yang digunakan untuk mengubah masalah transportasi fuzzy menjadi permasalahan transportasi linier. Untuk mencari solusi yang optimal metode yang digunakan untuk menyelesaikan masalah transportasi dengan variabel fuzzy adalah metode Zero Suffix. Metode Zero Suffix dimulai dengan pengurangan biaya di dalam tablo baris dengan biaya yang paling minimum pada baris, kemudian dilanjutkan pengurangan biaya di dalam tablo kolom dengan biaya paling minimum pada kolom. Selanjutnya mencari suffix value dari masing-masing kolom, dengan memilih suffix value terbesar. Dilanjutkan memilih biaya nol pada tablo transportasi lalu memilih minimum dari permintaan dan persediaan dilanjutkan mengalokasikannya ke dalam tablo. Pencarian suffix value ini tetap berlanjut sampai semua baris dan kolom sudah jenuh. Transportation problems are issues that often occur in everyday life. The problem of transportation with the amount of supply, number of demand, and transportation costs expressed by fuzzy numbers is referred to fuzzy transportation problems. In solving fuzzy transportation problems, fuzzy tables must be changed first to linear shapes so that they are easier to do. Robust ranking technique is a technique used to convert fuzzy transportation problems into linear transportation problems. To find the optimal solution, the Zero Suffix method was used to solve transportation problems with fuzzy variables. The Zero Suffix method started with the reduction of costs in the table row with the minimum cost in the row, then continued to reduce costs in the table column with the minimum cost in the column. Subsequently, it looked for the suffix value of each column, by selecting the largest suffix value. It proceeded to choose zero costs for the transportation tableau, chose the minimum of the demand and the inventory, and then continued to allocate it to the tableau. Searching for the suffix value continued until all rows and columns were saturated. 

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.

OPTIMASI BIAYA TRANSPORTASI USAHA KELAUTAN : STUDI KASUS UDX KECAMATAN LABUHAN MARINGGAI

2020 ◽  
Vol 4 (2) ◽  
Author(s):  
Alfan Juli Andri ◽  
Keyword(s):  
Minimum Cost ◽  
Transportation Problems ◽  
Distribution Costs ◽  
Shipping Cost

Abstract As a maritime country, Indonesia is given an abundance of marine wealth. In an effort to distribute fish from sea products, fishermen in Labuhan Maringgai District, East Lampung Regency collect their prey to Usaha Dagang X (UDX). UDX has 3 main ordering partners for 3 categories of seafood, namely shrimp, fish and crab. Transportation problems at UDX cause distribution costs to increase in delivery of goods to the customer. This study provides an alternative minimum cost solution that can be issued by UDX in distributing goods that are available using existing limitations. The results showed that the minimum shipping cost was IDR 5281200 where the 3 proposed methods showed the same results but had different alternative options.

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution

2021 ◽  
Author(s):  
José Correa ◽  
Paul Dütting ◽  
Felix Fischer ◽  
Kevin Schewior
Keyword(s):  
Stopping Time ◽  
Random Variables ◽  
Optimal Solution ◽  
Random Order ◽  
Secretary Problem ◽  
Maximum Value ◽  
Optimal Stopping Theory ◽  
Long Time ◽  
Object Of Study ◽  
Independent And Identically Distributed

A central object of study in optimal stopping theory is the single-choice prophet inequality for independent and identically distributed random variables: given a sequence of random variables [Formula: see text] drawn independently from the same distribution, the goal is to choose a stopping time τ such that for the maximum value of α and for all distributions, [Formula: see text]. What makes this problem challenging is that the decision whether [Formula: see text] may only depend on the values of the random variables [Formula: see text] and on the distribution F. For a long time, the best known bound for the problem had been [Formula: see text], but recently a tight bound of [Formula: see text] was obtained. The case where F is unknown, such that the decision whether [Formula: see text] may depend only on the values of the random variables [Formula: see text], is equally well motivated but has received much less attention. A straightforward guarantee for this case of [Formula: see text] can be derived from the well-known optimal solution to the secretary problem, where an arbitrary set of values arrive in random order and the goal is to maximize the probability of selecting the largest value. We show that this bound is in fact tight. We then investigate the case where the stopping time may additionally depend on a limited number of samples from F, and we show that, even with o(n) samples, [Formula: see text]. On the other hand, n samples allow for a significant improvement, whereas [Formula: see text] samples are equivalent to knowledge of the distribution: specifically, with n samples, [Formula: see text] and [Formula: see text], and with [Formula: see text] samples, [Formula: see text] for any [Formula: see text].

scholarly journals Optimasi Biaya Distribusi Barang dengan Menggunakan Model Transportasi

2021 ◽  
Vol 3 (1) ◽  
pp. 1-9
Author(s):  
Irvana Arofah ◽  
Nianty Nandasari Gesthantiara
Keyword(s):  
Approximation Method ◽  
Stepping Stone ◽  
North West

Model transportasi merupakan suatu model yang dapat digunakan untuk menentukan pengalokasian barang yang paling efektif dari suatu sumber ke suatu tujuan dengan biaya yang seminimum mungkin. Wira Shoes adalah salah satu usaha dagang yang begerak di bidang industri. Usaha ini memproduksi sepatu yang dikirim sesuai dengan permintaan masing – masing distribusi. Penelitian ini bertujuan untuk mengetahui apakah model transportasi dapat meminimumkan biaya distribusi. Metode sudut barat laut (North-West Corner/ NWC), biaya terendah (Least Cost/ LC), dan Vogel’s Approximation Method (VAM) yang merupakan solusi awal serta metode modified distribution (MODI) dan stepping stone (batu loncatan) yang merupakan solusi optimal adalah metode yang digunakan dalam penelitian ini. Dari pehitungan yang telah dilakukan, diperoleh biaya minimum sebesar Rp 8.400.000,-.

Sign in / Sign up

Export Citation Format

Share Document