Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.22218

A Two-Stage Stochastic Optimization Framework for Environmentally Sensitive Oil Spill Response Resource Allocation in the Arctic

Md Ashiqur Rahman·Mustofa Tanbir Kuhel·Clara Novoa
View original source ↗Read source document ↗Export metadata ↓

Abstract

The risk of oil spills in the Alaskan Arctic has become an urgent environmental and logistical concern as maritime traffic increases under climate driven sea ice retreat. Traditional deterministic response planning models fail to represent key uncertainties, including variable spill magnitudes, changing environmental sensitivity, and infrastructure limitations. This study develops a two-stage stochastic mixed integer linear programming framework that jointly optimizes the location of oil spill response stations and the allocation of heterogeneous resources across multiple probabilistic spill scenarios. The model integrates a weighted objective that combines spill volume, environmental sensitivity index (ESI), response time, and costs for station setup, deployment, and inter station transfer. Separate importance weights for coverage and cost, together with internal ecological weights, allow decision makers to balance ecological protection and operational efficiency. Data was compiled from Alaska Department of Environmental Conservation spill records and National Oceanic and Atmospheric Administration ESI layers and are converted into model ready scenarios through harmonization and sampling. The model is solved with the Gurobi optimizer, and sensitivity analysis is performed over 324 combinations of importance and ecological weights. Results show about a 35.45% percent improvement in response effectiveness over deterministic methods, as confirmed by the value of the stochastic solution, and reveal clear tradeoffs between cost and ecological coverage. The framework provides a data driven decision support tool for Arctic emergency planners that simultaneously accounts for uncertainty, environmental sensitivity, and realistic logistical constraints.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Md Ashiqur Rahman, Mustofa Tanbir Kuhel, Clara Novoa. 2025-11-27. A Two-Stage Stochastic Optimization Framework for Environmentally Sensitive Oil Spill Response Resource Allocation in the Arctic. https://arxiv.org/abs/2511.22218

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗