鲁棒应急系统设计的迭代方法

Marek Kvet, J. Janáček
{"title":"鲁棒应急系统设计的迭代方法","authors":"Marek Kvet, J. Janáček","doi":"10.1109/SOLI.2017.8120961","DOIUrl":null,"url":null,"abstract":"A robust structure of an emergency service system is usually designed so that the deployment of given number of service centers complies with specified scenarios by minimizing the maximal value of objective functions corresponding with the particular scenarios. If the problem is modelled by means of mathematical programming and solved by a general IP solver, than the min-max link-up constraints represent an undesirable burden in any integer programming design problems due to bad convergence of embedded branch-and-bound method. Within this paper, we try to overcome the drawback following from the link-up constraints by usage of several techniques based on iterative processing. We provide the reader with a comparison of the original min-max approach to the suggested approach based on the Lagrangean relaxation of the troublesome constraints and subsequent usage of sub-gradient method for Lagrangean multiplier adjustment.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Iterative approaches to design of robust emergency system\",\"authors\":\"Marek Kvet, J. Janáček\",\"doi\":\"10.1109/SOLI.2017.8120961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A robust structure of an emergency service system is usually designed so that the deployment of given number of service centers complies with specified scenarios by minimizing the maximal value of objective functions corresponding with the particular scenarios. If the problem is modelled by means of mathematical programming and solved by a general IP solver, than the min-max link-up constraints represent an undesirable burden in any integer programming design problems due to bad convergence of embedded branch-and-bound method. Within this paper, we try to overcome the drawback following from the link-up constraints by usage of several techniques based on iterative processing. We provide the reader with a comparison of the original min-max approach to the suggested approach based on the Lagrangean relaxation of the troublesome constraints and subsequent usage of sub-gradient method for Lagrangean multiplier adjustment.\",\"PeriodicalId\":190544,\"journal\":{\"name\":\"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOLI.2017.8120961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2017.8120961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

应急服务系统的鲁棒结构通常是通过最小化与特定场景相对应的目标函数的最大值,使给定数量的服务中心的部署符合特定场景。如果用数学规划方法对问题进行建模,并使用一般的IP求解器进行求解,那么由于嵌入式分支定界方法的收敛性差,最小-最大连接约束在任何整数规划设计问题中都是不希望出现的负担。在本文中,我们试图通过使用几种基于迭代处理的技术来克服连接约束所带来的缺点。我们为读者提供了原始最小-最大方法与基于拉格朗日松弛的棘手约束和随后使用子梯度方法进行拉格朗日乘数调整的建议方法的比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Iterative approaches to design of robust emergency system
A robust structure of an emergency service system is usually designed so that the deployment of given number of service centers complies with specified scenarios by minimizing the maximal value of objective functions corresponding with the particular scenarios. If the problem is modelled by means of mathematical programming and solved by a general IP solver, than the min-max link-up constraints represent an undesirable burden in any integer programming design problems due to bad convergence of embedded branch-and-bound method. Within this paper, we try to overcome the drawback following from the link-up constraints by usage of several techniques based on iterative processing. We provide the reader with a comparison of the original min-max approach to the suggested approach based on the Lagrangean relaxation of the troublesome constraints and subsequent usage of sub-gradient method for Lagrangean multiplier adjustment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A pre-process clustering methods for the waste collection problem Logistics in omni-channel retailing: Modelling and analysis of three distribution configurations Mixed vendor/retailer management of zero-cost multill-inventory systems Maximizing road carriers profit by combining trips and sizing the carrier coalition Raw material flow optimization as a capacitated vehicle routing problem: A visual benchmarking approach for sustainable manufacturing
×
引用
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