Pengembangan Model Capacitated Maximal Covering Location Problem (CMCLP) untuk Penentuan Lokasi dan Tipe Distribution Center

OPSI Pub Date : 2022-06-18 DOI:10.31315/opsi.v15i1.6431
S. Santoso, R. Heryanto
{"title":"Pengembangan Model Capacitated Maximal Covering Location Problem (CMCLP) untuk Penentuan Lokasi dan Tipe Distribution Center","authors":"S. Santoso, R. Heryanto","doi":"10.31315/opsi.v15i1.6431","DOIUrl":null,"url":null,"abstract":"Facility location decision making is necessary for both the public and private sectors for optimum utilization of resources. While the private sector may locate facilities to maximize profit or minimize cost, the public sector aims at providing services to cover as many in the population as possible. In this research, a Capacitated Maximal Covering Location problem (CMCLP) with constraints in actual world such as various types of facilities and consider maximum available budget to build the facilities. An Mixed Integer Linear Programming (MILP) model is constructed in order to find the optimal solution. The problem to be solved is determining the strategic location for establishment of a Distribution Center (DC) that maximize number of demands that can be fulfilled. A numerical example in the previous study will be used and solved using MATLAB 9.0. From the development model, the company finds the optimal location to build a DC and knows the number of products allocated from DC to each demand point and the maximum number of demands that could be fulfilled as in the previous study. The company also could find out the type of DC to be built and of course meet the available budget to build the DC.","PeriodicalId":34167,"journal":{"name":"OPSI","volume":"419 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"OPSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31315/opsi.v15i1.6431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Facility location decision making is necessary for both the public and private sectors for optimum utilization of resources. While the private sector may locate facilities to maximize profit or minimize cost, the public sector aims at providing services to cover as many in the population as possible. In this research, a Capacitated Maximal Covering Location problem (CMCLP) with constraints in actual world such as various types of facilities and consider maximum available budget to build the facilities. An Mixed Integer Linear Programming (MILP) model is constructed in order to find the optimal solution. The problem to be solved is determining the strategic location for establishment of a Distribution Center (DC) that maximize number of demands that can be fulfilled. A numerical example in the previous study will be used and solved using MATLAB 9.0. From the development model, the company finds the optimal location to build a DC and knows the number of products allocated from DC to each demand point and the maximum number of demands that could be fulfilled as in the previous study. The company also could find out the type of DC to be built and of course meet the available budget to build the DC.
彭邦安模型容量最大覆盖定位问题(CMCLP)以彭邦安物流中心为例
设施选址决策对公共和私营部门都是必要的,以实现资源的最佳利用。虽然私营部门可能会选择利润最大化或成本最小化的设施,但公共部门的目标是为尽可能多的人口提供服务。本文研究了在各种设施类型的约束下,考虑设施建设的最大可用预算的可容最大覆盖选址问题(CMCLP)。为了寻找最优解,建立了混合整数线性规划模型。要解决的问题是确定建立配送中心(DC)的战略位置,以最大限度地满足需求。本文将使用前面研究中的一个数值算例,并使用MATLAB 9.0进行求解。从开发模型中,公司找到了建立DC的最优位置,并且知道从DC分配到每个需求点的产品数量以及可以满足的最大需求数量。公司还可以找出要建造的数据中心的类型,当然还要满足建造数据中心的可用预算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
16
审稿时长
12 weeks
×
引用
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学术官方微信