可调鲁棒最大流量问题的图形用户界面设计

D. Chaerani, Naufal Badruzzaman, E. Hertini, E. Rusyaman
{"title":"可调鲁棒最大流量问题的图形用户界面设计","authors":"D. Chaerani, Naufal Badruzzaman, E. Hertini, E. Rusyaman","doi":"10.24198/jmi.v17.n1.30288.63-72","DOIUrl":null,"url":null,"abstract":"Maximum flow problem is one of optimization problems which aims to find the maximum flow value that is traversed in a network system. This problem can be solved using existing algorithms and linear programming. In the case of maximum flow, often the parameters used vary due to certain factors. [1] designed the Robust Counterpart Optimization Model for Maximum Flow Problems by assuming side and flow capacities from an indefinite point to destination point to solve the maximum flow problem with uncertainty. To facilitate the search for solutions with large amounts of data, a Graphical User Interface (GUI) was made. GUI is a pictorial interface of a program that can facilitate its users in completing their work such as counting, making, and so on. In this study, the GUI was created using Maple software and used the Adjustable Robust Counterpart Optimization Model made by [1]. Thus, the search for solutions to maximum flow problems can be resolved quickly and efficiently only by entering the data needed for calculations in the GUI.","PeriodicalId":53096,"journal":{"name":"Jurnal Matematika Integratif","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing Graphical User Interface (GUI) for Adjustable Robust Maximum Flow Problem\",\"authors\":\"D. Chaerani, Naufal Badruzzaman, E. Hertini, E. Rusyaman\",\"doi\":\"10.24198/jmi.v17.n1.30288.63-72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maximum flow problem is one of optimization problems which aims to find the maximum flow value that is traversed in a network system. This problem can be solved using existing algorithms and linear programming. In the case of maximum flow, often the parameters used vary due to certain factors. [1] designed the Robust Counterpart Optimization Model for Maximum Flow Problems by assuming side and flow capacities from an indefinite point to destination point to solve the maximum flow problem with uncertainty. To facilitate the search for solutions with large amounts of data, a Graphical User Interface (GUI) was made. GUI is a pictorial interface of a program that can facilitate its users in completing their work such as counting, making, and so on. In this study, the GUI was created using Maple software and used the Adjustable Robust Counterpart Optimization Model made by [1]. Thus, the search for solutions to maximum flow problems can be resolved quickly and efficiently only by entering the data needed for calculations in the GUI.\",\"PeriodicalId\":53096,\"journal\":{\"name\":\"Jurnal Matematika Integratif\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Matematika Integratif\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24198/jmi.v17.n1.30288.63-72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Matematika Integratif","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24198/jmi.v17.n1.30288.63-72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最大流量问题是寻找网络系统所经过的最大流量值的优化问题之一。这个问题可以用现有的算法和线性规划来解决。在最大流量的情况下,由于某些因素,所使用的参数通常会发生变化。[1]通过假设从不确定点到目的点的侧流量和流量,设计了最大流问题的鲁棒对等优化模型,解决了不确定的最大流问题。为了方便搜索具有大量数据的解决方案,图形用户界面(GUI)被制作出来。GUI是程序的图形界面,可以方便用户完成计数、制作等工作。在本研究中,使用Maple软件创建GUI,并使用[1]制作的可调鲁棒对等优化模型。因此,只有在GUI中输入计算所需的数据,才能快速有效地解决最大流量问题的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing Graphical User Interface (GUI) for Adjustable Robust Maximum Flow Problem
Maximum flow problem is one of optimization problems which aims to find the maximum flow value that is traversed in a network system. This problem can be solved using existing algorithms and linear programming. In the case of maximum flow, often the parameters used vary due to certain factors. [1] designed the Robust Counterpart Optimization Model for Maximum Flow Problems by assuming side and flow capacities from an indefinite point to destination point to solve the maximum flow problem with uncertainty. To facilitate the search for solutions with large amounts of data, a Graphical User Interface (GUI) was made. GUI is a pictorial interface of a program that can facilitate its users in completing their work such as counting, making, and so on. In this study, the GUI was created using Maple software and used the Adjustable Robust Counterpart Optimization Model made by [1]. Thus, the search for solutions to maximum flow problems can be resolved quickly and efficiently only by entering the data needed for calculations in the GUI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
20
审稿时长
12 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学术官方微信