Facility location with adjacent units: a simple approximation scheme

Shailesh S. Kulkarni, Hakan Tarakci, K. Boakye, Subramaniam Ponnaiyan, Matthew Lasuzzo
{"title":"Facility location with adjacent units: a simple approximation scheme","authors":"Shailesh S. Kulkarni, Hakan Tarakci, K. Boakye, Subramaniam Ponnaiyan, Matthew Lasuzzo","doi":"10.1504/IJIOME.2013.055995","DOIUrl":null,"url":null,"abstract":"In this paper, we provide a simple approximation scheme for the optimal objective value for a particular type of location problem. Typically, such problems are solved using the classic set covering formulation. Such a formulation automatically requires data for the constraint matrix and can get too large to implement or too difficult to solve to optimality. The scheme presented in this paper has minimal need for such data. Based on a simple count and with some basic and realistic assumptions about the geometry of the problem, we provide an algebraic formula that gives a close approximation to the optimal objective function value. Our formula can be easily implemented in a spreadsheet or hand-held calculator making it an effective planning tool for practice and also a good pedagogical aid. We illustrate by applying it to a location problem involving individual states in the continental US and collectively to the entire country.","PeriodicalId":193538,"journal":{"name":"International Journal of Information and Operations Management Education","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information and Operations Management Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJIOME.2013.055995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we provide a simple approximation scheme for the optimal objective value for a particular type of location problem. Typically, such problems are solved using the classic set covering formulation. Such a formulation automatically requires data for the constraint matrix and can get too large to implement or too difficult to solve to optimality. The scheme presented in this paper has minimal need for such data. Based on a simple count and with some basic and realistic assumptions about the geometry of the problem, we provide an algebraic formula that gives a close approximation to the optimal objective function value. Our formula can be easily implemented in a spreadsheet or hand-held calculator making it an effective planning tool for practice and also a good pedagogical aid. We illustrate by applying it to a location problem involving individual states in the continental US and collectively to the entire country.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
设施位置与相邻单元:一个简单的近似方案
本文给出了一类特殊定位问题的最优目标值的简单逼近格式。通常,这类问题是用经典的集合覆盖公式来解决的。这样的公式自动需要约束矩阵的数据,并且可能变得太大而无法实现或难以求解到最优。本文提出的方案对此类数据的需求最小。基于一个简单的计数和一些关于问题几何的基本和现实的假设,我们提供了一个代数公式,给出了最优目标函数值的近似值。我们的公式可以很容易地在电子表格或手持计算器中实现,使其成为一个有效的实践计划工具,也是一个很好的教学辅助工具。我们通过将其应用于涉及美国大陆单个州和整个国家的位置问题来说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Lean production teaching methods and learning assessment: a literature review A framework for teaching an undergraduate data analytics class An informal approach to management development at small and medium-sized manufacturing companies Computer self-efficacy in global contexts: appraising Chinese and Indian non-specialists' attitudes to common and advanced computer tasks Role of learning style preferences and interactive response systems on student learning outcomes
×
引用
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