为解决运输问题建立数学模型,并在商业社区中以少比多的算法进行优化

Luftan Anas Zahir, Abdul Halim
{"title":"为解决运输问题建立数学模型,并在商业社区中以少比多的算法进行优化","authors":"Luftan Anas Zahir, Abdul Halim","doi":"10.36563/proceeding.v4i0.74","DOIUrl":null,"url":null,"abstract":"Mathematical modeling supports the development of the business world and the industrial world, especially in transportation (Widana, 2020). Many emerging algorithms are combined with the adoption of changes in the form of real problems modeled into mathematical problems. The modeling aims to optimize to produce the most optimal objective function value based on the formed constraints. Optimization of the mathematical model can be assisted by several optimization algorithms, such as the More for Less Algorithm. The algorithm, as a form of looping, is based on the constraint function with the specified parameters until it reaches the final objective function, namely optimization related to time and cost(Muftikhali et al., 2018). In general, it is hoped that supply and demand will be balanced in transportation. However, in reality, often in field conditions, mixed transportation problems result in non-optimal costs. The study results show that the More for Less Algorithm can provide the most optimal solution according to the allocation of factory requests to shops with the minimum cost. The dual variable matrix index is positive, so the solution to the transportation problem with mixed constraints is called optimal. The solutions obtained in the transportation case study with mixed constraint functions in the field of the Amarta Bakery industry community business are as follows:with a total cost of 580 (in units of money). Combinations - factory-to-store combinations for companies are interpreted as first factory at the first store with an allocation of 90 product units, first factory at the second shop with an allocation of 110 product units, second factory at the second shop with an allocation of 0 product units, factory the second factory at the third store with an allocation of 70 units of product, and the third factory at the third store with an allocation of 0 units of product. The number zero means that to carry out efficiency and optimization according to mixed constraints, it is necessary to make conditions where factories do not distribute to shops.","PeriodicalId":6833,"journal":{"name":"4TH INTERNATIONAL SEMINAR ON CHEMISTRY","volume":"95 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BUILDING MATHEMATICS MODELING FOR SOLVED TRANSPORTATION PROBLEMS AND OPTIMIZING WITH MORE FOR FEWER ALGORITHMS IN THE BUSINESS COMMUNITY\",\"authors\":\"Luftan Anas Zahir, Abdul Halim\",\"doi\":\"10.36563/proceeding.v4i0.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mathematical modeling supports the development of the business world and the industrial world, especially in transportation (Widana, 2020). Many emerging algorithms are combined with the adoption of changes in the form of real problems modeled into mathematical problems. The modeling aims to optimize to produce the most optimal objective function value based on the formed constraints. Optimization of the mathematical model can be assisted by several optimization algorithms, such as the More for Less Algorithm. The algorithm, as a form of looping, is based on the constraint function with the specified parameters until it reaches the final objective function, namely optimization related to time and cost(Muftikhali et al., 2018). In general, it is hoped that supply and demand will be balanced in transportation. However, in reality, often in field conditions, mixed transportation problems result in non-optimal costs. The study results show that the More for Less Algorithm can provide the most optimal solution according to the allocation of factory requests to shops with the minimum cost. The dual variable matrix index is positive, so the solution to the transportation problem with mixed constraints is called optimal. The solutions obtained in the transportation case study with mixed constraint functions in the field of the Amarta Bakery industry community business are as follows:with a total cost of 580 (in units of money). Combinations - factory-to-store combinations for companies are interpreted as first factory at the first store with an allocation of 90 product units, first factory at the second shop with an allocation of 110 product units, second factory at the second shop with an allocation of 0 product units, factory the second factory at the third store with an allocation of 70 units of product, and the third factory at the third store with an allocation of 0 units of product. The number zero means that to carry out efficiency and optimization according to mixed constraints, it is necessary to make conditions where factories do not distribute to shops.\",\"PeriodicalId\":6833,\"journal\":{\"name\":\"4TH INTERNATIONAL SEMINAR ON CHEMISTRY\",\"volume\":\"95 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"4TH INTERNATIONAL SEMINAR ON CHEMISTRY\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36563/proceeding.v4i0.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"4TH INTERNATIONAL SEMINAR ON CHEMISTRY","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36563/proceeding.v4i0.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数学建模支持商业世界和工业世界的发展,特别是在运输领域(Widana, 2020)。许多新出现的算法都是通过将实际问题的形式转变为数学问题而结合起来的。建模的目的是根据所形成的约束条件进行优化,得到最优的目标函数值。数学模型的优化可以通过几种优化算法来辅助,例如多换少算法。该算法作为一种循环形式,以具有指定参数的约束函数为基础,直至达到最终目标函数,即与时间和成本相关的优化(Muftikhali et al., 2018)。总的来说,希望运输方面的供需平衡。然而,在现实中,通常在现场条件下,混合运输问题导致非最优成本。研究结果表明,以少换多算法能够以最小的成本将工厂需求分配给商店,从而提供最优的解决方案。对偶变量矩阵指数为正,因此混合约束运输问题的解称为最优解。在Amarta Bakery行业社区业务领域的混合约束函数运输案例研究中得到的解决方案如下:总成本为580(单位货币)。组合——factory-to-store组合公司解释为第一家工厂在第一存储分配90产品单位,第一家工厂在第二个店分配110产品单位,第二工厂在第二个商店的分配0产品单位,工厂第二工厂在第三个存储分配70单位的产品,第三个工厂在第三个存储0单位分配的产品。数字为零意味着要根据混合约束进行效率优化,需要制造工厂不配送到商店的条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
BUILDING MATHEMATICS MODELING FOR SOLVED TRANSPORTATION PROBLEMS AND OPTIMIZING WITH MORE FOR FEWER ALGORITHMS IN THE BUSINESS COMMUNITY
Mathematical modeling supports the development of the business world and the industrial world, especially in transportation (Widana, 2020). Many emerging algorithms are combined with the adoption of changes in the form of real problems modeled into mathematical problems. The modeling aims to optimize to produce the most optimal objective function value based on the formed constraints. Optimization of the mathematical model can be assisted by several optimization algorithms, such as the More for Less Algorithm. The algorithm, as a form of looping, is based on the constraint function with the specified parameters until it reaches the final objective function, namely optimization related to time and cost(Muftikhali et al., 2018). In general, it is hoped that supply and demand will be balanced in transportation. However, in reality, often in field conditions, mixed transportation problems result in non-optimal costs. The study results show that the More for Less Algorithm can provide the most optimal solution according to the allocation of factory requests to shops with the minimum cost. The dual variable matrix index is positive, so the solution to the transportation problem with mixed constraints is called optimal. The solutions obtained in the transportation case study with mixed constraint functions in the field of the Amarta Bakery industry community business are as follows:with a total cost of 580 (in units of money). Combinations - factory-to-store combinations for companies are interpreted as first factory at the first store with an allocation of 90 product units, first factory at the second shop with an allocation of 110 product units, second factory at the second shop with an allocation of 0 product units, factory the second factory at the third store with an allocation of 70 units of product, and the third factory at the third store with an allocation of 0 units of product. The number zero means that to carry out efficiency and optimization according to mixed constraints, it is necessary to make conditions where factories do not distribute to shops.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信