FT-KMEANS: a fast algorithm for fault-tolerant facility location

Baumann, Philipp (2022). FT-KMEANS: a fast algorithm for fault-tolerant facility location. In: Proceedings of the 2022 IEEE International Conference on Industrial Engineering and Engineering Management. 10.1109/IEEM55944.2022.9989850

Text FT-KMEANS_A_Fast_Algorithm_For_Fault-Tolerant_Facility_Location.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (1MB) | Request a copy

The design of supply networks that are resilient to disruptions has recently attracted considerable attention. We consider supply networks where a set of clients are served from a set of facilities. The cost of serving a client from a facility is proportional to the distance between the client and the facility. When a facility becomes unavailable due to a disruption, its clients are reassigned to the closest facility that is still operating. The network is resilient when disruptions cause only moderate reassignment costs. One way to design a resilient network is to solve the fault-tolerant k-median problem. Under this problem, a set of k facilities (medians) must be located such that the sum of distances from clients to their r nearest facilities is minimized. This paper introduces a new algorithm for large-scale instances of this problem. Using a benchmark instance with close to 10,000 clients, we demonstrate that our heuristic consistently devises better solutions than the state-of-the-art approach in much shorter running times.

Interest & Impact

Downloads

1 since deposited on 23 Jan 2023
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item