Cost surfaces are a crucial aspect of route optimization and least cost path (LCP) calculations and are used in awide range of disciplines including computer science, landscape ecology, and energy-infrastructure modeling. Linear features present akey weakness to traditional routing calculations along cost surfaces because they cannot identify whether moving from acell to its adjacent neighbors constitutes crossing alinear barrier (increased cost) or following acorridor (reduced cost). Following and avoiding linear features can drastically change predicted routes. We introduce an approach to address this adjacency issue using asearch kernel that identifies these critical barriers and corridors. We have built this approach into anew Java-based open-source software package– CostMAP (cost surface multi-layer aggregation program)– which calculates cost surfaces and cost networks using the search kernel. CostMAP allows users to input multiple GIS data layers and to set weights and rules for developing aweighted-cost network. We compare CostMAP performance with traditional cost surface approaches and show significant performance gains– both following corridors and avoiding barriers– by modeling the movement of alarge terrestrial animal– the Baird’s Tapir (Tapirus bairdii)– in amovement ecology framework and by modeling pipeline routing for carbon capture and storage (CCS).

Carbon Capture and Storage (CCS) is a critical technology for reducing anthropogenic CO₂ emissions, but its large-scale deployment is complicated by uncertainties in geological storage performance. These uncertainties pose significant financial and operational risks, as underperforming storage sites can lead to costly infrastructure modifications, inefficient pipeline routing, and economic shortfalls. To address this challenge, we propose a novel optimization workflow that is based on mixed-integer linear programming and explicitly integrates probabilistic modeling of storage uncertainty into CCS infrastructure design. This workflow generates multiple infrastructure scenarios by sampling storage capacity distributions, optimally solving each scenario using a mixed-integer linear programming model, and aggregating results into a heatmap to identify core infrastructure components that have a low likelihood of underperforming. A risk index parameter is introduced to balance trade-offs between cost, CO₂ processing capacity, and risk of underperformance, allowing stakeholders to quantify and mitigate uncertainty in CCS planning. Applying this workflow to a CCS dataset from the US Department of Energy’s Carbon Utilization and Storage Partnership project reveals key insights into infrastructure resilience. Reducing the risk index from $15\%$ to $0\%$ is observed to lead to an $83.7\%$ reduction in CO₂ processing capacity and a $77.1\%$ decrease in project profit, quantifying the trade-off between risk tolerance and project performance. Furthermore, our results highlight critical breakpoints, where small adjustments in the risk index produce disproportionate shifts in infrastructure performance, providing actionable guidance for decision-makers. Unlike prior approaches that aimed to cheaply repair underperforming infrastructure, our workflow constructs robust CCS networks from the ground up, ensuring cost-effective infrastructure under storage uncertainty. These findings demonstrate the practical relevance of incorporating uncertainty-aware optimization into CCS planning, equipping decision-makers with a tool to make informed project planning decisions.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.