a surplus-maximizing two-sided multi-period non-convex iso auction market

Since the inception of ISOs, Locational Marginal Prices (LMPs) alone were not market clearing or incentive compatible because an auction winner who offered its avoidable costs could lose money at the LMPs. ISOs used make-whole payments to ensure that market participants did not lose money. Make-whole payments were not public, creating transparency issues. Over time, … Read more

Mixed-Integer Optimization for Responsible Machine Learning

In the last few decades, Machine Learning (ML) has achieved significant success across domains ranging from healthcare, sustainability, and the social sciences, to criminal justice and finance. But its deployment in increasingly sophisticated, critical, and sensitive areas affecting individuals, the groups they belong to, and society as a whole raises critical concerns around fairness, transparency, … Read more

Paving the Way for More Accessible Cancer Care in Low-Income Countries with Optimization

Cancers are a growing cause of morbidity and mortality in low-income countries. Geographic access plays a key role in both timely diagnosis and successful treatment. In areas lacking well-developed road networks, seasonal weather events can lengthen already long travel times to access care. Expanding facilities to offer cancer care is expensive and requires staffing by … Read more

A data-driven robust approach to a problem of optimal replacement in maintenance

Maintenance strategies are pivotal in ensuring the reliability and performance of critical components within industrial machines and systems. However, accurately determining the optimal replacement time for such components under stress and deterioration remains a complex task due to inherent uncertainties and variability in operating conditions. In this paper, we propose a comprehensive approach based on … Read more

A Decision Diagram Approach for the Parallel Machine Scheduling Problem with Chance Constraints

The Chance-Constrained Parallel Machine Scheduling Problem (CC-PMSP) assigns jobs with uncertain processing times to machines, ensuring that each machine’s availability constraints are met with a certain probability. We present a decomposition approach where the master problem assigns jobs to machines, and the subproblems schedule the jobs on each machine while verifying the solution’s feasibility under … Read more

Data-driven robust menu planning for food services: Reducing food waste by using leftovers

With food waste levels of about 30%, mostly caused by overproduction, reducing food waste poses an important challenge in the food service sector. As food is prepared in advance rather than on demand, there is a significant risk that meals or meal components remain uneaten. Flexible meal planning can promote the reuse of these leftovers … Read more

Arc-Based Dynamic Discretization Discovery for Continuous-Time Service Network Design

In the continuous time service network design problem, a freight carrier decides the path of shipments in their network as well as the dispatch times of the vehicles transporting the shipments. State-of-the-art algorithms to solve this problem are based on the dynamic discretization discovery framework. These algorithms solve a relaxation of the problem using a … Read more

Time Complexity and Optimality of Inventory and Production Policies for a Dynamic Lot Sizing Model with Remanufacturing and Separate Setup Costs

In this paper, we consider a dynamic lot sizing model with remanufacturing having m types of cores. The model also allows manufacturing. We consider separate setup costs for manufacturing and remanufacturing in our model. It is conjectured in [15], with reference to [18], that finding an optimal policy to the model when there is separate … Read more

Recursive Partitioning and Batching for Network Design with Service Time Guarantees at Massive Scale

Motivated by the parcel delivery industry, we study a network design problem with service time guarantees at industrial scale. This tactical service network design problem determines primary paths and delivery schedules for commodities to minimize transportation and handling costs while ensuring committed service times. To construct a solution for a real-world instance with over 1,000 … Read more

Cost allocation in maintenance clustering

Inspired by collaborative initiatives in the military domain, we analyze a setting in which multiple different players (e.g., Ministries of Defence) have to carry out preventive maintenance jobs. Each player is responsible for one job, with a job-specific minimal frequency and with maintenance costs, consisting of a job-specific variable component and a fixed component, which … Read more