skip to main content


Title: A Benders based rolling horizon algorithm for a dynamic facility location problem

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the time period for opening, closing, or retaining an existing facility in a given location. To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an accelerated Benders decomposition algorithm. Extensive computational experiments are performed on benchmark test instances to evaluate the hybrid algorithm’s efficiency and robustness in solving the DFLP problem. Computational results indicate that the hybrid Benders based rolling horizon algorithm consistently offers high quality feasible solutions in a much shorter computational time period than the standalone rolling horizon and accelerated Benders decomposition algorithms in the experimental range.
 [1] ;  [2] ;  [3]
  1. Mississippi State Univ., Starkville, MS (United States)
  2. Univ. of New Haven, West Haven, CT (United States)
  3. Idaho National Lab. (INL), Idaho Falls, ID (United States)
Publication Date:
Report Number(s):
Journal ID: ISSN 0360-8352; PII: S0360835216302248
Grant/Contract Number:
Accepted Manuscript
Journal Name:
Computers and Industrial Engineering
Additional Journal Information:
Journal Volume: 98; Journal Issue: C; Journal ID: ISSN 0360-8352
Research Org:
Idaho National Lab. (INL), Idaho Falls, ID (United States)
Sponsoring Org:
USDOE Office of Nuclear Energy (NE)
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; Dynamic facility location problem; Benders decomposition algorithm
OSTI Identifier: