A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An Efficient Hybrid CS and K-Means Algorithm for the Capacitated PMedian Problem
[article]
2014
arXiv
pre-print
Capacitated p-median problem (CPMP) is an important variation of facility location problem in which p capacitated medians are economically selected to serve a set of demand vertices so that the total assigned demand to each of the candidate medians must not exceed its capacity. This paper surveys and analyses the combination of Cuckoo Search and K-Means algorithms to solve the CPMP. In order to check for quality and validity of the suggestive method, we compared the final solution produced over
arXiv:1406.7473v1
fatcat:ys5gkfsjzrahpmv45udvtqpbky