This paper presents two novel Benders decomposition algorithms and one rolling horizon heuristics to efficiently solve the DFLP in which facility (re)location ...

This is an accepted manuscript of a paper intended for publication in a journal. This document was prepared as an account of work sponsored by.

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the ...

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining ...

We study capacitated dynamic facility location problem (DFLP).We propose a heuristic, a pure and a hybrid Benders algorithm to solve the DFLP.

Aug 1, 2016 · This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost ...

A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation.

To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an accelerated ...

Dive into the research topics of 'A Benders based rolling horizon algorithm for a dynamic facility location problem'. Together they form a unique fingerprint.

We study a well-known capacitated dynamic facility location problem (DFLP) where facilities are assumed to provide finite amount of goods to meet ...