A heuristic approach to handle capacitated facility location problem evaluated using clustering internal evaluation

Indonesian Operations Research Association - International Conference on Operations Research 2017

Sutanto, G.R.^1,2 ; Kim, S.^1 ; Kim, D.^1 ; Sutanto, H.^3

Department of Industrial and Management Engineering, Myongji University, Korea, Republic of^1

Department of Industrial Engineering, University of Buddhi Dharma, Indonesia^2

Department of Manufacturing Engineering, Atma Jaya Catholic University, Indonesia^3

关键词: Available capacity;    Average Distance;    Capacitated facility location problems;    Clustering evaluation;    Facilities locations;    Heuristic approach;    K-Means clustering algorithm;    New approaches;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/332/1/012023/pdf
DOI  :  10.1088/1757-899X/332/1/012023

来源: IOP

【 摘 要 】

One of the problems in dealing with capacitated facility location problem (CFLP) is occurred because of the difference between the capacity numbers of facilities and the number of customers that needs to be served. A facility with small capacity may result in uncovered customers. These customers need to be re-allocated to another facility that still has available capacity. Therefore, an approach is proposed to handle CFLP by using k-means clustering algorithm to handle customers' allocation. And then, if customers' re-allocation is needed, is decided by the overall average distance between customers and the facilities. This new approach is benchmarked to the existing approach by Liao and Guo which also use k-means clustering algorithm as a base idea to decide the facilities location and customers' allocation. Both of these approaches are benchmarked by using three clustering evaluation methods with connectedness, compactness, and separations factors.