A two-stage method for the capacitated multi-facility location-allocation problem

Chandra Irawan, Martino Luis, Arif Imran

Research output: Contribution to journalArticlepeer-review

32 Downloads (Pure)

Abstract

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 Two, 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 data sets 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.
Original languageEnglish
JournalInternational Journal of Operational Research
Volume35
Issue number3
DOIs
Publication statusPublished - 23 Jul 2019

Keywords

  • capacitated
  • continous location problem
  • heuristics
  • variable neighbourhood search

Fingerprint

Dive into the research topics of 'A two-stage method for the capacitated multi-facility location-allocation problem'. Together they form a unique fingerprint.

Cite this