SearcharxivSearch

arXiv subjects

Clara Novoa

Publications and source records attributed to Clara Novoa.

2 recordsLinked to original sources

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

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.

math.OC

GPU-accelerated Parallel Solutions to the Quadratic Assignment Problem

The Quadratic Assignment Problem (QAP) is an important combinatorial optimization problem with applications in many areas including logistics and manufacturing. QAP is known to be NP-hard, a computationally challenging problem, which requires the use of sophisticated heuristics in finding acceptable solutions for most real-world data sets. In this paper, we present GPU-accelerated implementations of a 2opt and a tabu search algorithm for solving the QAP. For both algorithms, we extract parallelism at multiple levels and implement novel code optimization techniques that fully utilize the GPU hardware. On a series of experiments on the well-known QAPLIB data sets, our solutions, on average run an order-of-magnitude faster than previous implementations and deliver up to a factor of 63 speedup on specific instances. The quality of the solutions produced by our implementations of 2opt and tabu is within 1.03% and 0.15% of the best known values. The experimental results also provide key insight into the performance characteristics of accelerated QAP solvers. In particular, the results reveal that both algorithmic choice and the shape of the input data sets are key factors in finding efficient implementations.

cs.DC