A two-stage optimization approach for selecting electric-flight airports

The decarbonization of short-haul air transport has gained increasing attention, with electric aircraft emerging as a promising alternative to conventional short-haul aviation. However, given the substantial investment anticipated for the necessary infrastructure, a strategic and globally coordinated selection of airports is imperative. The aim of this paper is to address this problem and determine the … Read more

Final Exam Scheduling at Bucknell University: A Case Study and Open-Source Tool

Problem Definition: Final exam scheduling is a common but challenging optimization problem. At Bucknell University, a small liberal arts institution, the problem is particularly complex and has historically required the Registrar’s Office to spend months manually designing an exam schedule each semester. Methodology: We worked in close collaboration with the Registrar’s Office. First, we created … Read more

A Multivariate Loss Ratio Approach for Systemic Risk Measurement and Allocation

The primary challenges in systemic risk measurement involve determining an overall reserve level of risk capital and allocating it to different components based on their systemic relevance. In this paper, we introduce a multivariate loss ratio measure (MLRM), which is the minimum amount of capital to be injected into a financial system such that the … Read more

A Traveling Salesman Problem with Drone Stations and Speed-Optimized Drones

With e-commerce expanding rapidly, last-mile delivery challenges have been exacerbated, necessitating innovative logistics to reduce operational costs and improve delivery speed. This paper investigates a traveling salesman problem with drone stations, where a truck collaborates with multiple drones docked at candidate drone stations to serve customers. In contrast to existing studies that typically assume fixed … Read more

Isotonic Optimization with Fixed Costs

This paper introduces a generalized isotonic optimization framework over an arborescence graph, where each node incurs state-dependent convex costs and a fixed cost upon strict increases. We begin with the special case in which the arborescence is a path and develop a dynamic programming (DP) algorithm with an initial complexity of $O(n^3)$, which we improve … Read more

Assessing Green Hydrogen Production via Offshore Wind in the Dutch North Sea: Complementing Techno-Economic Simulation With Machine Learning and Optimization

As countries seek to decarbonize their energy systems, green hydrogen has emerged as a promising energy carrier. This paper studies the production of green hydrogen from offshore wind in the Dutch North Sea, with particular emphasis on understanding how system design decisions and uncertain parameters affect key performance indicators. The analysis builds on a detailed … Read more

Integrated Bus Fleet Electrification Planning Through Accelerated Logic-Based Benders Decomposition and Restriction Heuristics

To meet sustainability goals and regulatory requirements, transit agencies worldwide are planning partial and complete transitions to electric bus fleets. This paper presents the first comprehensive and computationally efficient multi-period optimization framework integrating the key planning decisions necessary to support such electrification initiatives. Our model, formulated as a two-stage integer program with integer subproblems, jointly … Read more

A Data-Driven County-Level Budget Allocation Model for Opioid Crisis Management: Insights from West Virginia

The opioid crisis has remained a major public health challenge in the United States for many years. This study develops a data-driven decision support framework to guide policymakers in allocating county-level budgets across multiple expenditure categories in order to address the opioid crisis. We compile and curate a detailed dataset on fiscal policy and opioid-related … Read more

An exact approach for the Train Single-Routing Selection Problem

Given a set of train routes with route costs and a set of compatible route pairs with pairing costs, the Train Single-Routing Selection Problem (TSRSP) seeks to assign one route to each train, minimizing the total cost while ensuring pairwise compatibility among the selected routes. This problem is of significant practical relevance in rail traffic … Read more