This paper introduces the Hierarchical Facility Location-Inventory-Routing Problem (HFLIRP) within a supply chain network design setting, involving both strategic and tactical level decisions. The strategic level considers locating distribution centers (DCs), locating and sizing retail branches (RBs), and determining DC–RB assignments. The tactical level addresses inventory routing for daily distributions. To tackle the HFLIRP, we first formulate a Mixed-Integer Non-Linear Programming (MINLP) model that aims to maximize the demand covered under the gradual coverage assumption, which also allows for the joint coverage of demand nodes by multiple facilities. Next, we propose a two-stage solution methodology that decomposes the problem into two sub-problems. The first sub-problem focuses on the strategic decisions of DC and RB locations and their assignments, utilizing a tangent line approximation (TLA) approach for linearization. The second sub-problem leverages the strategic decisions to minimize inventory routing costs, modeled as an Inventory Routing Problem (IRP). We carry out extensive numerical experiments to assess the performance of the two-stage solution approach against the original formulation across various problem instances. Our results demonstrate that the two-stage method is capable of achieving high-quality solutions within reasonable computational times.
Bayat, Büşra Sultan, Yakıcı, Ertan, Eriskin, Levent et al. Hierarchical facility location-inventory-routing problem for maximal joint and gradual coverage. // Operational Research. – 2026. – DOI: 10.1007/s12351-026-01095-4. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12351-026-01095-4
Bayat, Büşra Sultan, Yakıcı, Ertan, Eriskin, Levent, Karatas, & Mumtaz (2026). Hierarchical facility location-inventory-routing problem for maximal joint and gradual coverage. Operational Research. https://doi.org/10.1007/s12351-026-01095-4
Bayat, et al. “Hierarchical facility location-inventory-routing problem for maximal joint and gradual coverage.” Operational Research, 2026. doi:10.1007/s12351-026-01095-4.
@article{Bayat2026,
title = {Hierarchical facility location-inventory-routing problem for maximal joint and gradual coverage},
author = {Bayat and Sultan, Büşra and Yakıcı and Ertan and Eriskin and Levent and Karatas and Mumtaz},
journal = {Operational Research},
year = {2026},
doi = {10.1007/s12351-026-01095-4},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12351-026-01095-4}
}
Effective teamwork depends on teams’ ability to coordinate time. Although research distinguishes between explicit and implicit forms of team temporal coordination, relatively little is known about how these mechanisms interact to...
The Queen Elisabeth Competition is a renowned international music competition that identifies and promotes exceptional classical musicians. In each of the three rounds, a panel of judges gives numerical scores to candidates. The rule of...
In large-scale group decision making (LSGDM), traditional clustering methods typically rely on a single distance metric, ignoring both intra-cluster compactness and inter-cluster separation, and often fail to adaptively determine the...
Group decision-making (GDM) under social networks faces challenges from asymmetric interactions among decision-makers (DMs) and unconnected components. This paper proposes a consensus-reaching mechanism based on directed...
Small and medium-sized enterprises (SMEs) contribute to economic growth, employment, and innovation, yet many in fragile economies struggle to sustain financial performance. This study examines the direct relationships between...