Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.02439 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911176911224832 |
|---|---|
| author | Silva, Warley Almeida Carvalho, Margarida Jena, Sanjay Dominik |
| author_facet | Silva, Warley Almeida Carvalho, Margarida Jena, Sanjay Dominik |
| contents | Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. 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 show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behaviour. 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, since 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_02439 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dynamic Facility Location under Cumulative Customer Demand Silva, Warley Almeida Carvalho, Margarida Jena, Sanjay Dominik Optimization and Control Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. 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 show that one of them has a tighter continuous relaxation and allows the representation of more general customer demand behaviour. 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, since 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. |
| title | Dynamic Facility Location under Cumulative Customer Demand |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2405.02439 |