The dynamic p-median problem with mobile facilities

Guden H., SÜRAL H.

COMPUTERS & INDUSTRIAL ENGINEERING, vol.135, pp.615-627, 2019 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 135
  • Publication Date: 2019
  • Doi Number: 10.1016/j.cie.2019.06.024
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.615-627
  • Keywords: Location, The p-median problem, Branch and price, Mobile facilities, PLANT LOCATION-PROBLEMS, ALGORITHM, RELOCATION, NETWORK, MODELS, HEURISTICS, DESIGN
  • Middle East Technical University Affiliated: Yes


Being motivated by real life applications in construction management, we consider the dynamic p-median problem and its extension with mobile facilities. The number of facilities changes over a planning horizon where one or more facilities can be opened, relocated, or closed in any period. The problem is to determine (i) facility locations, (ii) opening/closing times of facilities, (iii) routes of mobile facilities, and (iv) demand allocations to open facilities such that the total cost is minimized. We present a mixed integer programming formulation of the dynamic p-median problem using discretization of distances to control the locational decision variables. We develop a branch and price algorithm and constructive heuristics to solve the problem. Extensive computational results of the solution method are provided on a set of test problem instances.