A Two Phases Heuristic Based Method for the MinMax Regret Location Problem

S. Ibri
{"title":"A Two Phases Heuristic Based Method for the MinMax Regret Location Problem","authors":"S. Ibri","doi":"10.1109/ISCMI.2016.32","DOIUrl":null,"url":null,"abstract":"We are interested in solving the problem of locating a subset of facilities in the case of uncertainties and variations in the system parameters. Dealing with this problem using scenarios based approach needs an important computational effort. The two phases proposed method in this paper combines both exact and heuristic approaches to minimize the maximum regret of the model. We proposed and compared three different heuristics to solve it and applied it to the case of locating emergency vehicles stations. The obtained results show that site selection based on the minimum average travel time is the most promising one.","PeriodicalId":417057,"journal":{"name":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd International Conference on Soft Computing & Machine Intelligence (ISCMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCMI.2016.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We are interested in solving the problem of locating a subset of facilities in the case of uncertainties and variations in the system parameters. Dealing with this problem using scenarios based approach needs an important computational effort. The two phases proposed method in this paper combines both exact and heuristic approaches to minimize the maximum regret of the model. We proposed and compared three different heuristics to solve it and applied it to the case of locating emergency vehicles stations. The obtained results show that site selection based on the minimum average travel time is the most promising one.
最小最大遗憾定位问题的两阶段启发式方法
我们感兴趣的是解决在系统参数不确定和变化的情况下定位设施子集的问题。使用基于场景的方法处理这一问题需要大量的计算工作。本文提出的两阶段方法结合了精确和启发式两种方法来最小化模型的最大遗憾。我们提出并比较了三种不同的启发式方法来解决该问题,并将其应用于应急车辆站的定位问题。结果表明,基于最小平均出行时间的选址方法是最可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信