UJI KEOPTIMALAN METODE KSAM UNTUK MENYELESAIKAN SOLUSI AWAL MASALAH TRANSPORTASI

Dhurun Mudhi Zayyan, Rihatul Janah, Aris Alfan
{"title":"UJI KEOPTIMALAN METODE KSAM UNTUK MENYELESAIKAN SOLUSI AWAL MASALAH TRANSPORTASI","authors":"Dhurun Mudhi Zayyan, Rihatul Janah, Aris Alfan","doi":"10.55273/jms.v1i1.75","DOIUrl":null,"url":null,"abstract":"Production activities are closely related to business actors or economic actors who must apply economic principles. It is from this principle that the optimization problem arises. This problem can be solved in various ways, one of which is linear programming. The transportation method is one of linear programming. This method is used to adjust the distribution from sources that provide the same product to the destination optimally. The method of transportation is an important component in its operations because it greatly affects the costs incurred in product distribution. The transportation method has two stages of completion, the first is determining the initial solution and the second is determining the optimal solution. KSAM is a new method formulated to solve transportation problems. The KSAM (Karagul-Sahin Approximation Method) method that was recently introduced is said to provide fairly good performance compared to other methods. From the transportation problem that is addressed in this article by comparing several methods, it is found that the KSAM method provides the best solution with a fairly large solution deviation. then this method can be used as a reference to get the optimal solution.","PeriodicalId":31765,"journal":{"name":"Jurnal Pendidikan Matematika dan Sains","volume":"126 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Pendidikan Matematika dan Sains","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55273/jms.v1i1.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Production activities are closely related to business actors or economic actors who must apply economic principles. It is from this principle that the optimization problem arises. This problem can be solved in various ways, one of which is linear programming. The transportation method is one of linear programming. This method is used to adjust the distribution from sources that provide the same product to the destination optimally. The method of transportation is an important component in its operations because it greatly affects the costs incurred in product distribution. The transportation method has two stages of completion, the first is determining the initial solution and the second is determining the optimal solution. KSAM is a new method formulated to solve transportation problems. The KSAM (Karagul-Sahin Approximation Method) method that was recently introduced is said to provide fairly good performance compared to other methods. From the transportation problem that is addressed in this article by comparing several methods, it is found that the KSAM method provides the best solution with a fairly large solution deviation. then this method can be used as a reference to get the optimal solution.
KSAM方法的优化试验,以解决早期运输问题的解决方案
生产活动与商业行为者或经济行为者密切相关,他们必须应用经济原则。最优化问题正是从这一原理产生的。这个问题可以用多种方法来解决,其中一种方法就是线性规划。运输方法是线性规划的一种。该方法用于调整从提供相同产品的源到目的地的最优分布。运输方式是其运作的重要组成部分,因为它极大地影响了产品分销所产生的成本。运输方法有两个完成阶段,第一阶段是确定初始解,第二阶段是确定最优解。KSAM是一种解决交通问题的新方法。最近推出的KSAM (Karagul-Sahin近似方法)方法与其他方法相比,据说具有相当好的性能。本文通过比较几种方法来解决运输问题,发现KSAM方法提供了具有相当大的解偏差的最佳解。该方法可作为求解最优解的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
审稿时长
5 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信