Accelerating the Composite Power System Planning by Benders Decomposition

Authors

  • Behnam Alizadeh Department of Electrical Engineering, Iran University of Science & Technology, Tehran, Iran
  • Shahram Jadid Department of Electrical Engineering, Iran University of Science & Technology, Tehran, Iran
Abstract:

This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for the planner. In this study, Benders decomposition has been applied to solve a mixed integer linear programming formulation of simultaneous GEP & TEP problem. The method has been tested on two test systems: Garver 6-bus system and IEEE 30-bus system. The results are compared to the unified solution of the problem formulation to show the consequent improvements from Benders decomposition.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

accelerating the composite power system planning by benders decomposition

this paper presents an application of benders decomposition to deal with the complexities in the simultaneous generation expansion planning (gep) and transmission expansion planning (tep). unlike the power system operation fields of study, the power system planning methods are not expected to be fast. however, it is always preferable to speed up computations to provide more analysis options for...

full text

Accelerating Benders Decomposition by Local Branching

Walter Rei, Michel Gendreau Département d’informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Canada, H3C 3J7, {[email protected], [email protected]} Jean-François Cordeau, Patrick Soriano HEC and Centre de recherche sur les transports, Montréal, 3000 chemin de la Côte-Sainte-C...

full text

Accelerating Benders decomposition for network design

Network design problems arise in many different application areas such as air freight, highway traffic and communications systems. This thesis concerns the development, analysis and testing of new techniques for solving network design problems. We study the application of Benders decomposition to solve mixed integer programming formulations of the network design problem. A new methodology for a...

full text

Planning and Scheduling by Logic-Based Benders Decomposition

We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve pro...

full text

A new Approach Versus Benders Decomposition in Aggregate Production Planning

This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 1

pages  1- 9

publication date 2014-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023