基于网络重构的最早到达转运

R. Dhungana, T. N. Dhamala
{"title":"基于网络重构的最早到达转运","authors":"R. Dhungana, T. N. Dhamala","doi":"10.3126/nmsr.v35i1-2.29974","DOIUrl":null,"url":null,"abstract":"The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.","PeriodicalId":165940,"journal":{"name":"The Nepali Mathematical Sciences Report","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Abstract Earliest Arrival Transshipment with Network Reconfiguration\",\"authors\":\"R. Dhungana, T. N. Dhamala\",\"doi\":\"10.3126/nmsr.v35i1-2.29974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.\",\"PeriodicalId\":165940,\"journal\":{\"name\":\"The Nepali Mathematical Sciences Report\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Nepali Mathematical Sciences Report\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3126/nmsr.v35i1-2.29974\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Nepali Mathematical Sciences Report","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/nmsr.v35i1-2.29974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

抽象流模型是对网络流模型的推广,它处理的是满足交换特性的流路径(路由)。对流模型通过反转从源到汇所需的弧形方向来增加流量值。本文结合抽象流和逆向流的概念,提出了多终端抽象网络中的抽象最早到达转运逆向流模型。多终端动态网络上的抽象逆流是np完全的。我们提出了一种有效的近似算法来解决这一问题。该方法通过在每个可能的时间点发送最优流来满足汇聚点的需求,并寻求消除交叉冲突。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Abstract Earliest Arrival Transshipment with Network Reconfiguration
The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信