An exact (re)optimization framework for real-time traffic management

In real-time traffic management, a new schedule for the vehicles must be computed whenever a deviation from the current plan is detected, or periodically after some time. If this time interval is relatively small, then each two consecutive instances are likely to be similar. We exploit this aspect to derive an exact reoptimization framework for … Read more

Commodity Prioritized Maximum Dynamic Multi-Commodity Flow Problem

Due to different disasters, natural or men made, world is facing the problem of massive damage of life and property. To save the life of maximum number of evacuees, an efficient evacuation planning is essential. Prioritization is the process of deciding the relative importance or urgency of things or objects. It helps to focus on … Read more

Planar Maximum Coverage Location Problem with Partial Coverage, Continuous Spatial Demand, and Adjustable Quality of Service

We consider a generalization of the classical planar maximum coverage location problem (PMCLP) in which partial coverage is allowed, facilities have adjustable quality of service (QoS) or service range, and demand zones and service zone of each facility are represented by two-dimensional spatial objects such as rectangles, circles, polygons, etc. We denote this generalization by … Read more

Stochastic RWA and Lightpath Rerouting in WDM Networks

In a telecommunication network, Routing and Wavelength Assignment (RWA) is the problem of finding lightpaths for incoming connection requests. When facing a dynamic traffic, greedy assignment of lightpaths to incoming requests based on predefined deterministic policies leads to a fragmented network that cannot make use of its full capacity due to stranded bandwidth. At this … Read more

An exact solution approach for an electric bus dispatch problem

We study how to efficiently plan the daily bus dispatch operation within a public transport terminal working with a fleet of electric buses. This requires to formulate and solve a new variant of the Vehicle Scheduling Problem model, in which one has to assign trip itineraries to each vehicle considering that driving ranges are limited, … Read more

Select, Route and Schedule: Optimizing Community Paramedicine Service Delivery with Mandatory Visits and Patient Prioritization

Healthcare delivery in the United States has been characterized as overly reactive and dependent on emergency department care for safety net coverage, with opportunity for improvement around discharge planning and high readmissions and emergency department bounce-back rates. Community paramedicine is a recent healthcare innovation that enables proactive visitation of patients at home, often shortly after … Read more

On Recognizing Staircase Compatibility

For the problem to find an m-clique in an m-partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is a property of a graph together with an m-partition of the vertex set and total orders on each subset of the partition. In optimization problems involving m-cliques in m-partite graphs … Read more

A Distributionally-Robust Service Center Location Problem with Decision Dependent Demand Induced from a Maximum Attraction Principle

We establish and analyze a service center location model with a simple but novel decision-dependent demand induced from a maximum attrac- tion principle. The model formulations are investigated in the distributionally- robust optimization framework. A statistical model that is based on the max- imum attraction principle for estimating customer demand and utility gain from service … Read more

An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems

Cardinality-constrained optimization problems are notoriously hard to solve both in theory and practice. However, as famous examples such as the sparse portfolio optimization and best subset selection problems show, this class is extremely important in real-world applications. In this paper, we apply a penalty alternating direction method to these problems. The key idea is to … Read more

Capacity requirements and demand management strategies in meal delivery

Online restaurant aggregators have experienced significant sales growth in recent years, driving demand for meal delivery in the US. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several … Read more