Dynamic Facility Location Under Cumulative Customer Demand

Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. The existing literature commonly assumes that customer demand quantities are defined independently for each time period. In many planning contexts, however, unmet demand carries over to future time periods. Unmet demand at some time periods may, therefore, affect decisions of subsequent time periods. This work studies a novel location problem, where the decision maker places facilities over time to capture cumulative customer demand. We propose two mixed-integer programming formulations for this problem, and we show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behavior. We characterize the computational complexity for this problem and analyze which problem characteristics result in NP hardness. We then propose an exact branch-and-Benders-cut method and show that this method is approximately five times faster, on average, than solving the tighter formulation directly in our computational experiments. Our results also quantify the benefit of accounting for cumulative customer demand within the optimization framework because the corresponding planning solutions perform much better than those obtained by ignoring cumulative demand or employing myopic heuristics. We also draw managerial insights on the quality of service perceived by customers when the provider places facilities under cumulative customer demand. Funding: This work was supported by the Fonds de recherche du Québec [Grant FRQ-Institut de valorisation des données Research Chair], IVADO [Grant FRQ-IVADO Research Chair], and the Natural Sciences and Engineering Research Council of Canada [Grants 2017-05224 and 2024-04051]. Additionally, this work was funded by the Fonds de recherche du Québec - Nature et Technologie [Grant Doctoral Scholarship B2X-328911], and this research was enabled in part by support provided by Calcul Québec and the Digital Research Alliance of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0104 .

Authors

Institutions

Publication Details

Journal
Transportation Science
Published
2025-09-26
DOI
https://doi.org/10.1287/trsc.2025.0104
Citations
3
Primary Topic
Facility Location and Emergency Management
Type
article
Field-Weighted Citation Impact
8.29
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Facility Location Under Cumulative Customer Demand

Margarida Carvalho, Sanjay Dominik Jena, Warley Almeida Silva
3 citations
Transportation Science
Facility Location and Emergency Management
8.29
article

Dynamic Facility Location Under Cumulative Customer Demand

Margarida Carvalho, Sanjay Dominik Jena, Warley Almeida Silva
article en
3 citations

Abstract

Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. The existing literature commonly assumes that customer demand quantities are defined independently for each time period. In many planning contexts, however, unmet demand carries over to future time periods. Unmet demand at some time periods may, therefore, affect decisions of subsequent time periods. This work studies a novel location problem, where the decision maker places facilities over time to capture cumulative customer demand. We propose two mixed-integer programming formulations for this problem, and we show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behavior. We characterize the computational complexity for this problem and analyze which problem characteristics result in NP hardness. We then propose an exact branch-and-Benders-cut method and show that this method is approximately five times faster, on average, than solving the tighter formulation directly in our computational experiments. Our results also quantify the benefit of accounting for cumulative customer demand within the optimization framework because the corresponding planning solutions perform much better than those obtained by ignoring cumulative demand or employing myopic heuristics. We also draw managerial insights on the quality of service perceived by customers when the provider places facilities under cumulative customer demand. Funding: This work was supported by the Fonds de recherche du Québec [Grant FRQ-Institut de valorisation des données Research Chair], IVADO [Grant FRQ-IVADO Research Chair], and the Natural Sciences and Engineering Research Council of Canada [Grants 2017-05224 and 2024-04051]. Additionally, this work was funded by the Fonds de recherche du Québec - Nature et Technologie [Grant Doctoral Scholarship B2X-328911], and this research was enabled in part by support provided by Calcul Québec and the Digital Research Alliance of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0104 .

Transportation ScienceVol. 60(1)
Université du Québec à Montréal (CA), Computer Research Institute of Montréal (CA)
Openalex Percentile: Top 3%
Facility Location and Emergency Management
8.29
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.