Search

This paper studies the effects of heterogeneous information on traffic equilibria and the resulting travel costs (both individual and social) when commuters make departure time choices to cross an unreliable bottleneck link. Increasing adoption and improved predictive abilities of Traveler Information Systems (TIS) enable commuters to plan their trips; however, there are inherent heterogeneities in information access and TIS accuracies. Our work addresses the open problem posed in Arnott et al. (1991) about the need to consider asymmetrically informed commuters in the bottleneck model of traffic congestion. We consider a Bayesian game with two heterogeneous commuter populations: one population is privately informed of the realized network state while the other only knows the public information about the distribution of states. We characterize the equilibrium of the game, in which each population chooses a departure rate function over time to minimize its expected cost based on its private belief about the state and the behavior of the other population. We provide a full equilibrium characterization for the complete range of values of link reliability, incident probability, and information penetration. The populations’ equilibrium strategies can broadly be categorized into two distinct regimes. Specifically, when information penetration is above a certain threshold, the populations’ equilibrium strategies are non-unique, and the relative Value of Information (VoI) is 0, i.e. the two populations face the same cost. On the other hand, when information penetration is below the threshold, equilibrium is unique, and VoI is positive and decreasing in information penetration. Importantly, we find that the lowest social cost is always achieved when a non-zero fraction of commuters are uninformed. The more unreliable the link, the higher the information penetration that achieves this minimum. We define the Value of Heterogeneity (VoH) as the difference between the minimum social cost and the cost under complete information penetration, and find that it can be significant under practically relevant conditions. [ABSTRACT FROM AUTHOR]

Intelligent water systems – aided by sensing technologies – have been identified as an important mechanism towards ensuring the resilience of urban systems. In this work, we study the problem of sensor placement that is robust to intermittent failures of sensors, i.e. sensor interruptions . We propose robust mixed integer optimization (RMIO) and robust greedy approximation (RGA) solution approaches. The underlying idea of both approaches is to promote solutions that achieve multiple detectability of events, such that these events remain detectable even when some sensors are interrupted. Additionally, we apply a previously proposed greedy approximation approach for solving the robust submodular function optimization (RSFO) problem. We compare scalability of these approaches and the quality of the solutions using a set of real water-networks. Our results demonstrate that considering sensor interruptions in the design stage improves sensor network performance. Importantly, we find that although the detection performances of RMIO and RGA approaches are comparable, RMIO generally has better performance than RGA, and is scalable to large-scale networks. Furthermore, the results demonstrate that RMIO and RGA approaches tend to outperform the RSFO approach. [ABSTRACT FROM AUTHOR]

Abstract: This article studies security decisions of identical plant-controller systems, when their security is interdependent due to network induced risks. Each plant is modeled by a discrete-time stochastic linear system, with the systems controlled over a shared communication network. We formulate the problem of security choices of the individual system operators (also called players) as a non-cooperative game. We consider a two-stage game, in which on the first stage the players decide whether to invest in security or not; and on the second stage, they apply control inputs to minimize the average operational costs. We characterize the equilibria of the game, which includes the determination of the individually optimal security levels. Next, we solve the problem of finding the socially optimal security levels. The presence of interdependent security causes a negative externality, and the individual players tend to under invest in security relative to the social optimum. This leads to a gap between the individual and the socially optimal security levels for a wide range of security costs. From our results, regulatory impositions to incentivize higher security investments are desirable. [Copyright &y& Elsevier]

The transition to a deeply decarbonized energy system requires coordinated planning of infrastructure investments and operations serving multiple end-uses while considering technology and policy-enabled interactions across sectors. Electricity and natural gas (NG), which are vital vectors of today's energy system, are likely to be coupled in different ways in the future, resulting from increasing electrification, adoption of variable renewable energy (VRE) generation in the power sector and policy factors such as cross-sectoral emissions trading. This paper develops a least-cost investment and operations model for joint planning of electricity and NG infrastructures that considers a wide range of available and emerging technology options across the two vectors, including carbon capture and storage (CCS) equipped power generation, low-carbon drop-in fuels (LCDF) as well as long-duration energy storage (LDES). The model incorporates the main operational constraints of both systems and allows each system to operate under different temporal resolutions consistent with their typical scheduling timescales. We apply our modeling framework to evaluate power-NG system outcomes for the U.S. New England region under different technology, decarbonization goals, and demand scenarios. Under a global emissions constraint, ranging between 80%–95% emissions reduction compared to 1990 levels, the least-cost solution relies significantly on using the available emissions budget to serve non-power NG demand, with power sector using only 14%–23% of the emissions budget. Increasing electrification of heating in the buildings sector results in greater reliance on wind and NG-fired plants with CCS and results in similar or slightly lower total system costs as compared to the business-as-usual demand scenario with lower electrification of end-uses. Interestingly, although electrification reduces non-power NG demand, it leads to up to 24% increase in overall NG consumption (both power and non-power) compared to the business-as-usual scenarios, resulting from the increased role for CCS in the power sector. The availability of low-cost LDES systems reduces the extent of coupling of electricity and NG systems by significantly reducing fuel (both NG and LCDF) consumption in the power system compared to scenarios without LDES, while also reducing total systems costs by up to 4.6% for the evaluated set of scenarios. • A decarbonized joint electric power and natural gas model is developed. • Impact of electrification, coupling constraints, and new technologies are analyzed. • Joint planning with cross-sectoral emission limit is the most cost-effective pathway. • Increased use of carbon capture technologies can increase overall NG consumption. [ABSTRACT FROM AUTHOR]

This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be uniquely localized. This problem can be viewed as a minimum test cover (MTC) problem, which is NP-hard. We consider two approaches to obtain approximate solutions to this problem. In the first approach, we transform the MTC problem to a minimum set cover (MSC) problem and use the greedy algorithm that exploits the submodularity property of the MSC problem to compute the solution to the MTC problem. In the second approach, we develop a new augmented greedy algorithm for solving the MTC problem. This approach does not require the transformation of the MTC to MSC. Our augmented greedy algorithm provides in a significant computational improvement while guaranteeing the same approximation ratio as the first approach. We propose several metrics to evaluate the performance of the sensor placement designs. Finally, we present detailed computational experiments for a number of real water distribution networks. [ABSTRACT FROM AUTHOR]