The flexibility of the cloud services offered to the end users enables the cloud providers to offer demand response services. This paper presents a market structure to address the competition among cloud providers in the wholesale electricity and cloud computing market (CCM). The cloud providers compete to serve the customers in the CCM while they bid for the electricity demand in the wholesale market. The proposed market structure highlights the interdependence among electricity and cloud computing infrastructure systems by introducing the dynamic game with complete information among cloud providers in the wholesale market and the CCM. At each infrastructure system, the operation strategies of the market participants are determined by forming bi-level optimization problems in which the upper-level problem maximizes the payoff of the market participants while the lowerlevel problem represents the corresponding market settlement process. Independent System Operator (ISO) ensures the security and reliability of the network in the wholesale market while the demand and supply are balanced in the CCM to determine the price of the offered computing resources. A case study illustrates the effectiveness of the proposed approach.
19 April 2018 in Computer-Aided Civil and Infrastructure Engineering
This article presents a modeling framework for the operations of on‐demand mobility services (ODMS) in urban areas. The framework provides the capabilities to analyze ODMS operations while representing emerging services such as ridesharing and transfer. The problem is formulated as a mixed integer program and an efficient decomposition‐based methodology is developed for its solution. The methodology adopts a modified version of the column generation algorithm, which implements iterative decomposition and network augmentation techniques to allow studying networks of moderate size. The results of a set of experiments considering grid and real‐world networks are presented. The results show that increasing the number of passengers willing to rideshare and/or transfer improves the overall performance of ODMS as it increases number of served passengers and associated profit and reduces the number of used vehicles. Although presented as an offline planning tool, the methodology could be adopted for real‐time applications as adequate computational resources become available.
12 July 2021 in Transportation Research Record: Journal of the Transportation Research Board
Congestion pricing is proposed as an effective travel demand management strategy to circumvent the problem of congestion and generate revenue to finance developmental projects. There are several studies focusing on optimal pricing strategies to minimize the congestion level or maximize the revenue of the system. However, with regard to equity issues, benefiting only users with higher value of time is claimed to be the main factor that prevents implementation of such policies in practice. While many studies aimed to tackle the equity issues by certain welfare analyses, most of these studies fail to fully consider realistic features of users’ behavior and the uncertainty in link travel times. Given the variability of travel time in real-world networks and the impacts of pricing policies on path travel time distributions, it is important to consider the users’ reliability valuations, in addition to their travel time valuations. Thus, the goal in this study is to find an equitable pricing scheme that minimizes the total travel time of auto users in a general bimodal network considering heterogeneous users with different values of time and reliability. A particle swarm optimization algorithm is proposed to find self-funded and Pareto-improving optimal toll values. A reliability-based user equilibrium algorithm is embedded into this optimization algorithm to assign travelers to the equilibrated paths for different user classes given toll values. The proposed approach is successfully applied to a modified Sioux Falls network to explore impacts of subsidization, congestion level, and considering travel time reliability on the pricing strategy and its effectiveness.
3 June 2019 in Computer-Aided Civil and Infrastructure Engineering
Path finding problem has a broad application in different fields of engineering. Travel time uncertainty is a critical factor affecting this problem and the route choice of transportation users. The major downside of the existing algorithms for the reliable path finding problem is their inefficiency in computational time. This study aims to develop a network contraction approach to reduce the network size of each specific origin and destination (OD) pair in stochastic time‐dependent networks. The network contraction is based on the comparison of optimistic and pessimistic solutions resulting from minimum and maximum travel time realizations of a Monte‐Carlo simulation (MCS)‐based approach. In this respect, the researchers propose a learning approach to utilize the information of the realizations in the initial iterations of the MCS approach. Implementation of this approach is in place for several OD pairs of two real‐world large‐scale applications. First, it is calibrated for the Chicago downtown network; the performance and accuracy of the proposed approach are investigated by comparing the results against that of the approach without any network contraction. In addition, the Salt Lake City network illustrates the transferability of the approach to other networks. The results demonstrate significant computational improvements, with an acceptable accuracy level relative to the approach without network contraction.