Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities

IF 0.8 4区 工程技术 Q4 TRANSPORTATION SCIENCE & TECHNOLOGY
Marko Spoljarec, R. Manger
{"title":"Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities","authors":"Marko Spoljarec, R. Manger","doi":"10.7307/PTT.V33I1.3538","DOIUrl":null,"url":null,"abstract":"This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. The accuracy of the proposed algorithm is verified by experiments.","PeriodicalId":54546,"journal":{"name":"Promet-Traffic & Transportation","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2021-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Promet-Traffic & Transportation","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.7307/PTT.V33I1.3538","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 1

Abstract

This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. The accuracy of the proposed algorithm is verified by experiments.
具有不确定圆弧容量的整数流问题的鲁棒解
本文主要研究鲁棒优化和网络流问题。考虑了整数流问题的几个鲁棒变体。它们假定网络电弧容量和电弧单位成本(如适用)的不确定性。不确定性由离散情景表示。由于所考虑的最大流问题的变体易于求解,因此本文主要关注最小代价流问题的NP-hard变体,从而提出了求解它们的近似算法。通过实验验证了该算法的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Promet-Traffic & Transportation
Promet-Traffic & Transportation 工程技术-运输科技
CiteScore
1.90
自引率
20.00%
发文量
62
审稿时长
3 months
期刊介绍: This scientific journal publishes scientific papers in the area of technical sciences, field of transport and traffic technology. The basic guidelines of the journal, which support the mission - promotion of transport science, are: relevancy of published papers and reviewer competency, established identity in the print and publishing profile, as well as other formal and informal details. The journal organisation consists of the Editorial Board, Editors, Reviewer Selection Committee and the Scientific Advisory Committee. The received papers are subject to peer review in accordance with the recommendations for international scientific journals. The papers published in the journal are placed in sections which explain their focus in more detail. The sections are: transportation economy, information and communication technology, intelligent transport systems, human-transport interaction, intermodal transport, education in traffic and transport, traffic planning, traffic and environment (ecology), traffic on motorways, traffic in the cities, transport and sustainable development, traffic and space, traffic infrastructure, traffic policy, transport engineering, transport law, safety and security in traffic, transport logistics, transport technology, transport telematics, internal transport, traffic management, science in traffic and transport, traffic engineering, transport in emergency situations, swarm intelligence in transportation engineering. The Journal also publishes information not subject to review, and classified under the following headings: book and other reviews, symposia, conferences and exhibitions, scientific cooperation, anniversaries, portraits, bibliographies, publisher information, news, etc.
×
引用
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学术官方微信