Projects

• optimal 1-\alpha for different forms of reputation cost functions, e.g., linear, pwl.

• tradeoffs in multiple objectives and reliabilities associated with multiple joint chance constraints regarding multiple uncertain processes or systems.

• mixed-integer programming reformulations, support vector machines (SVM) from data mining, decomposition methods, and valid inequalities for optimizing CCP models with variable risk parameter.

Many service systems in health care operations, cloud computing, transportation, etc., possess structural similarities in integrated system design and service operations. We focus on (1) the study of stochastic optimization approaches that can incorporate different performance metrics for guiding service operations and balancing risk and return; and (2) the exploration of problem structures that will result in efficient and scalable computational schemes.

For example, we study a problem of stochastic resource allocation and scheduling, which involves chance constraints for measuring the risk of operational decisions under uncertainty. We describe the problem in the context of surgery planning in Operating Rooms (ORs) under uncertain surgery durations, for which we formulate CCPs to improve the quality of service and service fairness: two chance constraints respectively guarantee low probabilities of having long waiting time of patients and OR overtime for completing surgeries.

The resulting formulation is highly complex, with multiple types of binary variables (for both allocation and scheduling decisions) and chance constraints. We develop decomposition algorithms and various types of cutting planes for optimizing the results.

We develop new decomposition paradigms for stochastic integer programming models, and generate more effective cutting planes and objective bounds. We focus on two-stage stochastic integer programs, and advance decomposition paradigms based on special structures of specific risk-averse programs, and also based on special integer-programming structures (e.g., totally unimodularity, special ordered sets of type 1 (SOS1), cover inequalities). We have implemented the related approaches in a series of research projects that optimize stochastic problems of (i) project management, (ii) resource allocation, (iii) appointment scheduling, and (iv) network interdiction. Moreover, the new decomposition paradigms can be widely applied to large-scale complex system design and operations management, including optimizing critical interdependent infrastructures such as power grids, transportation systems, and cyber-clouds.

We design networks and optimize network operations in energy, healthcare, and transportation, in particular focusing on problems of critical infrastructure design (e.g., power grids), epidemic control, and transportation under uncertainty. We use stochastic programming models and decomposition algorithms for tackling large-scale network problems with random supply/demand or arc disruptions.

We also study network interdiction models and design algorithms for specially-structured networks (e.g., trees, small-world networks) in related problems. Dynamic programming and heuristic approaches are used for deriving solutions in polynomial time, and generating valid bounds to the stochastic integer programs.

In particular, we are interested in network optimization problems with constraints/ objective functions reflecting risk-averse behavior of a decision maker. For instance, in a risk-averse shortest path interdiction problem, a follower aims to identify a path under random arc cost, and minimizes the VaR of the path length for a given reliability level. We develop heuristics and exact cutting-plane algorithms. In addition, by constructing path-flow reformulations, we design column generation algorithms to improve the computational efficacy. The risk-averse network interdiction models can be generalized to problems of UAV routing, cloud computing data exchange, and emergency service delivery.

With increasing penetrations of fluctuating renewable energy sources, such as wind power plants and solar photovoltaics, and active participation of electric loads in power system operation, uncertainty will increase. Specifically, we develop data-driven and distribution-free optimization methods that are suited to dispatching power systems with both fluctuating renewable energy sources and flexible loads contributing to balancing reserves via load control. The flexibility of an aggregation of loads is difficult to compute and uncertain. Investigating, characterizing, and managing this uncertainty is the focus of this research. Moreover, we quantify the tradeoff between the uncertainty and profitability of load control, and the effect of uncertainty and methods for managing it on power system dispatch, which affects pollutant emissions.

We consider vehicle routing, service matching, and appointment scheduling arising in large-scale carsharing and ridesharing problems. We use mixed-integer programming formulations and spatial-temporal networks to model carsharing/ridesharing systems and analyze related operations. We apply stochastic programming and dynamic programming techniques to optimize real-time operations, under uncertain travel time and service time. We examine a wide class of mobility sharing systems, including on-demand ridesharing companies such as DiDi ChuXing, and not-for-profit carsharing for underserved populations.

National Science Foundation

Department of Energy

Department of Defense, Army Research Office

USDOT Center for Connected Automated Transportation (CCAT)

Ford Motor Company

IBM

Procter & Gamble

DiDi ChuXing