A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand

Alper Murat, Gilbert Laporte, Vedat Verter

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

This paper describes the development of an exact allocation-based solution algorithm for the facility location and capacity acquisition problem (LCAP) on a line with dense demand data. Initially, the n-facility problem on a line is studied and formulated as a dynamic programming model in the allocation decision space. Next, we cast this dynamic programming formulation as a two-point boundary value problem and provide conditions for the existence and uniqueness of solutions. We derive sufficient conditions for non-empty service regions and necessary conditions for interior facility locations. We develop an efficient exact shooting algorithm to solve the problem as an initial value problem and illustrate on an example. A computational study is conducted to study the effect of demand density and other problem parameters on the solutions.

Original languageEnglish
Pages (from-to)1-15
Number of pages15
JournalComputers and Operations Research
Volume71
DOIs
Publication statusPublished - 1 Jul 2016

Keywords

  • Capacity acquisition
  • Dynamic programming
  • Location-allocation problem
  • Shooting algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand'. Together they form a unique fingerprint.

Cite this