This paper examines the capacitated planar multi-facility location-allocation problem, where the number of facilities to be located is specified and each of which has a capacity constraint. A two-stage method is put forward to deal with the problem where in the first stage a technique that discretises continuous space into discrete cells is used to generate a relatively good initial facility configurations. In stage 2, a variable neighbourhood search (VNS) is implemented to improve the quality of solution obtained by the previous stage. The performance of the proposed method is evaluated using benchmark datasets from the literature. The numerical experiments show that the proposed method yields competitive results when compared to the best known results from the literature. In addition, some future research avenues are also suggested.
- Continuous location problem
- Variable neighbourhood search
ASJC Scopus subject areas
- Management Science and Operations Research