4.5 Article

Solving Nonsmooth and Discontinuous Optimal Power Flow problems via interior-point lp-penalty approach

Journal

COMPUTERS & OPERATIONS RESEARCH
Volume 138, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2021.105607

Keywords

Nonsmooth optimal power flow with disjoint feasible regions; Prohibited Operating Zones constraints; Valve-Point Loading Effect; Lower-order penalty function; Modified logarithm-barrier function methods

Funding

  1. CAPES - Coordination of Superior Level Staff Improvement - within the Ministry of Education of Brazil [202/47/01/2019, 88882.432864/2019-01]

Ask authors/readers for more resources

The Nonsmooth and Discontinuous Optimal Power Flow (ND-OPF) problem is a challenging issue in power system optimization. This paper proposes a new approach to solve the ND-OPF problem by integrating piecewise polynomial interpolation (PPI) function for handling discontinuities related to prohibited operating zones (POZ) constraints and equivalent models for handling nonsmoothness. The proposed approach, called Equivalent Smooth and Continuous OPF (ESC-OPF), can be solved by strictly gradient-based methods. Numerical results show that the proposed approach is capable of solving large-scale ND-OPF problems with acceptable computation times.
The Nonsmooth and Discontinuous Optimal Power Flow (ND-OPF) is a large-scale, nonsmooth, discontinuous, nonconvex and multi-modal problem. In this problem, discontinuity is related to the representation of Prohibited Operating Zones (POZ), whereas nonsmoothness is related to the representation of Valve-Point Loading Effect (VPLE) in the fuel costs. Due to such features, all approaches that have been proposed for solving this problem are based on heuristics or on mixed integer nonlinear programming reformulations. In this paper, we propose the Piecewise Polynomial Interpolation (PPI) function approach for handling discontinuities related to the POZ constraints, which consists in replacing such constraints by an equivalent set of smooth and continuous equality and inequality constraints. The PPI function is of class C-1 and assumes null values at all allowed operating zones and non-null values at all forbidden zones. The model resulting from the PPI approach is the Equivalent Intermediate Model (EIM). For handling nonsmoothness on the EIM, we recast it as an equivalent model, where the VPLE term in the objective function becomes linear, and nonlinear box inequality constraints are introduced. The optimization model that results from such recasts is the Equivalent Smooth and Continuous OPF(ESC-OPF) model proposed, which can be solved by strictly gradient-based methods. Finally, we propose a primal-dual interior point l(p)-penalty approach (with 0 < p <= 1) for solving the ESC-OPF model, where inequality constraints are penalized by using the modified log-barrier function of Jittortrum-Osborne-Meggido and the equality constraints associated with the PPI function approach are penalized via l(p )lower-order exact penalty functions. Numerical results involving systems with up to 2007 buses, with 282 generating units and 846 POZ have shown that the proposed approach has been able to solve large-scale ND-OPF problems, with acceptable computation times.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Agriculture, Multidisciplinary

Integrated planning for planting and harvesting sugarcane and energy-cane for the production of sucrose and energy

Sonia Cristina Poltroniere, Angelo Aliano Filho, Amanda Suellen Caversan, Antonio Roberto Balbo, Helenice de Oliveira Florentino

Summary: The main products obtained from sugarcane for the global market are sugar, ethanol, and energy. With limited space for expansion in sugarcane cultivation in Brazil, a new type of cane called energy-cane with higher fiber content has been developed. Meeting the demand for sugar, ethanol, and energy products requires planting both energy-cane and sugarcane, posing challenges in planning and decision-making in the energy-sugar sector.

COMPUTERS AND ELECTRONICS IN AGRICULTURE (2021)

Article Engineering, Aerospace

Estimation of lift characteristics of a subscale fighter using low-cost experimental methods

Leonardo Murilo Nepomuceno, Roberto Gil Annes da Silva, Alejandro Sobron, Petter Krus, David Lundstrom

Summary: This study investigates the estimation of basic aerodynamic characteristics of a complex configuration using low-cost equipment and prototyping methods. The results highlight the limitations of commonly used aerodynamic methods and demonstrate the importance of physical models in reducing uncertainty.

AIRCRAFT ENGINEERING AND AEROSPACE TECHNOLOGY (2022)

Article Engineering, Electrical & Electronic

A primal-dual penalty-interior-point method for solving the reactive optimal power flow problem with discrete control variables

Jessica A. Delgado, Edmea C. Baptista, Antonio R. Balbo, Edilaine M. Soler, Diego N. Silva, Andre C. P. Martins, Leonardo Nepomuceno

Summary: The Optimal Reactive Power Flow (ORPF) problem is an important computational tool in power system planning and operation. The mixed-discrete version of the problem (DORPF) aims to minimize transmission losses while meeting power demand and operational limits. Existing methods for solving the DORPF problem have their limitations, such as poor matrix-conditioning and lack of infeasibility detection. This paper proposes an integration of optimization approaches that address all these issues, including the use of a primal-dual penalty-interior-point method and a sinusoidal penalty function method. Numerical tests confirm the effectiveness of the proposed method.

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS (2022)

Article Economics

Two-stage stochastic energy procurement model for a large consumer in hydrothermal systems

Rodolfo Rodrigues Barrionuevo Silva, Andre Christovao Pio Martins, Edilaine Martins Soler, Edmea Cassia Baptista, Antonio Roberto Balbo, Leonardo Nepomuceno

Summary: This paper discusses the energy procurement problem in hydro-dominated markets and proposes a Price Scenario Generation model to estimate future energy prices. The estimated prices are then used in the Energy Procurement Model for Hydrothermal Systems to calculate optimal procurement decisions. The study reveals correlations between hydro and economic variables.

ENERGY ECONOMICS (2022)

Article Engineering, Electrical & Electronic

A Gradient-Based Approach for Solving the Stochastic Optimal Power Flow Problem with Wind Power Generation

Rafael R. Souza, Antonio R. Balbo, Andre C. P. Martins, Edilaine M. Soler, Edilaine M. Baptista, Diego N. Sousa, Leonardo Nepomuceno

Summary: This paper proposes a solution approach for Stochastic Optimal Power Flow (SOPF) models under uncertainty in wind power generation. By obtaining exact analytical expressions for the derivatives of wind power costs and handling the non-differentiability of thermal costs, the equivalent SOPF model is reformulated as a differentiable nonlinear programming problem. A modified log-barrier primal-dual interior/exterior-point method is proposed to solve the equivalent SOPF model, which outperforms meta-heuristic approaches in terms of computation times and optimality. The proposed method is applied to various power systems and shows significant improvements.

ELECTRIC POWER SYSTEMS RESEARCH (2022)

Article Engineering, Electrical & Electronic

Optimization-Based Models for Estimating Residual Demand Curves for a Price-Maker Company

Tiago Gomes Cabana, Edmea Cessia Baptista, Edilaine Martins Soler, Andre Christovao Pio Martins, Antonio Roberto Balbo, Leonardo Nepomuceno

Summary: The Residual Demand Curve (RDC) has traditionally been obtained by the difference between the inverse functions of aggregated demand and supply, but it cannot directly represent constraints related to complex-bid markets. This paper interprets the traditional RDC as an optimization model and proposes Optimization-Based Residual Demand (OBRD) models that can represent complex-bid markets. We show that under certain conditions, the RDC obtained by the OBRD model is equivalent to that provided by traditional methods. Results demonstrate that the RDCs obtained by the OBRD model are significantly more accurate for complex-bid markets.

IEEE TRANSACTIONS ON POWER SYSTEMS (2023)

Article Green & Sustainable Science & Technology

Two-stage robust market clearing procedure model for day-ahead energy and reserve auctions of wind-thermal systems

Matheus Pereira Vieira, Andre Christovao Pio Martins, Edilaine Martins Soler, Antonio Roberto Balbo, Leonardo Nepomuceno

Summary: This paper proposes a novel robust market clearing procedures (MCP) model to account for the uncertainties associated with clean and renewable energy sources. By optimizing energy and reserves, the model improves real-time security and reliability, with only slight impacts on social welfare function, even in high levels of wind power penetration.

RENEWABLE ENERGY (2023)

Proceedings Paper Engineering, Industrial

Solving Economic Dispatch Problems with Forbidden Operating Zones via a Gradient-Based Approach

Ricardo B. N. M. Pinheiro, Tiago G. Cabana, Antonio R. Balbo, Leonardo Nepomuceno

Summary: The PPI approach proposed in this paper offers a new way to handle FOZ constraints in Economic Dispatch with Forbidden Operation Zones (ED-FOZ) problems, allowing for the application of efficient gradient-based optimization methods. Numerical results show that this method efficiently solves ED-FOZ problems with acceptable computation times involving a large number of generating units and FOZ.

2021 14TH IEEE INTERNATIONAL CONFERENCE ON INDUSTRY APPLICATIONS (INDUSCON) (2021)

Article Computer Science, Interdisciplinary Applications

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa

Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An asynchronous parallel benders decomposition method for stochastic network design problems

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni

Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu

Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie

Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Manipulating hidden-Markov-model inferences by corrupting batch data

William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro

Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images

Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh

Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method

Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao

Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu

Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Review Computer Science, Interdisciplinary Applications

Metaheuristics for bilevel optimization: A comprehensive review

Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas

Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Electric vehicle-based express service network design with recharging management: A branch-and-price approach

Xudong Diao, Meng Qiu, Gangyan Xu

Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

Ramon Piedra-de-la-Cuadra, Francisco A. Ortega

Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Cutting Plane Approaches for the Robust Kidney Exchange Problem

Danny Blom, Christopher Hojny, Bart Smeulders

Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Generating linear programming instances with controllable rank and condition number

Anqi Li, Congying Han, Tiande Guo, Bonan Li

Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.

COMPUTERS & OPERATIONS RESEARCH (2024)