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

Journal Article · 28 June 2016 · Computers and Industrial Engineering

DOI: https://doi.org/10.1016/j.cie.2016.06.029 · OSTI ID:1358420

Marufuzzaman,, Mohammad ^[1]; Gedik, Ridvan ^[2]; Roni, Mohammad S. ^[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)

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.

• Research Organization: Idaho National Laboratory, Idaho Falls, ID (United States)
• Sponsoring Organization: USDOE Office of Nuclear Energy (NE)
• Grant/Contract Number: AC07-05ID14517
• OSTI ID: 1358420
• Report Number(s): INL/JOU--15-34568; PII: S0360835216302248
• Journal Information: Computers and Industrial Engineering, Journal Name: Computers and Industrial Engineering Journal Issue: C Vol. 98; ISSN 0360-8352
• Country of Publication: United States
• Language: English