Publication Details |
Category | Text Publication |
Reference Category | Journals |
DOI | 10.1016/j.cie.2025.111524 |
Licence ![]() |
|
Title (Primary) | How customer choice shapes network structure over multiple periods |
Author | Esmaeili Aliabadi, D.
![]() |
Source Titel | Computers & Industrial Engineering |
Year | 2025 |
Department | BIOENERGIE |
Volume | 210 |
Page From | art. 111524 |
Language | englisch |
Topic | T5 Future Landscapes |
Keywords | Network design; Restructuring; Equilibrium; Relocation; Bi-level; Mathematical problem with equilibrium constraints |
Abstract | The last pandemic led to tectonic changes in the business world. Some brands considered moving towards closing stores and offering pure online retailing by adding fulfillment centers to their supply chains. In contrast, others opened new stores as they found consumers craving to return to stores. This has made an unprecedented shift in retail business models and introduced a set of new challenges to retailers. One of these problems is to devise plans to close some stores and open new ones over several periods. In this paper, we deal with the problem of finding a timed reconfiguration plan of a retailer’s network as a bi-level optimization model with integer variables on both levels. The firm attempts to maximize the total profit over the planning horizon on the upper level. On the lower level, customers try to find solutions to minimize the total incurred cost given their utility functions. To solve the proposed model, we develop a sequential bargaining strategy, which assumes the firm has partial information about customers’ utility functions. Using a set of test problems, we demonstrate that the firm and customers can reach equilibrium (i.e., a sustainable agreement) using the developed strategy while not sharing sensitive information. |
Persistent UFZ Identifier | https://www.ufz.de/index.php?en=20939&ufzPublicationIdentifier=27581 |
Esmaeili Aliabadi, D., van Woensel, T. (2025): How customer choice shapes network structure over multiple periods Comput. Ind. Eng. 210 , art. 111524 10.1016/j.cie.2025.111524 |