---
title: Flow Refuelling-Location Model (FRLM)
url: https://www.emergentmind.com/topics/flow-refuelling-location-model-frlm
type: topic
---

# Flow Refuelling-Location Model (FRLM)

The Flow Refuelling-Location Model (FRLM) is a class of combinatorial optimization models formulated to guide the strategic placement of alternative-fuel refueling stations (AFSs) in transportation networks. The paradigm ensures that vehicles—typically with limited driving range—have refueling opportunities sufficient to complete designated trips, subject to operational and demand-side constraints. FRLM variants underpin planning for electric vehicle (EV) charging, hydrogen fueling, and other alternative-fuel infrastructure, and encompass a spectrum of mathematical, algorithmic, and network-geometric generalizations.

## 1. Canonical Formulation: Problem Definition and Model Structure

The classical FRLM, as originally proposed by Kuby and Lim (2005) and developed in subsequent works, is defined on a spatial network $G=(V,E)$, where $V$ is a set of nodes (e.g., intersections, candidate sites) and $E$ is a set of edges (e.g., road segments). The principal objective is to site the minimum number or cost of refueling stations such that a prescribed collection of vehicle flows, usually represented as origin–destination (O–D) pairs or looped routes, are "covered": that is, every trip along each flow can be partitioned into legs, none exceeding a technology-determined driving range $R$, with refueling available at the endpoints of each leg.

There are several canonical FRLM problem classes depending on how coverage, flow structure, and capacity are modeled:

- **Deterministic FRLM (DFRLM):** Maximizes the volume of flows covered or minimizes the number/cost of stations, assuming homogeneous driving range and fixed candidate locations [2109.14358].
- **Multi-path and Deviation FRLM:** Allows vehicles to utilize multiple feasible paths (including non-shortest or detour paths) between O–D pairs, often precomputing several $k$-shortest paths per pair [1805.06068, 2509.11441].
- **Continuous-space FRLM:** Permits station siting at any point on an edge, subsequently reduced to a finite dominating set (FDS) via coverage geometry [2509.11441].
- **Capacitated FRLM:** Incorporates hard capacity constraints on station throughput, usually requiring joint location–sizing optimization [2109.14358, 2310.05569, 2402.14263].
- **Stochastic and Probability-weighted FRLM:** Weights O–D demand by adoption or risk probability, explicitly maximizing expected system-wide coverage [1805.06068].

Key variables typically include binary station-placement decisions at candidate sites, flow-covering indicators for each O–D pair or path, and, in capacitated versions, integer variables for the number of refueling units per station.

## 2. Coverage Constraints, Geometric Generalizations, and the FDS Approach

Coverage in the FRLM is enforced by constraints ensuring no segment of a covered path exceeds the specified range $R$ without access to a station. In classical models, this induces a set-cover or path-covering structure: all feasible traversals must be "interdicted" by station placements at intervals no longer than $R$. 

A significant generalization is provided by the continuous-space FDS approach [2509.11441], where station locations are initially modeled as lying anywhere on the network (not just discrete nodes). For a fixed set of dedicated closed routes $H=\{U_1,\dots,U_h\}$, each with route length $\ell(U_t)$ and daily flow $f(U_t)$, coverage of $U_t$ by a candidate station $x$ is feasible if:

1. The total round-trip length, including detour to $x$, does not exceed $R$.
2. Deviation from the route to $x$ does not exceed threshold $D$.

Mathematically, define $v^\mathrm{d}_t(x)$ (deviation point on the route) and characterize the feasible "refueling set" $RS(U_t;e)$ of locations $x$ on each edge $e$. The union over all route–edge pairs is finite (≤4 segments per edge & route), and, by Theorem 1 and 2 in [2509.11441], a solution exists among the finite set $EP$ of endpoints—this is a finite dominating set (FDS). Thus, the original infinite candidate space is reduced to a tractable discrete model without loss of optimality.

## 3. Mathematical Programming and Algorithmic Developments

The majority of FRLM variants are formulated as mixed-integer linear programs (MILP or MIP):

- **Vertex covering:** $\min \sum_{i} x_i$, subject to $\sum_{i: a_{wi}=1} x_{i} \ge 1$ for all covered flows ($x_i$ binary station-open variables; $a_{wi}$ coverage indicator) [2509.11441, 2109.14358].
- **Flow conservation & path feasibility:** For multi-path/flow models, variables for refueling at each site along feasible paths, subject to range and flow continuity constraints [1805.06068, 2402.14263].
- **Capacity constraints:** Upper bounds on the flow or number of vehicles serviced at each selected station, resulting in additional knapsack or assignment constraints [2109.14358, 2310.05569, 2402.14263].
- **Reinforced/redundant coverage:** Bilevel models integrating public-sector minimization of uncovered nodes and private-sector maximization of utilization, with redundancy constraints (e.g., each station has a backup within range) [2501.19000].

Solution strategies include:

- **Edge-Scanning (ES) algorithms:** Polynomial-time procedures for computing FDS endpoints in continuous-space variants [2509.11441].
- **Branch-and-cut and branch-cut-and-price:** Advanced decomposition algorithms for solving capacitated and large-scale FRLM models, integrating separation of coverage and capacity cuts, column generation, and dual resource-constrained path pricing [2310.05569].
- **Metaheuristics:** Genetic algorithms for large, NP-hard multi-path or stochastic FRLMs, using fitness functions based on MILP relaxations [1805.06068].

Empirically, computational runtimes are typically polynomial in network size for unconstrained models, but increase by 1–2 orders of magnitude for tight capacity or redundancy requirements [2310.05569]. For moderately sized instances (hundreds of nodes), optimal solutions are usually attainable; for very large networks, hybrid or metaheuristic algorithms provide near-optimal results.

## 4. Extensions: Capacity, Cost, Coverage, and Redundancy

Several research strands have introduced problem enrichments reflecting practical and policy-driven considerations:

- **Capacity-constrained FRLM:** Realistically models limited throughput at stations (charging rate, server count), introducing the need for joint location-and-sizing optimization. Key constraints ensure that the sum of flows assigned to a station does not exceed its capacity. Empirical results emphasize the necessity of carefully distributing capacity to high-traffic nodes to avoid underutilization [2109.14358, 2310.05569, 2402.14263].
- **Minimum coverage and cost-coverage trade-offs:** The minimum coverage FRLM seeks to minimize station installations while guaranteeing fractional flow coverage. Results demonstrate diminishing returns beyond ~70–80% coverage, with total station count growing sharply if absolute coverage is mandated [2109.14358].
- **Location-dependent construction costs:** Incorporating heterogeneous installation costs (urban/rural, local incentives) produces nontrivial spatial patterns in optimal siting solutions, sensitive to cost differentials and budget constraints [2109.14358].
- **Redundancy (reinforced coverage):** Bilevel models ensure each station has backup within range, thus ensuring resilience to single-station failure and enhancing network robustness. Leader–follower structures permit explicit trade-offs between public viability (minimal stations) and private sector utilization (flow-weighted demand) [2501.19000].
- **Stochasticity and probabilistic demand:** Weighting nodes or flows by probability of EV adoption enables expected-value optimization, reflecting spatial heterogeneity in uptake [1805.06068]. Embedding probabilities can shift optimal allocations toward high-adoption areas, with substantial differences observed in empirical studies.

## 5. Practical Applications and Computational Experience

FRLMs have been applied to synthetic benchmarks and real networks, including the Sioux Falls, San Antonio, and Chicago grids [2509.11441, 1805.06068, 2402.14263]. Notable applications include:

- **Urban and inter-city planning:** Multi-scale (macro–meso–micro) hierarchical grid frameworks enable tractable and robust planning for large metropolitan regions, supporting city- and corridor-level deployment [2402.14263].
- **Public transportation and fleet operations:** Dedicated-loop FRLMs serve transit and logistics networks operated by AFVs; detour-permitting models account for allowable off-route refueling [2509.11441].
- **Rollout policy analysis:** Minimum coverage and cost-coverage trade-off studies inform regulatory and subsidy decisions by quantifying marginal coverage gains against infrastructure investment [2109.14358].

Empirical findings repeatedly demonstrate that small increases in vehicle range or allowable detour distance can strongly reduce required station counts and increase solution overlap between routes [2509.11441]. Station utilization rates and coverage efficiency depend crucially on judicious sizing and siting, with diminishing returns for excessive infrastructure in low-demand areas.

## 6. Limitations, Model Generalizations, and Future Research Directions

Several research fronts remain active in the FRLM domain:

- **Class heterogeneity:** Most models assume homogeneous vehicle range $R$ and deviation $D$. Multi-class models, where $R_k$ and $D_k$ vary across vehicle types, require constructing class-specific or combined FDSs, substantially increasing model complexity [2509.11441].
- **Station capacity and queueing:** Many analyses assume unlimited capacity; incorporating finite capacities and endogenous delays yields larger, potentially nonlinear programs, with challenging implications for computational tractability [2109.14358, 2310.05569, 2402.14263].
- **Multiple detour and dynamic deviation models:** Most current models permit at most one allowed detour per refueling; real-world dynamic or repeated deviation strategies remain underexplored [2509.11441].
- **Temporal and uncertainty modeling:** Integration with time-expanded networks and dynamic adoption forecasts (e.g., using ODE-based diffusion models) is emerging as a vital area, especially for infrastructure staged over multi-year horizons and under uncertainty [2402.14263].
- **Scalability:** For very large networks and strict capacity constraints, hybrid decomposition and advanced column-generation/routing heuristics are essential to keep computation tractable [2310.05569].
- **Redundancy and resilience:** Systematic consideration of multi-station redundancy, cascading failures, and repair processes is an open domain with significant policy implications [2501.19000].

An emphasis on rigorous geometric generalization and scalable discrete-continuous reductions (via FDS) remains central for bridging practical requirements with global optimality guarantees, particularly in time-sensitive and real-time operational settings [2509.11441].

Source: https://www.emergentmind.com/topics/flow-refuelling-location-model-frlm