Applications – OR and Management Sciences
Optimizing Family Medicine Residency Schedules under the Clinic First Principles
Family medicine residency programs must balance educational and operational requirements while providing residents with consistent exposure to continuity clinics, a central principle of the Clinic First Model. We study the Family Medicine Residency Scheduling problem and develop a binary integer programming (BIP) framework that incorporates Clinic First principles through two criteria: Interleaved Rotation Balancing (IRB), … Read more
Synthetic Population Generation and Georeferenced Household Allocation Via Iterative Proportional Fitting and Integer Programming
Georeferenced synthetic populations are essential inputs for agent-based simulations in epidemiology, transportation, and urban planning, yet existing methods for spatial allocation of households to residences lack formal optimality guarantees. We present a two-stage mathematical framework for generating such populations from publicly available census data. The first stage combines Iterative Proportional Fitting (IPF) with a mixed-integer … Read more
Case-Pack Allocation in Retail Distribution Networks
Many retail distribution networks use a hierarchical structure in which regional distribution centers replenish local distribution centers that are closer to customers. In such networks, products are often shipped in large quantities, as case packs, cases or pallets, to the regional distribution center, whereas local distribution centers may require quantities at the individual-unit level. Case … Read more
Congressional Apportionment
This book chapter is a gentle introduction to the mathematics of congressional apportionment. It emphasizes the connections between mathematical optimization and the classical apportionment methods (e.g., Jefferson, Adams, Hamilton, Webster, Huntington-Hill, Dean). CitationPrepared for a forthcoming book edited by Bruce Golden and Doug ShierArticleDownload View PDF
Beyond Isolated Operating Rooms: Risk-Aware Surgical Episode Scheduling in Single-Entry Networks
Long wait times for elective surgery are a persistent challenge in publicly funded health systems, where hospitals must coordinate limited capacity before, during, and after the operation under considerable uncertainty. We study how a network of collaborating hospitals, such as the University Health Network in the City of Toronto, can centralize intake and jointly schedule … Read more
An Exact Branch-and-Cut Method for the Asymmetric Orienteering Problem with Terrain-Driven Fatigue
We present an end-to-end computational framework for provably optimal route planning in orienteering races on real terrain. The framework consists of a GIS pipeline that combines International Orienteering Federation (IOF) map symbols, a digital elevation model (DEM), and the Minetti metabolic model into a fully asymmetric cost matrix, where directional slope costs and cumulative fatigue … Read more
Exact Branch-and-Price Algorithm for Live Operating Room Reoptimization
Live reoptimization of operating room schedules is required to cope with disruptions such as emergency arrivals and deviations in surgery durations under strict time limits. The resulting problem can be formulated as a large-scale Resource Constrained Project Scheduling Problem (RCPSP). While exact optimization methods are attractive in this context due to their ability to provide … Read more
Optimal Batching and In-Building Delivery Routing with Capacitated Residential Parcel Lockers
Residential parcel lockers (RPLs), unlike their public counterparts, facilitate secure parcel delivery to occupants of private apartment and condominium buildings in urban areas. In this work, we consider the perspective of a last-mile parcel carrier that has access to an RPL in the lobby of a high-rise residential building. Motivated by growing e-commerce demand, we … Read more