A New Approach to Solve Transportation Problems

Ahmed, Mollah Mesbahuddin; Khan, Aminur Rahman; Uddin, Md. Sharif; Ahmed, Faruque

doi:10.4236/ojop.2016.51003

Cited by 58 publications

(39 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Note that, here, the formula i deviation from the optimal result. This calculation is carried out to In addition to the above benchmark instances, we have also studied some other chosen from Ahmed [41] in order to determine the performance of our new method over the available 14 approaches. The obtained results are presented in Table4.…”

Section: Fig 6 Percentage Of Deviation Of the Resultsmentioning

confidence: 99%

A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem

Ekanayake

Perera

Daundasekara

et al. 2020

JAMCS

View full text Add to dashboard Cite

Transportation of products from sources to destinations with minimal total cost plays a key role in logistics and supply chain management. The transportation problem (TP) is an extraordinary sort of Linear Programming problem where the objective is to minimize the total cost of disseminating resources from several various sources to several destinations. Initial feasible solution (IFS) acts as a foundation of an optimal cost solution technique to any TP. Better is the IFS lesser is the number of iterations to reach the final optimal solution. This paper presents a meta-heuristic algorithm, modified ant colony optimization algorithm (MACOA) to attain an IFS to a Transportation Problem. The proposed algorithm is straightforward, simple to execute, and gives us closeness optimal solutions in a finite number of iterations. The efficiency of this algorithm is likewise been advocated by solving validity and applicability examples An extensive numerical study is carried out to see the potential significance of our modified ant colony optimization algorithm (MACOA). The comparative assessment shows that both the MACOA and the existing JHM are efficient as compared to the studied approaches of this paper in terms of the quality of the solution. However, in practice, when researchers and practitioners deal with large-sized transportation problems, we urge them to use our proposed MACOA due to the time-consuming computation of JHM. Therefore this finding is important in saving time and resources for minimization of transportation costs and optimizing transportation processes which could help significantly to improve the organization’s position in the market.

show abstract

Section: Fig 6 Percentage Of Deviation Of the Resultsmentioning

confidence: 99%

A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem

Ekanayake

Perera

Daundasekara

et al. 2020

JAMCS

View full text Add to dashboard Cite

show abstract

“…Pada penelitian ini, penulis menggunakan metode lain untuk menemukan solusi layak dasar suatu masalah transportasi berdasarkan metode yang dikembangkan oleh [1]. Ahmed dkk.…”

Section: Penyelesaian Masalah Transportasi Menggunakan Allocation Table Method(atm) 47unclassified

Penyelesaian Masalah Transportasi Menggunakan Allocation Table Method (Atm)

Abdi¹,

Bahri²

2021

JMU

View full text Add to dashboard Cite

Masalah transportasi merupakan salah satu kendala dari suatu perusahaan. Kendala ini adalah bagaimana cara mengirim barang dari suatu sumber ke tujuan dengan biaya yang minimum. Menemukan solusi layak dasar merupakan syarat utama untuk memperoleh solusi optimal suatu masalah transportasi. Pada tulisan ini, solusi layak dasar masalah transportasi pengangkutan semen PT. Mega Eltra Persero dari tiga sumber (Panjang, Paya Rumput, Tebing Tinggi) ke delapan tujuan (UD. Sakti, UD. Paten, UD. Utama, UD. Indomas, UD. Jecky, PT. Utama, PT. Waskita, UD. Harco) diperoleh dengan menggunakan Allocation Table Method (ATM). Dengan metode tersebut dihasilkan total biaya transportasi sebesar Rp. 751.355.000,00 (tujuh ratus lima puluh satu juta tiga ratus lima puluh lima ribu rupiah) yang mendekati solusi optimalnya yaitu Rp. 727.315.000,00 (tujuh ratus dua puluh tujuh juta tiga ratus lima belas ribu rupiah).Kata Kunci: Masalah Transportasi, Solusi layak dasar, Allocation Table Method

show abstract

“…Hasil iterasi dengan menggunakan cara ini hampir sama hasilnya dengan vogel sehingga vogel masih merupakan pendekatan yang baik dalam menyelesaikan permasalahan transportasi [5].…”

Section: Tinjauan Pustakaunclassified

Optimasi OPTIMASI BIAYA TRANSPORTASI PADA UKM DI KOTA BATAM

Sugianto¹,

Susanti²

2021

INAQUE

View full text Add to dashboard Cite

This research was conducted at UKM Jovelyn in Batam city. Jovelyn's UKM produces various kinds of cakes and is marketed in markets in Batam City. The UKM opened 4 branches and marketed its products to 7 markets in the city of Batam. Product distribution is still random and not properly regulated. This resulted in a very large transportation cost, up to 1/3 of the total production cost. This shows that product transportation is still not carried out effectively and efficiently. The transportation problem is converted into a mathematical form so that the problem can be solved by the transportation method. The transportation method aims to minimize the objective function which is a function of transportation costs. The transportation method is basically the same as the linear program where at each iteration a selection is made to enter the basic variabel and leave the basic variabel. There are several iteration methods, namely the northwest corner method, minimum cost method, genetic algorithm, Vogel's approximation method, minimum row method, Russell's approximation method and column minimum method. Previous research has shown that the Vogel's approximation method, and Russell's approximation method are more efficient and accurate. This study uses both methods and a sensitivity analysis is performed to optimize the calculation results. The sensitivity analysis aims to determine the extent to which the objective function constants and the constraint function constants can change Keywords: Transportation, Sensitivity, SME

show abstract

A New Approach to Solve Transportation Problems

Cited by 58 publications

References 5 publications

A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem

A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem

Penyelesaian Masalah Transportasi Menggunakan Allocation Table Method (Atm)

Optimasi OPTIMASI BIAYA TRANSPORTASI PADA UKM DI KOTA BATAM

Contact Info

Product

Resources

About