缓解设施位置建模中库存的硬容量限制

K. Maass, M. Daskin, Siqian Shen
{"title":"缓解设施位置建模中库存的硬容量限制","authors":"K. Maass, M. Daskin, Siqian Shen","doi":"10.1080/0740817X.2015.1078015","DOIUrl":null,"url":null,"abstract":"ABSTRACT Although the traditional capacitated facility location model uses inflexible, limited capacities, facility managers often have many operational tools to extend capacity or to allow a facility to accept demands in excess of the capacity constraint for short periods of time. We present a mixed-integer program that captures these operational extensions. In particular, demands are not restricted by the capacity constraint, as we allow for unprocessed materials from one day to be held over in inventory and processed on a following day. We also consider demands at a daily level, which allows us to explicitly incorporate the daily variation in, and possibly correlated nature of, demands. Large problem instances, in terms of the number of demand nodes, candidate nodes, and number of days in the time horizon, are generated from United States census population data. We demonstrate that, in some instances, optimal locations identified by the new model differ from those of the traditional capacitated facility location problem and result in significant cost savings.","PeriodicalId":13379,"journal":{"name":"IIE Transactions","volume":"48 1","pages":"120 - 133"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/0740817X.2015.1078015","citationCount":"14","resultStr":"{\"title\":\"Mitigating hard capacity constraints with inventory in facility location modeling\",\"authors\":\"K. Maass, M. Daskin, Siqian Shen\",\"doi\":\"10.1080/0740817X.2015.1078015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Although the traditional capacitated facility location model uses inflexible, limited capacities, facility managers often have many operational tools to extend capacity or to allow a facility to accept demands in excess of the capacity constraint for short periods of time. We present a mixed-integer program that captures these operational extensions. In particular, demands are not restricted by the capacity constraint, as we allow for unprocessed materials from one day to be held over in inventory and processed on a following day. We also consider demands at a daily level, which allows us to explicitly incorporate the daily variation in, and possibly correlated nature of, demands. Large problem instances, in terms of the number of demand nodes, candidate nodes, and number of days in the time horizon, are generated from United States census population data. We demonstrate that, in some instances, optimal locations identified by the new model differ from those of the traditional capacitated facility location problem and result in significant cost savings.\",\"PeriodicalId\":13379,\"journal\":{\"name\":\"IIE Transactions\",\"volume\":\"48 1\",\"pages\":\"120 - 133\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/0740817X.2015.1078015\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IIE Transactions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/0740817X.2015.1078015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IIE Transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/0740817X.2015.1078015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

虽然传统的可容设施选址模型使用的是不灵活的、有限的能力,但设施管理人员通常有许多操作工具来扩展能力或允许设施在短时间内接受超出能力约束的需求。我们提出了一个捕获这些运算扩展的混合整数程序。特别是,需求不受产能限制的限制,因为我们允许一天未加工的材料保留在库存中,并在第二天加工。我们还考虑日常水平的需求,这使我们能够明确地将需求的日常变化和可能相关的本质结合起来。就需求节点的数量、候选节点的数量和时间范围内的天数而言,大型问题实例是从美国人口普查数据生成的。我们证明,在某些情况下,新模型确定的最佳位置与传统的有容量设施位置问题不同,并导致显著的成本节约。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mitigating hard capacity constraints with inventory in facility location modeling
ABSTRACT Although the traditional capacitated facility location model uses inflexible, limited capacities, facility managers often have many operational tools to extend capacity or to allow a facility to accept demands in excess of the capacity constraint for short periods of time. We present a mixed-integer program that captures these operational extensions. In particular, demands are not restricted by the capacity constraint, as we allow for unprocessed materials from one day to be held over in inventory and processed on a following day. We also consider demands at a daily level, which allows us to explicitly incorporate the daily variation in, and possibly correlated nature of, demands. Large problem instances, in terms of the number of demand nodes, candidate nodes, and number of days in the time horizon, are generated from United States census population data. We demonstrate that, in some instances, optimal locations identified by the new model differ from those of the traditional capacitated facility location problem and result in significant cost savings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IIE Transactions
IIE Transactions 工程技术-工程:工业
自引率
0.00%
发文量
0
审稿时长
4.5 months
期刊最新文献
EOV Focus Area Editorial Boards Strategic health workforce planning Efficient computation of the likelihood expansions for diffusion models An introduction to optimal power flow: Theory, formulation, and examples An integrated failure mode and effect analysis approach for accurate risk assessment under uncertainty
×
引用
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