We present a multiexchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+ 2√2− and 3+ 2√2+ for any given constant > 0. The pr...

This thesis is a critical investigation into the development, application and evaluation of ant colony optimisation metaheuristics, with a view to solving a class of capacitated facility location problems. The study is comprised of three phases. The first sets the scene and motivation for research, which includes; key concepts of ant colony optimisation, a review of published academic materials...

Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....

In today’s systems and networks, disruption is inevitable. Designing a reliable system to overcome probable facility disruptions plays crucial role in planning management. This article proposes capacitated joint inventory-location problem where location-independent may occur facilities. The tries satisfy customer’s demands considers penalty costs for unmet customer demand. aims minimize total s...