Abstract

In this study, an Artificial Bee Colony (ABC) based clustering algorithm is proposed for solving continuous multiple facility location problems. Unlike the original version applied to multivariate data clustering, the ABC based clustering here solves the two-dimensional clustering. On the other hand, the multiple facility location problem the proposed clustering algorithm deals with is aimed to find site locations for healthcare wastes. After applying ABC based clustering algorithm on test data, a real-world facility location problem is solved for identifying healthcare waste disposal facility locations for Istanbul Municipality. Geographical coordinates and healthcare waste amounts of Istanbul hospitals are used to decide the locations of sterilization facilities to be established for reducing the medical waste generated. ABC based clustering is performed for different number of clusters predefined by Istanbul Metropolitan Municipality, and the total cost—the amount of healthcare waste produced by a hospital, multiplied by its distance to the sterilization facility—is calculated to decide the number of facilities to be opened. Benchmark results with four algorithms for test data and with two algorithms for real world problem reveal the superior performance of the proposed methodology.

Highlights

  • Facility Location Problem (FLP) is defined by Tavakkoli and Shayan (1998) as “locating n facility to m locations (n

  • Benchmark clustering algorithms used to compare with the performance of Artificial Bee Colony (ABC) are Fuzzy C-Means (FCM), Center of Gravity integrated Fuzzy C-Means (FCM-COG), Self-Organizing Maps (SOM), and Center of Gravity integrated Self Organizing Maps (SOM-COG)

  • FCM clustering is applied using the program developed by Balasko et al (2005) for MATLAB, and SOM clustering is established with SOM Toolbox of MATLAB developed by Alhoneimi et al (2000)

Read more

Summary

Introduction

Facility Location Problem (FLP) is defined by Tavakkoli and Shayan (1998) as “locating n facility to m locations (n

Objectives
Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call