综合网络拓扑下基于交通的疏散策略研究

I. Adhikari, T. N. Dhamala
{"title":"综合网络拓扑下基于交通的疏散策略研究","authors":"I. Adhikari, T. N. Dhamala","doi":"10.3126/NMSR.V37I1-2.34063","DOIUrl":null,"url":null,"abstract":"Evacuation planning problem deals with sending the maximum number of evacuees from the danger zone to the safe zone in minimum time as eciently as possible. The dynamic network flow models for various evacuation network topology have been found suitable for the solution of such a problem. Bus based evacuation planning problem (BEPP), as an important variant of the vehicle routing problem (VRP), is one of the emerging evacuation planning problems. In this work, an organized overview of this problem with a focus on their solution status is compactly presented. Arrival patterns of the evacuees including their transshipments at different pickup locations and their assignments are presented. Finally, a BEPP model and a solution for a special network are also proposed.","PeriodicalId":165940,"journal":{"name":"The Nepali Mathematical Sciences Report","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the Transit-Based Evacuation Strategies in an Integrated Network Topology\",\"authors\":\"I. Adhikari, T. N. Dhamala\",\"doi\":\"10.3126/NMSR.V37I1-2.34063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evacuation planning problem deals with sending the maximum number of evacuees from the danger zone to the safe zone in minimum time as eciently as possible. The dynamic network flow models for various evacuation network topology have been found suitable for the solution of such a problem. Bus based evacuation planning problem (BEPP), as an important variant of the vehicle routing problem (VRP), is one of the emerging evacuation planning problems. In this work, an organized overview of this problem with a focus on their solution status is compactly presented. Arrival patterns of the evacuees including their transshipments at different pickup locations and their assignments are presented. Finally, a BEPP model and a solution for a special network are also proposed.\",\"PeriodicalId\":165940,\"journal\":{\"name\":\"The Nepali Mathematical Sciences Report\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Nepali Mathematical Sciences Report\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3126/NMSR.V37I1-2.34063\",\"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.V37I1-2.34063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

疏散规划问题是指在最短的时间内,尽可能快速地将最大数量的疏散人员从危险区转移到安全区。各种疏散网络拓扑的动态网络流模型都适合于求解这一问题。基于公交车的疏散规划问题(BEPP)是车辆路径问题(VRP)的一个重要变体,是新兴的疏散规划问题之一。在这项工作中,对该问题进行了有组织的概述,重点关注其解决方案状态。介绍了撤离人员的到达模式,包括他们在不同接机地点的转运和他们的任务。最后,提出了一种特殊网络的BEPP模型和解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Transit-Based Evacuation Strategies in an Integrated Network Topology
Evacuation planning problem deals with sending the maximum number of evacuees from the danger zone to the safe zone in minimum time as eciently as possible. The dynamic network flow models for various evacuation network topology have been found suitable for the solution of such a problem. Bus based evacuation planning problem (BEPP), as an important variant of the vehicle routing problem (VRP), is one of the emerging evacuation planning problems. In this work, an organized overview of this problem with a focus on their solution status is compactly presented. Arrival patterns of the evacuees including their transshipments at different pickup locations and their assignments are presented. Finally, a BEPP model and a solution for a special network are also proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hermite-Hadamart Integral Inequality for Differentiable m- Convex Functions Generalized Cesàro Summable Vector Valued Sequence Space of Bounded Type On The Determination of a Convex Sequence of Signals by Absolute Sum of Factors of Trigonometric Series A comparison of Finite difference schemes to Finite volume scheme for axially symmetric 2D heat equation Generalizing the Mittag-Leffler Function for Fractional Differentiation and Numerical Computation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1