Risk-averse Hazmat Network Design Considering Endogenous Risk and Uncertainty

Pengcheng Dong, Guodong Yu
{"title":"Risk-averse Hazmat Network Design Considering Endogenous Risk and Uncertainty","authors":"Pengcheng Dong, Guodong Yu","doi":"10.1109/IEEM50564.2021.9673007","DOIUrl":null,"url":null,"abstract":"We consider a hazmat network design problem where designer selects a feasible set of facility locations and flow assignments so that the total cost and transportation risk are minimized. While hazmat carriers choose preferred routes to transport, in particular, the route-choice is uncertain and depends on the available facilities and travel links. To improve service reliability under uncertainty, we incorporate risk-averse measures based on Conditional value-at-risk (CVaR). We model the problem as a mixed-integer trilinear optimization problem, then an equivalent linearization reformulation and a Benders decomposition algorithm with several acceleration strategies are proposed to solve this model. Numerical experiments demonstrate the effectiveness of proposed model and algorithm and give management insights.","PeriodicalId":6818,"journal":{"name":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"45 1","pages":"1536-1540"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM50564.2021.9673007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We consider a hazmat network design problem where designer selects a feasible set of facility locations and flow assignments so that the total cost and transportation risk are minimized. While hazmat carriers choose preferred routes to transport, in particular, the route-choice is uncertain and depends on the available facilities and travel links. To improve service reliability under uncertainty, we incorporate risk-averse measures based on Conditional value-at-risk (CVaR). We model the problem as a mixed-integer trilinear optimization problem, then an equivalent linearization reformulation and a Benders decomposition algorithm with several acceleration strategies are proposed to solve this model. Numerical experiments demonstrate the effectiveness of proposed model and algorithm and give management insights.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑内生风险和不确定性的风险规避危险品网络设计
我们考虑一个危险品网络设计问题,设计者选择一组可行的设施位置和流量分配,以使总成本和运输风险最小化。特别是,虽然危险品承运人选择首选的运输路线,但路线的选择是不确定的,取决于现有的设施和旅行联系。为了提高不确定条件下的服务可靠性,我们引入了基于条件风险值(CVaR)的风险规避措施。将该问题建模为一个混合整数型三线性优化问题,并提出了等效线性化重构和具有多种加速策略的Benders分解算法来求解该模型。数值实验证明了所提出的模型和算法的有效性,并为管理提供了启示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Representing Control Software Functionality as Part of a Modular, Mechatronic Construction Kit Situational Awareness and Flight Approach Phase Event Recognition Based on Psychophysiological Measurements The Robust Optimization Approach for the Community Group Purchase Joint Order Fulfillment and Delivery Problem Application of the Multistage One-shot Decision-making Approach to an IT Project in the Central Bank of Oman A Review on Electric Bus Charging Scheduling from Viewpoints of Vehicle Scheduling
×
引用
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