On the Problem of Planning of Multi-Product Flows and Modernization of the Transportation Network

N. Zhurbenko, B. Chumakov
{"title":"On the Problem of Planning of Multi-Product Flows and Modernization of the Transportation Network","authors":"N. Zhurbenko, B. Chumakov","doi":"10.34229/2707-451x.21.4.1","DOIUrl":null,"url":null,"abstract":"Introduction. The problems of optimal planning of multi-product flows on transportation networks have a variety of important practical applications (transportation, logistics, communication networks). The mathematical models of these problems, as a rule, are characterized by a large dimension (hundreds of thousands of variables). Due to the specific features of multi-product transportation problems (pronounced block structure), the use of standard general-purpose optimization packages for their solution is not advisable. In this work of an applied nature, we propose a method for solving one class of such problems, taking into account their specificity. The method is based on the decomposition scheme with respect to a set of binding constraints. The corresponding dual problem is the nonsmooth optimization problem. To solve it, a new version of the subgradient algorithm with space dilation of variables is used. This approach to solving block optimization problems has been tested in solving a wide class of applied problems and, as experience shows, is characterized by a fairly high efficiency.\nPurpose of the article to develop a solution method and software for the problem of optimal planning of multi-product flows and modernization of the transportation system.\nResults. A mathematical model of the problem of optimal planning multi-product flows on the transportation network is proposed. The model is based on a variant transportation realization scheme. The software is developed in the C++ language in the style of object-oriented programming. The following algorithms are used as basic elements of the software: an algorithm for finding the shortest paths on a graph, an algorithm for solving a transportation problem on a graph, nonsmooth optimization algorithm.\nConclusions. The output data of the developed software determines the following information: rational transportation scheme, critical by capacity sections of the transportation network, recommendations for the rational distribution of funds for the reconstruction of the transportation network. The software is designed to solve the problems of long-term planning of the functioning and development of the transportation system. Keywords: optimal planning, mathematical model, subgradient methods, dual problem, software.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kibernetika ta kompiuterni tekhnologiyi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/2707-451x.21.4.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction. The problems of optimal planning of multi-product flows on transportation networks have a variety of important practical applications (transportation, logistics, communication networks). The mathematical models of these problems, as a rule, are characterized by a large dimension (hundreds of thousands of variables). Due to the specific features of multi-product transportation problems (pronounced block structure), the use of standard general-purpose optimization packages for their solution is not advisable. In this work of an applied nature, we propose a method for solving one class of such problems, taking into account their specificity. The method is based on the decomposition scheme with respect to a set of binding constraints. The corresponding dual problem is the nonsmooth optimization problem. To solve it, a new version of the subgradient algorithm with space dilation of variables is used. This approach to solving block optimization problems has been tested in solving a wide class of applied problems and, as experience shows, is characterized by a fairly high efficiency. Purpose of the article to develop a solution method and software for the problem of optimal planning of multi-product flows and modernization of the transportation system. Results. A mathematical model of the problem of optimal planning multi-product flows on the transportation network is proposed. The model is based on a variant transportation realization scheme. The software is developed in the C++ language in the style of object-oriented programming. The following algorithms are used as basic elements of the software: an algorithm for finding the shortest paths on a graph, an algorithm for solving a transportation problem on a graph, nonsmooth optimization algorithm. Conclusions. The output data of the developed software determines the following information: rational transportation scheme, critical by capacity sections of the transportation network, recommendations for the rational distribution of funds for the reconstruction of the transportation network. The software is designed to solve the problems of long-term planning of the functioning and development of the transportation system. Keywords: optimal planning, mathematical model, subgradient methods, dual problem, software.
多产品流规划与交通网络现代化问题研究
介绍运输网络上多产品流的优化规划问题具有各种重要的实际应用(运输、物流、通信网络)。这些问题的数学模型通常以大维度(数十万个变量)为特征。由于多产品运输问题的特定特征(明显的块结构),不建议使用标准通用优化包来解决这些问题。在这项应用性质的工作中,我们提出了一种解决一类此类问题的方法,考虑到它们的特殊性。该方法基于关于一组绑定约束的分解方案。相应的对偶问题是非光滑优化问题。为了解决这个问题,使用了一种新版本的具有变量空间膨胀的次梯度算法。这种解决块优化问题的方法已经在解决一类广泛的应用问题中进行了测试,经验表明,它具有相当高的效率。本文的目的是开发一种解决多产品流优化规划和运输系统现代化问题的方法和软件。后果提出了运输网络上多产品流优化规划问题的数学模型。该模型基于一种变体运输实现方案。该软件是用C++语言以面向对象的编程风格开发的。以下算法被用作软件的基本元素:在图上寻找最短路径的算法,在图上解决运输问题的算法,非光滑优化算法。结论。所开发软件的输出数据确定了以下信息:合理的交通方案、交通网络的关键路段、交通网络重建资金的合理分配建议。该软件旨在解决交通系统功能和发展的长期规划问题。关键词:最优规划,数学模型,次梯度方法,对偶问题,软件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
20
审稿时长
6 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学术文献互助群
群 号:604180095
Book学术官方微信
小红书