Research Article Open Access

An Efficient Algorithm for Capacitated Multifacility Location Problems

Chansiri Singhtaun and Peerayuth Charnsethikul

Abstract

In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques is developed. The numerical experiments are randomly generated to test efficiency of the proposed algorithm compared with a linearization algorithm. The results show that the proposed algorithm provides a better solution on average with less processing time for all various sizes of problems.

Journal of Computer Science
Volume 3 No. 8, 2007, 583-591

DOI: https://doi.org/10.3844/jcssp.2007.583.591

Submitted On: 26 July 2007 Published On: 31 August 2007

How to Cite: Singhtaun, C. & Charnsethikul, P. (2007). An Efficient Algorithm for Capacitated Multifacility Location Problems. Journal of Computer Science, 3(8), 583-591. https://doi.org/10.3844/jcssp.2007.583.591

  • 2,258 Views
  • 1,886 Downloads
  • 1 Citations

Download

Keywords

  • Multifacility location problem
  • Minimizing concave function
  • Quadratic integer programming Problem
  • Extreme point ranking method