CHENG-NAN KANGLING-CHIEH KUNGChiang, Po HsuanPo HsuanChiangJIUN-YU YU2023-03-302023-03-302023-03-0103608352https://scholars.lib.ntu.edu.tw/handle/123456789/629885Most facility location models do not take customer preferences into account, and are therefore inadequate for application in service facilities. We construct a model to capture customer preferences and maximize the number of customers served. Given a set of open facilities, customers will choose facilities based on their individual preferences. As the problem is NP-hard, we design a heuristic algorithm based on maximum flow. A numerical study demonstrates the algorithm's average performance and general applicability.enApproximation algorithm | Capacitated facility location | Customer preference | Maximum flow[SDGs]SDG9journal article10.1016/j.cie.2023.1090702-s2.0-85147429806https://api.elsevier.com/content/abstract/scopus_id/85147429806