Solution of the Compromise Optimization Problem of Network Graphics on the Criteria of Uniform Personnel Loading and Distribution of Funds

Olena Domina
{"title":"Solution of the Compromise Optimization Problem of Network Graphics on the Criteria of Uniform Personnel Loading and Distribution of Funds","authors":"Olena Domina","doi":"10.15587/2706-5448.2021.225527","DOIUrl":null,"url":null,"abstract":"The object of research is a model network schedule for performing a complex of operations. One of the most problematic areas is the lack of a unified procedure that allows finding a solution to the problem of compromise optimization, for which the optimization criteria can have a different nature of the influence of input variables on them. In this study, such criteria are the criteria for the uniformity of the workload of personnel and the distribution of funds. Two alternative cases are considered: with monthly planning and with quarterly planning of allocation of funds and staff load.\nThe methods of mathematical planning of the experiment and the ridge analysis of the response surface are used.\nThe peculiarities of the proposed procedure for solving the problem of compromise optimization are its versatility and the possibility of visualization in one-dimensional form – the dependence of each of the alternative criteria on one parameter describing the constraints. The solution itself is found as the point of intersection of equally labeled ridge lines, which are curves that describe the locally optimal values of the output variables.\nThe proposed procedure, despite the fact that it is performed only on a model network diagram, can be used to solve the trade-off optimization problem on arbitrary network graphs. This is due to the fact that the combination of locally optimal solutions in a parametric form on one graph allows visualizing all solutions to the problem. The results obtained at the same time make it possible to select early dates for the start of operations in such a way that, as much as possible, take into account possible difficulties due to the formation of bottlenecks at certain stages of the project. The latter may be due to the fact that for the timely execution of some operation, it may be necessary to combine two criteria, despite the fact that the possible costs may turn out to be more calculated and estimated as optimal.","PeriodicalId":200007,"journal":{"name":"ERN: Statistical Decision Theory; Operations Research (Topic)","volume":"os-18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Statistical Decision Theory; Operations Research (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15587/2706-5448.2021.225527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The object of research is a model network schedule for performing a complex of operations. One of the most problematic areas is the lack of a unified procedure that allows finding a solution to the problem of compromise optimization, for which the optimization criteria can have a different nature of the influence of input variables on them. In this study, such criteria are the criteria for the uniformity of the workload of personnel and the distribution of funds. Two alternative cases are considered: with monthly planning and with quarterly planning of allocation of funds and staff load. The methods of mathematical planning of the experiment and the ridge analysis of the response surface are used. The peculiarities of the proposed procedure for solving the problem of compromise optimization are its versatility and the possibility of visualization in one-dimensional form – the dependence of each of the alternative criteria on one parameter describing the constraints. The solution itself is found as the point of intersection of equally labeled ridge lines, which are curves that describe the locally optimal values of the output variables. The proposed procedure, despite the fact that it is performed only on a model network diagram, can be used to solve the trade-off optimization problem on arbitrary network graphs. This is due to the fact that the combination of locally optimal solutions in a parametric form on one graph allows visualizing all solutions to the problem. The results obtained at the same time make it possible to select early dates for the start of operations in such a way that, as much as possible, take into account possible difficulties due to the formation of bottlenecks at certain stages of the project. The latter may be due to the fact that for the timely execution of some operation, it may be necessary to combine two criteria, despite the fact that the possible costs may turn out to be more calculated and estimated as optimal.
以人员均匀装车和资金均匀分配为准则的网络图形折衷优化问题求解
研究的对象是执行复杂操作的网络调度模型。最成问题的领域之一是缺乏统一的程序来找到折衷优化问题的解决方案,因为优化标准可能具有输入变量对其影响的不同性质。在本研究中,这些标准是人员工作量统一和资金分配的标准。考虑了两种备选情况:按月规划和按季度规划资金分配和工作人员负荷。采用了实验数学规划和响应面脊分析的方法。所提出的解决折衷优化问题的程序的特点是它的通用性和以一维形式可视化的可能性-每个备选准则依赖于描述约束的一个参数。解本身是相等标记的脊线的交点,脊线是描述输出变量的局部最优值的曲线。尽管所提出的过程仅在模型网络图上执行,但可以用于解决任意网络图上的权衡优化问题。这是因为在一个图上以参数形式组合局部最优解可以使问题的所有解可视化。同时取得的结果使我们能够选择尽早开始作业的日期,并尽可能地考虑到在项目的某些阶段由于形成瓶颈而可能出现的困难。后者可能是由于这样一个事实,即为了及时执行某些操作,可能需要将两个标准结合起来,尽管可能的成本可能最终被证明是最优的计算和估计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信