Document Type

Article

Publication Date

8-2016

Subject: LCSH

Heuristic algorithms

Disciplines

Industrial Engineering | Mechanical Engineering

Abstract

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 stand-alone rolling horizon and accelerated Benders decomposition algorithms in the experimental range.

Comments

This is the authors' accepted manuscript of the article published in Computers & Industrial Engineering. The version of record can be found at http://dx.doi.org/10.1016/j.cie.2016.06.029 .

DOI

10.1016/j.cie.2016.06.029

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Publisher Citation

Marufuzzaman, M., Gedik, R., & Roni, M. S. (2016). A Benders based rolling horizon algorithm for a dynamic facility location problem. Computers & Industrial Engineering, 98, 462-469

Available for download on Saturday, June 29, 2019

Share

COinS