Dynamic Stochastic Modular & Mobile Capacity Planning

Updated 23 January 2026

DSMMCP is a dynamic framework that models the allocation of modular, mobile capacity assets under uncertainty with explicit demand and supply volatility.
It employs multistage stochastic programming and adaptive, partially recourse-based decision processes to optimize resource deployment and relocation.
The framework leverages advanced algorithmic methods such as enhanced SDDiP, Benders decomposition, and rolling-horizon strategies to drive cost-efficient and resilient system designs.

Dynamic Stochastic Modular and Mobile Capacity Planning (DSMMCP) is a formal class of resource allocation problems that address the tactical and operational configuration of distributed, modular, and mobile capacity assets under uncertainty. The DSMMCP paradigm captures decision environments ranging from hyperconnected supply chains and urban parcel logistics to modular transit fleets, production-inventory systems, and mobile wireless service platforms. Core features include explicit modeling of demand and/or supply volatility, the (re)allocation and relocation of discrete capacity modules, and the partial or full adaptivity of control decisions in response to realized stochasticity over a multi-period horizon (Liu et al., 16 Jan 2026, Faugère et al., 2020, Malladi et al., 2019, Xia et al., 2024, Wang et al., 2018).

1. Formulation and Architectural Principles

DSMMCP models a network or network-of-networks where capacity is provisioned via modular, often mobile, units (e.g., portable storage, mobile UAVs, modular production pods, autonomous vehicle units). A central module provider (depot or lessor) and a set of geographically distributed sites (facilities, access hubs, hotspots) jointly constitute the decision arena. Key elements include:

Discrete modular units that can be leased, relocated, activated, deactivated, pooled, or returned (Liu et al., 16 Jan 2026, Faugère et al., 2020).
Stochastic and/or partially observed demand processes, often multi-period and scenario-based, characterized by uncertainty in level, location, and timing (Liu et al., 16 Jan 2026, Malladi et al., 2019, Xia et al., 2024).
Multi-stage or two-stage decision structure: First-stage "here-and-now" decisions on deployment/relocation, followed by scenario-based recourse decisions (e.g., assignment to demand, outsourcing, operational flows) (Liu et al., 16 Jan 2026, Faugère et al., 2020, Xia et al., 2024).
Partial adaptivity (revision points): Control over how often and when capacity allocations can be revised, interpolating between static and fully dynamic recourse (Liu et al., 16 Jan 2026).
Constraints capturing module flow balance, deployment cost, spatial and resource restrictions, and network synchronization (e.g., time windows, formation coupling) (Xia et al., 2024, Faugère et al., 2020).

This formalism generalizes and unifies applications such as:

Modular facility and workforce deployments in supply chains (Liu et al., 16 Jan 2026)
Mobile production and inventory systems under non-stationary demand (Malladi et al., 2019)
Dynamic pooled storage and transfer points for parcel logistics (Faugère et al., 2020)
Reconfigurable modular vehicle operations in transit (Xia et al., 2024)
UAV-based mobile service allocation and energy planning (Wang et al., 2018)

2. Mathematical Models and Decision Variables

The DSMMCP class encompasses several canonical mathematical formulations:

A. Partially Adaptive Multistage Stochastic Programs (PAMSSP)

The model in (Liu et al., 16 Jan 2026) minimizes expected multi-period costs: $\min \sum_{n\in\mathcal T} p_n\left( \sum_{j}\sum_{l_1,l_2}c^F_{j\,l_1\,l_2\,n}Y_{j\,l_1\,l_2\,n} + \sum_{j,j'}c^A_{j\,j'\,n}F_{j\,j'\,n} + \sum_{i,j}c^T_{i\,j\,n}X_{i\,j\,n} + \sum_j c^O_n R_{j n}\right)$ subject to demand fulfillment, capacity conservation, module flow, and adaptivity constraints on revision points. Decision variables include the number of modules at each site, levels, relocation movements, assignments to demand, and outsourcing quantities.

B. Two-Stage Stochastic Programs with Benders Decomposition

(Faugère et al., 2020) defines a two-stage program for modular storage in parcel logistics, partitioning deployment/relocation decisions and scenario-specific operational recourse (e.g., parcel pooling, overflow assignment). The model explicitly links first-stage module redistribution to second-stage routing costs and slack penalties.

C. POMDP-based Multi-location Inventory and Production Systems

(Malladi et al., 2019) utilizes a partially observed Markov decision process (POMDP) state space, combining belief states on modulation processes, inventory vectors, and module allocations. Actions include joint transshipment, module relocation, and replenishment, all solved via Bellman recursion or rollout heuristics. The focus here is on the holistic control of both inventory flows and capacity mobility.

D. Stochastic Mixed-Integer Programming for Modular Transit Networks

(Xia et al., 2024) presents stochastic MIP formulations for modular vehicle scheduling, integrating line timetabling, vehicle formation sizing, MAU depot flows, passenger-vehicle coupling, and cross-line MAU circulation. The objective balances passenger and operational costs, and decisions are made over time-slots and demand scenarios.

E. Dynamic Programming for Mobile Service Provision

(Wang et al., 2018) frames dynamic pricing and energy/capacity allocation for UAV-based services via nested Bellman equations, optimizing over discrete hovering/service units and temporal pricing under stochastic arrivals.

3. Algorithmic Solution Methods

DSMMCP instances are typically NP-hard due to their binary, integer, and network constraints, as well as the exponential size of stochastic scenario trees.

Enhanced SDDiP Algorithm

(Liu et al., 16 Jan 2026) proposes an enhanced Stochastic Dual Dynamic Integer Programming (SDDiP) algorithm that leverages:

Strengthened (Pareto-optimal, Lagrangian-relaxed) Benders cuts
Integer-optimality and alternating cut strategies
Aggressive parallelization in both sample-based forward and cut-generating backward passes

Monotonicity properties (as the number of revision points increases, cost is non-increasing) provide structural insight and enable partial adaptivity for reduced complexity.

Rolling-Horizon Decomposition and Valid Inequalities

(Xia et al., 2024) combines an integer L-shaped (Benders) decomposition with rolling-horizon optimization. Valid inequalities (e.g., timetable-window tightening, boarding/transfer eligibility) dramatically reduce master problem size. Each rolling-horizon subproblem is solved to near-optimality by applying Benders cuts and scenario clustering.

Benders, Core-Point and Pareto Cuts

(Faugère et al., 2020) exploits Benders decomposition and Pareto-optimal cuts based on core-point averaging to improve tractability. $\epsilon$ -optimal (early stopping) policies are applied for scalable solutions.

Rollout Heuristics and Piecewise Linear Approximations

(Malladi et al., 2019) introduces low-complexity rollout heuristics built on single-location value function approximations, using convex or piecewise linear representations to enable fast decisions. Policies include joint rollout of stationary-future (RSF), relocations-only (RRO), and lookahead of stationary future (LSF), each trading off solution quality and computational cost.

Nested Dynamic Programming for Local/Global Decomposition

(Wang et al., 2018) nests local dynamic programming profit functions inside global combinatorial deployment problems, exploiting monotonicity (pricing non-decreasing in time, non-increasing in capacity) and closed-form solutions for certain stochastic models to accelerate computation.

4. Empirical Performance and Application Domains

The DSMMCP framework has demonstrated significant efficacy across a range of tested domains:

Application	Model Reference	Reported Cost/Asset Savings
Modular supply chains (modular housing)	(Liu et al., 16 Jan 2026)	~15% cost, up to 20% outsourcing
Urban parcel logistics (access hubs)	(Faugère et al., 2020)	~28% cost, ~26% capacity
Distributed mobile production-inventory	(Malladi et al., 2019)	~41–44% vs. fixed, 10% over transshipment
Modular autonomous transit fleets	(Xia et al., 2024)	~50% fewer units, 30% op. cost
UAV service capacity planning	(Wang et al., 2018)	Structural/analytic, specific savings not stated

Case studies range from real-world modular construction in the US (multi-region, thousands of modules, up to 12-month horizons (Liu et al., 16 Jan 2026)), to a megacity-scale parcel hub network (838+ hubs, 100 scenarios (Faugère et al., 2020)), and Beijing's metropolitan transit (89 stops, thousands of passengers, rolling-horizon implementation (Xia et al., 2024)).

5. Structural Properties and Managerial Insights

Key structural results and managerial implications established in the literature include:

Monotonicity of adaptivity: More frequent revision points never increases cost; partial adaptivity yields most of the value of full dynamism at a fraction of complexity (Liu et al., 16 Jan 2026).
Pooling/relocation value: Capacity mobility and pooled deployment achieve large savings over static or non-mobile configurations, even more than pure transshipment or local flexibility alone (Faugère et al., 2020, Malladi et al., 2019).
Threshold and monotonic policies: Structural solutions (e.g., thresholding optimal capacity split based on arrival rates or demand modulation) guide efficient heuristic or exact algorithms (Wang et al., 2018, Malladi et al., 2019).
Trade-offs in network design: Dynamic modularization both absorbs uncertainty (demand and supply disruptions) and reduces outsourcing/penalty costs; these benefits are preserved under computationally tractable approximations (Liu et al., 16 Jan 2026).
Integration necessity: Integrated approaches (e.g., joint timetabling, vehicle scheduling, and modular allocation) outperform sequential or decoupled workflows (Xia et al., 2024).

6. Generalizations, Limitations, and Extensions

DSMMCP is sufficiently general to be instantiated for:

Storage, production, or service networks with modular, mobile, and relocatable capacity units
Environments with stochastic, partially observed, or adversarial demand and/or supply
Applications requiring real-time or near-real-time adaptive re-optimization (Faugère et al., 2020, Xia et al., 2024)

Identified limitations include:

Scenario tree size and branching limit the horizon/scalability of full multistage modeling; dynamic pruning or additional decomposition may alleviate this (Liu et al., 16 Jan 2026).
Recourse often modeled via continuous-approximation or simplified routing; richer operational models (e.g., explicit VRPs, staff/driver scheduling) represent an extension direction (Faugère et al., 2020, Xia et al., 2024).
Data requirements (probabilistic demand/disruption forecasts) and computational infrastructure for parallel or rolling-horizon algorithms can be substantial.
Extensions to multi-objective settings (e.g., emissions, service levels), real-time revision of adaptation schedules, or integration with live feedback (reinforcement learning) are highlighted as open avenues for research (Liu et al., 16 Jan 2026, Xia et al., 2024).

DSMMCP generalizes classic inventory, facility location, and service-network models by introducing modularity and explicit mobility of capacity. It unifies lines of research in partially observed and adaptive control (via POMDPs and rollout heuristics), two- and multi-stage stochastic programming, and combinatorial network optimization. Active directions include:

Algorithmic advances in SDDiP and Benders decomposition for high-dimensional, large-scenario, and binary-variable models
Rolling-horizon and real-time dynamic adaptation for transit, logistics, and service networks
Data-driven scenario generation and robustification against model error or adversarial uncertainty
Integrated planning of physical and cyber-physical networks under modular-capacitated infrastructure

A plausible implication is that DSMMCP will become increasingly central to the design of resilient, sustainable infrastructure in environments characterized by volatility, modularity, and digital control.