Heuristic approach for solving capacitated location-routing problems

3rd Indonesian Operations Research Association - International Conference on Operations Research 2018

计算机科学

Ahmad, H.N.^1 ; Bakhtiar, T.^1 ; Supriyo, P.T.^1

Division of Operations Research, Department of Mathematics, Bogor Agricultural University, Kampus IPB Dramaga, Bogor

16680, Indonesia^1

关键词: Capacitated location;    Clustering customers;    Euclidean distance;    Facility locations;    Heuristic approach;    Heuristic mechanisms;    K-means;    Optimal distributions;   

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

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

This paper deals with the standard capacitated location-routing problem (CLRP), where two types of interdependent decisions must be made: which facilities among a number of potential ones should be operated and which vehicle routes should be built to fulfil the demand of customers from the operated facilities using a given fleet. We propose a heuristic mechanism to address the problem. The algorithm consists of four stages, namely optimally clustering customers by k-means and assessed by Dunn index, selecting the nearest depot to be opened based on Euclidean distance calculation, customers-to-depot matching and searching the optimal distribution route. This heuristic algorithm is then implemented to a dataset comprises of 20 customers and 5 potential depot facility locations.