OPTIMIZATION MODELS AND METHODOLOGIES TO SUPPORT EMERGENCY PREPAREDNESS AND POST-DISASTER RESPONSE

This dissertation addresses three important optimization problems arising during the phases of pre-disaster emergency preparedness and post-disaster response in time-dependent, stochastic and dynamic environments. The first problem studied is the building evacuation problem with shared information (BEPSI), which seeks a set of evacuation routes and the assignment of evacuees to these routes with the minimum total evacuation time. The BEPSI incorporates the constraints of shared information in providing on-line instructions to evacuees and ensures that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. A mixed-integer linear program is formulated for the BEPSI and an exact technique based on Benders decomposition is proposed for its solution. Numerical experiments conducted on a mid-sized real-world example demonstrate the effectiveness of the proposed algorithm. The second problem addressed is the network resilience problem (NRP), involving an indicator of network resilience proposed to quantify the ability of a network to recover from randomly arising disruptions resulting from a disaster event. A stochastic, mixed integer program is proposed for quantifying network resilience and identifying the optimal post-event course of action to take. A solution technique based on concepts of Benders decomposition, column generation and Monte Carlo simulation is proposed. Experiments were conducted to illustrate the resilience concept and procedure for its measurement, and to assess the role of network topology in its magnitude. The last problem addressed is the urban search and rescue team deployment problem (USAR-TDP). The USAR-TDP seeks an optimal deployment of USAR teams to disaster sites, including the order of site visits, with the ultimate goal of maximizing the expected number of saved lives over the search and rescue period. A multistage stochastic program is proposed to capture problem uncertainty and dynamics. The solution technique involves the solution of a sequence of interrelated two-stage stochastic programs with recourse. A column generation-based technique is proposed for the solution of each problem instance arising as the start of each decision epoch over a time horizon. Numerical experiments conducted on an example of the 2010 Haiti earthquake are presented to illustrate the effectiveness of the proposed approach

PEV Charging Infrastructure Integration into Smart Grid

Plug-in electric vehicles (PEVs) represent a huge step forward in a green transportation system, contribute to the reduction of greenhouse gas emission, and reduce the dependence on fossil fuel. With the increasing popularity of PEVs, public electric-vehicle charging infrastructure (EVCI) becomes indispensable to meet the PEV user requirements. EVCI can consist of various types of charging technologies, offering multiple charging services for PEV users. Proper integration of the charging infrastructure into smart grid is key to promote widespread adoption of PEVs. Planning and operation of EVCI are technically challenging, since PEVs are characterized by their limited driving range, long charging duration, and high charging power, in addition to the randomness in driving patterns and charging decisions of PEV users. EVCI planning involves both the siting and capacity planning of charging facilities. Charging facility siting must ensure not only a satisfactory charging service for PEV users but also a high utilization and profitability for the chosen facility locations. Thus, the various types of charging facilities should be located based on an accurate location estimation of the potential PEV charging demand. Capacity planning of charging facilities must ensure a satisfactory charging service for PEV users in addition to a reliable operation of the power grid. During the operation of EVCI, price-based coordination mechanisms can be leveraged to dynamically preserve the quality-of-service (QoS) requirements of charging facilities and ensure the profitability of the charging service. This research is to investigate and develop solutions for integrating the EVCI into the smart grid. It consists of three research topics: First, we investigate PEV charging infrastructure siting. We propose a spatial-temporal flow capturing location model. This model determines the locations of various types of charging facilities based on the spatial-temporal distribution of traffic flows. In the proposed model, we consider transportation network dynamics and congestion, in addition to different characteristics and usage patterns of each charging facility type. Second, we propose a QoS aware capacity planning of EVCI. The proposed framework accounts for the link between the charging QoS and the power distribution network (PDN) capability. Towards this end, we firstly optimize charging facility sizes to achieve a targeted QoS level. Then, we minimize the integration cost for the PDN by attaining the most cost-effective allocation of the energy storage systems and/or upgrading the PDN substation and feeders. Additionally, we capture the correlation between the occupation levels of neighboring charging facilities and the blocked PEV user behaviors. Lastly, we investigate the coordination of PEV charging demands. We develop a differentiated pricing mechanism for a multiservice EVCI using deep reinforcement learning (RL). The proposed framework enhances the performance of charging facilities by motivating PEV users to avoid over-usage of particular service classes. Since customer-side information is stochastic, non-stationary, and expensive to collect at scale, the proposed pricing mechanism utilizes the model-free deep RL approach. In the proposed RL approach, deep neural networks are trained to determine a pricing policy while interacting with the dynamically changing environment. The neural networks take the current EVCI state as input and generate pricing signals that coordinate the anticipated PEV charging demand

Department of Computer Science Activity 1998-2004

This report summarizes much of the research and teaching activity of the Department of Computer Science at Dartmouth College between late 1998 and late 2004. The material for this report was collected as part of the final report for NSF Institutional Infrastructure award EIA-9802068, which funded equipment and technical staff during that six-year period. This equipment and staff supported essentially all of the department\u27s research activity during that period

Combinatorial Optimization

This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. Th

The line planning routing game

In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s best-response can be calculated efficiently and which properties are needed to guarantee convergence of the best-response algorithm. Furthermore, we determine the price of anarchy which bounds the objective value of an equilibrium with respect to a system- optimal solution of the line planning problem. For problems where best-responses cannot be found efficiently, we propose heuristic methods. We demonstrate our findings on some small computational examples

Exploiting Mobile Energy Storages for Overload Mitigation in Smart Grid

The advancement of battery and electronic technologies pushes forward transportation electrification, accelerating the commercialization and prevalence of plug-in electric vehicles (PEVs). The development of PEVs is closely related to the smart grid as PEVs are considered as high power rating electric appliances that require frequent charging. As PEVs become regular transportation options, charging stations (CSs) are also extensively deployed in the smart grid to meet the PEV charging demand. During peak traffic hours, the increasing PEV charging demand could exceed the loading capacities of CS-connected transformers, causing heavy charging overload in-station. Without proper overload mitigation, the energy imbalance issues will result in severe feeder degradation and power quality issue. Therefore, solutions for CS overload mitigation are in urgent demand. Considering the rechargeable nature of PEV batteries, PEVs can serve as potential mobile energy storages (MESs) to carry energy from power nodes with excess energy to overloaded CSs to compensate the overloads. Compared to infrastructure upgrade and installing stationary energy storages at CSs, the utilization of PEVs not only minimizes the additional upgrade/installation expenditure, but also maximizes the energy utilization in the smart grid with high flexibility. However, the PEV utilization for overload mitigation is confronted with a variety of challenges due to vehicular mobility and the fear of battery degradation. Because of vehicular mobility, the CS operation dynamics become stochastic processes, increasing the difficulty of the CS demand estimation. Without accurate demand estimation, the overload condition cannot be timely predicted and controlled. Moreover, the stochastic on-road traffic could impair the time-efficiency of the PEV overload mitigation service. Further, as the overload mitigation service demands frequent charging and discharging, the fear of battery degradation could impede PEV owners from providing the service, making the overload mitigation tasks harder to fulfill. In this thesis, we address the above challenges to effectively utilize PEVs for overload mitigation in the smart grid. In specific, different approaches are designed according to the PEV properties at different commercialization stages. First, at the early PEV commercialization stage, power utility company purchases large battery capacity PEVs as utility-owned MESs (UMESs) whose only responsibility is fulfilling the energy compensation task. The fleet of UMESs is rather small due to the company's limited budget, and therefore UMESs priorly serve the CSs with large energy imbalance (e.g., 500-1000kWh). Thus, the stochastic CS charging demand needs to be accurately estimated and then UMESs can be scheduled to these CSs for overload mitigation. To achieve this objective, we develop a two-dimensional Markov Chain model to characterize the stochastic process in-station so that the CS charging demand can be precisely estimated. Based on the estimated CS demand status, a two-tier energy compensation framework is designed to schedule UMESs to the heavily overloaded CSs in a timely and cost-efficient manner. Second, at the medium stage of PEV commercialization, vehicle-fleet based companies are motivated by legislation to purchase a large fleet of PEVs which can be served as potential MESs, referred to as legislation-motivated MESs (LMESs). To deliver energy to overloaded CSs using LMESs would introduce a large amount of additional traffics to the transportation network. When injecting these LMES traffics into an already busy transportation network, unexpected traffic delay could occur, delaying the overload mitigation service. To avoid the potential traffic delay incurred by LMES service, we develop an energy-capacitated transportation network model to measure the road capacity of accommodating additional LMES traffics. Based on the developed model, a loading-optimized navigation scheme is proposed to calculate the optimal navigation routes for LMES overload mitigation. To stimulate LMESs following the optimal navigation, we propose a dynamic pricing scheme that adjusts the service price to align the LMES service routes with the optimal routes to achieve a time-efficient service result. Third, when PEVs are prevalent in the automobile market and become regular transportation options for every household, on-road private-owned PEVs can be efficiently used as energy porters to deliver energy to overloaded CSs, named as private MESs (PMESs). As the primary objective of PMESs is to reach their planned destinations, the monetary incentive is demanded to stimulate them actively participating in the overload mitigation tasks. Therefore, a hierarchical decision-making process between the utility operator (UO) and PMESs is in demand. Moreover, considering PMESs have different service preferences (e.g., the fear of battery degradation, the unwillingness of long service time, etc.), individual PMES decision making process on the task should be carefully modelled. Thus, we propose to characterize the price-service interaction between the operator and PMESs as a Stackelberg game. The operator acts as the leader to post service price to PMESs while PMESs act as followers, responding to the posted price to maximize their utility functions. In summary, the analysis and schemes proposed in this thesis can be adopted by the local power utility company to utilize PEVs for overload mitigation at overloaded power nodes. The proposed schemes are applicable during different PEV commercialization stage and present PEVs as a flexible solution to the smart grid overload issue