Dynamic prices are effective demand-side management (DSM) methods. However, the complex interactive behavior among many loads poses challenges for dynamic price design. To address this, a user equilibrium (UE)-based bilevel dynamic price design model is proposed. In the upper-level model, the retailer designs dynamic prices to maximize profits considering the interaction response of loads. In the lower-level model, the interactive load behavior is represented by the convex UE model, which offers significant advantages over the conventional Nash Equilibrium (NE) in handling large-scale load flexibility. The bi-level model is reformulated as a mixed integer quadratic programming (MIQP) problem by using Karush-Kuhn-Tucker (KKT) conditions, Big-M methods, duality theory, and binary expansion methods. A branch-and-price algorithm is then used to efficiently solve the problem. Simulation results demonstrate that the proposed method supports large-scale dynamic pricing, maximizing retailer's profits while minimizing electricity bills for loads.
Jin, F., Shao, C., Lu, Y., Jin, X., Borghetti, A., Wang, X. (2025). Design of Dynamic Prices for Retailers Based on User Equilibrium. IEEE TRANSACTIONS ON ENERGY MARKETS, POLICY AND REGULATION, 4, 1-13 [10.1109/TEMPR.2025.3632481].
Design of Dynamic Prices for Retailers Based on User Equilibrium
Borghetti A.;
2025
Abstract
Dynamic prices are effective demand-side management (DSM) methods. However, the complex interactive behavior among many loads poses challenges for dynamic price design. To address this, a user equilibrium (UE)-based bilevel dynamic price design model is proposed. In the upper-level model, the retailer designs dynamic prices to maximize profits considering the interaction response of loads. In the lower-level model, the interactive load behavior is represented by the convex UE model, which offers significant advantages over the conventional Nash Equilibrium (NE) in handling large-scale load flexibility. The bi-level model is reformulated as a mixed integer quadratic programming (MIQP) problem by using Karush-Kuhn-Tucker (KKT) conditions, Big-M methods, duality theory, and binary expansion methods. A branch-and-price algorithm is then used to efficiently solve the problem. Simulation results demonstrate that the proposed method supports large-scale dynamic pricing, maximizing retailer's profits while minimizing electricity bills for loads.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


