Essays On Stochastic Programming In Service Operations Management

Deterministic mathematical modeling is a branch of optimization that deals with decision making in real-world problems. While deterministic models assume that data and parameters are known, these numbers are often unknown in the real world applications.The presence of uncertainty in decision making can make the optimal solution of a deterministic model infeasible or sub-optimal. On the other hand, stochastic programming approach assumes that parameters and coefficients are unknown and only their probability distribution can be estimated. Although stochastic programming could include uncertainties in objective function and/or constraints, we only study problems that the goal of stochastic programming is to maximize (minimize) the expectation of the objective function of random variables. Stochastic programming has a wide range of application in manufacturing production planning, machine scheduling, dairy farm expansion planning, asset liability management, traffic management, and automobile dealership inventory management that involve uncertainty in decision making. One limitation of stochastic programming is that considering uncertainty in mathematical modeling often leads to a large-scale programming problem. The most widely used stochastic programming model is two-stage stochastic programming. In this model, first-stage decision variables are determined before observing the realization of uncertainties and second-stage decision variables are selected after exposing first-stage variables into the uncertainties. The goal is to determine the value of first-stage decisions in a way to maximize (minimize) the expected value of second-stage objective function. 1.1 Motivation for Designing Community-Aware Charging Network for Electric Vehicles Electric vehicles (EVs) are attracting more and more attentions these days due to increase concern about global warming and future shortage of fossil fuels. These vehicles have potential to reduce greenhouse gas emissions, improve public health condition by reducing air pollution and improving sustainability, and addressing diversication of transportation energy feedstock. Governments and policy makers have proposed two types of policy incentives in order to encourage consumers to buy an EV: direct incentives and indirect incentives. Direct incentives are those that have direct monetary value to consumers and include purchase subsidies, license tax/fee reductions, Electric Vehicle Supply Equipment (EVSE) financing, free electricity, free parking and emission test exemptions. On the other hand, indirect incentives are the ones that do not have direct monetary value and consist of high-occupancy vehicle access, emissions testing exemption time savings, and public charger availability. Lack of access to public charging network is considered to be a major barrier in adoption of EVs [38]. Access to public charging infrastructure will provide confidence for EV owners to drive longer distances without going out of charge and encourage EV ownership in the community. The current challenge for policy makers and city planners in installing public charging infrastructure is determining the location of these charging service stations, number of required stations and level of charging since the technology is still in its infancy and the installation cost is high. Since recharging of EV battery takes more time than refueling conventional vehicles, parking lots and garages are considered as potential locations for installing charging stations. The aim of this research is to develop a mathematical programming model to find the optimal locations with potentially high utilization rate for installing community-aware public EV charging infrastructure in order to improve accessibility to charging service and community livability metrics. In designing such charging network, uncertainties such as EV market share, state of battery charge at the time of arrival, driver’s willingness to charge EV away from home, arrival time to final destination, driver’s activity duration (parking duration), and driver’s walking distance preference play major role. Incorporating these uncertainties in the model, we propose a two-stage stochastic programming approach to determine the location and capacity of public EV charging network in a community. 1.2 Motivation for Managing Access to Care at Primary Care Clinics Patient access to care along with healthcare efficiency and quality of service are dimensions of health system performance measurement [1]. Improving access to primary care is a major step of having a high-performing health care system. However, many patients are struggling to get an in-time appointment with their own primary care provider (PCP). Even two years aer health insurance coverage was expanded, new patients have to wait 82% longer to get an internal-medicine appointment. A national survey shows that percentage of patients that need urgent care and could not get an appointment increased from 53% to 57% between 2006 and 2011 [30]. This delay may negatively impact health status of patients and may even lead to death. Patients that cannot get an appointment with their PCP may seek care with other providers or in emergency departments which will decrease continuity of care and increase total cost of health system. The main issue behind access problem is the imbalance between provider capacity and patient demand. While provider panel size is already large, the shortage in primary care providers and increasing number of patients mean that providers have to increase their panel size and serve more patients which will potentially lead to lower access to primary care. The ratio of adult primary care providers to population is expected to drop by 9% between 2005 and 2020 [12]. Moreover, patient flow analysis can increase efficiency of healthcare system and quality of health service by increasing patient and provider satisfaction through better resource allocation and utilization [39]. Effective resource allocation will smooth patient ow and reduce waste which will in turn results in better access to care. One way to control patient flow in clinic is managing appointment supply through appointment scheduling system. A well-designed appointment scheduling system can decrease appointment delay and waiting time in clinic for patients and idle time and/or overtime for physicians at the same time and increase their satisfaction. Appointment scheduling requires to make a balance between patient needs and facility resources [13]. The purpose of this study is to gain a better understanding for managing access to care in primary care outpatient clinics through operations management research. As a result of this under standing, we develop appointment scheduling models using two-stage stochastic programming to improve access while maintaining high levels of provider capacity utilization and improving patient flow in clinic by leveraging uncertainties in patient demand, patient no-show and provider service time variability

Assessing Potential Energy Savings in Household Travel: Methodological and Empirical Considerations of Vehicle Capability Constraints and Multi-day Activity Patterns.

The lack of multi-day data for household travel and vehicle capability requirements is an impediment to evaluations of energy savings strategies, since 1) travel requirements vary from day-to-day, and 2) energy-saving transportation options often have reduced capability. This work demonstrates a survey methodology and modeling system for evaluating the energy-savings potential of household travel, considering multi-day travel requirements and capability constraints imposed by the available transportation resources. A stochastic scheduling model is introduced – the multi-day Household Activity Schedule Estimator (mPHASE) – which generates synthetic daily schedules based on “fuzzy” descriptions of activity characteristics using a finite-element representation of activity flexibility, coordination among household members, and scheduling conflict resolution. Results of a thirty-household pilot study are presented in which responses to an interactive computer assisted personal interview were used as inputs to the mPHASE model in order to illustrate the feasibility of generating complex, realistic multi-day household schedules. Study vehicles were equipped with digital cameras and GPS data acquisition equipment to validate the model results. The synthetically generated schedules captured an average of 60 percent of household travel distance, and exhibited many of the characteristics of complex household travel, including day-to-day travel variation, and schedule coordination among household members. Future advances in the methodology may improve the model results, such as encouraging more detailed and accurate responses by providing a selection of generated schedules during the interview. Finally, the Constraints-based Transportation Resource Assignment Model (CTRAM) is introduced. Using an enumerative optimization approach, CTRAM determines the energy-minimizing vehicle-to-trip assignment decisions, considering trip schedules, occupancy, and vehicle capability. Designed to accept either actual or synthetic schedules, results of an application of the optimization model to the 2001 and 2009 National Household Travel Survey data show that U.S. households can reduce energy use by 10 percent, on average, by modifying the assignment of existing vehicles to trips. Households in 2009 show a higher tendency to assign vehicles optimally than in 2001, and multi-vehicle households with diverse fleets have greater savings potential, indicating that fleet modification strategies may be effective, particularly under higher energy price conditions.Ph.D.Natural Resources and EnvironmentUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/91567/1/kevinb_1.pd

The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions

Container Terminals (CTs) are continuously presented with highly interrelated, complex, and uncertain planning tasks. The ever-increasing intensity of operations at CTs in recent years has also resulted in increasing environmental concerns, and they are experiencing an unprecedented pressure to lower their emissions. Operational Research (OR), as a key player in the optimisation of the complex decision problems that arise from the quay and land side operations at CTs, has been therefore presented with new challenges and opportunities to incorporate environmental considerations into decision making and better utilise the ‘big data’ that is continuously generated from the never-stopping operations at CTs. The state-of-the-art literature on OR's incorporation of environmental considerations and its interplay with Big Data Analytics (BDA) is, however, still very much underdeveloped, fragmented, and divergent, and a guiding framework is completely missing. This paper presents a review of the most relevant developments in the field and sheds light on promising research opportunities for the better exploitation of the synergistic effect of the two disciplines in addressing CT operational problems, while incorporating uncertainty and environmental concerns efficiently. The paper finds that while OR has thus far contributed to improving the environmental performance of CTs (rather implicitly), this can be much further stepped up with more explicit incorporation of environmental considerations and better exploitation of BDA predictive modelling capabilities. New interdisciplinary research at the intersection of conventional CT optimisation problems, energy management and sizing, and net-zero technology and energy vectors adoption is also presented as a prominent line of future research

Sea Container Terminals

Due to a rapid growth in world trade and a huge increase in containerized goods, sea container terminals play a vital role in globe-spanning supply chains. Container terminals should be able to handle large ships, with large call sizes within the shortest time possible, and at competitive rates. In response, terminal operators, shipping liners, and port authorities are investing in new technologies to improve container handling infrastructure and operational efficiency. Container terminals face challenging research problems which have received much attention from the academic community. The focus of this paper is to highlight the recent developments in the container terminals, which can be categorized into three areas: (1) innovative container terminal technologies, (2) new OR directions and models for existing research areas, and (3) emerging areas in container terminal research. By choosing this focus, we complement existing reviews on container terminal operations

Traverse Planning with Temporal-Spatial Constraints

We present an approach to planning rover traverses in a domain that includes temporal-spatial constraints. We are using the NASA Resource Prospector mission as a reference mission in our research. The objective of this mission is to explore permanently shadowed regions at a Lunar pole. Most of the time the rover is required to avoid being in shadow. This requirement depends on where the rover is located and when it is at that location. Such a temporal-spatial constraint makes traverse planning more challenging for both humans and machines. We present a mixed-initiative traverse planner which addresses this challenge. This traverse planner is part of the Exploration Ground Data Systems (xGDS), which we have enhanced with new visualization features, new analysis tools, and new automation for path planning, in order to be applicable to the Re-source Prospector mission. The key concept that is the basis of the analysis tools and that supports the automated path planning is reachability in this dynamic environment due to the temporal-spatial constraints

A COTS-Based Attitude Dependent Contact Scheduling System

The mission architecture of the Gamma-ray Large Area Space Telescope (GLAST) requires a sophisticated ground system component for scheduling the downlink of science data. Contacts between the ````````````````` satellite and the Tracking and Data Relay Satellite System (TDRSS) are restricted by the limited field-of-view of the science data downlink antenna. In addition, contacts must be scheduled when permitted by the satellite s complex and non-repeating attitude profile. Complicating the matter further, the long lead-time required to schedule TDRSS services, combined with the short duration of the downlink contact opportunities, mandates accurate GLAST orbit and attitude modeling. These circumstances require the development of a scheduling system that is capable of predictively and accurately modeling not only the orbital position of GLAST but also its attitude. This paper details the methods used in the design of a Commercial Off The Shelf (COTS)-based attitude-dependent. TDRSS contact Scheduling system that meets the unique scheduling requirements of the GLAST mission, and it suggests a COTS-based scheduling approach to support future missions. The scheduling system applies filtering and smoothing algorithms to telemetered GPS data to produce high-accuracy predictive GLAST orbit ephemerides. Next, bus pointing commands from the GLAST Science Support Center are used to model the complexities of the two dynamic science gathering attitude modes. Attitude-dependent view periods are then generated between GLAST and each of the supporting TDRSs. Numerous scheduling constraints are then applied to account for various mission specific resource limitations. Next, an optimization engine is used to produce an optimized TDRSS contact schedule request which is sent to TDRSS scheduling for confirmation. Lastly, the confirmed TDRSS contact schedule is rectified with an updated ephemeris and adjusted bus pointing commands to produce a final science downlink contact schedule

Ensemble Multi-Objective Biogeography-Based Optimization with Application to Automated Warehouse Scheduling

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling

Ensemble Multi-Objective Biogeography-Based Optimization with Application to Automated Warehouse Scheduling

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling