This paper proposes an optimal congestion management approach under hybrid electricity market using Self organizing hierarchical particle swarm optimization with Time Varying Acceleration Coefficients (SPSO-TVAC). The aim of the proposed work is to minimize deviations from preferred transaction schedules and hence the congestion cost under hybrid electricity market. The values of Transmission C...

This paper investigates the cost of travel time variability for car users at the peak hour. In particular, we derive the marginal social cost of travel time variability, which takes the feedback of travel time unreliability on the congestion profile into account. This is in contrast with the value of travel time variability, which treats congestion as an exogenous phenomenon. Congestion is mode...

This paper proposes a distributed optimization based dynamic tariff (DDT) method for congestion management in distribution networks with high penetration of electric vehicles (EVs) and heat pumps (HPs). The DDT method employs a decomposition based optimization method to have aggregators explicitly participate in congestion management, which gives more certainty and transparency compared to the ...

Short-term prediction of traffic flow is central to alleviating congestion and controlling the negative impacts of environmental pollution resulting from vehicle emissions on both inter- and intra-urban highways. The strong need to monitor and control congestion time and costs for metropolis in developing countries has therefore motivated the current study. This paper establishes the applicatio...

Routing games (or congestion games) form an important class of non-atomic games that is used to model the interaction of agents who are sharing resources on a network, in which the cost on each edge depends on the fraction of agents using that edge. Extensive work has been dedicated to studying Nash equilibria (or user optimal assignments) of congestion games [9], [11], [14], in which all playe...

Abstract In its simplest form determination of the cost of transmission system congestion is rather straightforward. Assuming complete knowledge of the power system inputs, such as the loads at all system buses, and that the generators bid in their actual costs (i.e., they are not taking advantage of localized market power), then the hourly short-term cost of transmission congestion is the diff...

In the k-splittable flow problem, each commodity can only use at most k paths and the key point is to find the suitable transmitting paths for each commodity. To guarantee the efficiency of the network, minimizing congestion is important, but it is not enough, the cost consumed by the network is also needed to minimize. Most researches restrict to congestion or cost, but not the both. In this p...

The occurrence of congestion has an extremely deleterious impact on the performance of Wireless Sensor Networks (WSNs). This article presents a novel protocol, named COALA (COngestion ALleviation and Avoidance), which aims to act both proactively, in order to avoid the creation of congestion in WSNs, and reactively, so as to mitigate the diffusion of upcoming congestion through alternative path...

Urban congestion patterns have become ubiquitous and complex. Traditional, “static” approaches are no longer adequate for analyzing network flows and conducting minimum cost routing. This paper reports on a GIS-based decision support tool for modeling dynamic network congestion and conducting minimum cost routing. The system predicts network flows at a detailed level of temporal resolution, cap...

We introduce (super) polynomial bottleneck games, where the utility costs of the players are (super) polynomial functions of the congestion of the resources that they use, and the social cost is determined by the worst congestion of any resource. In particular, the delay function for any resource r is of the form CMr r , where Cr is the congestion measured as the number of players that use r, a...