Skip to content
naulon
Not checkedNot checked for notices yet.

Transmission Expansion Planning Considering Power Losses, Expansion of Substations and Uncertainty in Fuel Price Using Discrete Artificial Bee Colony Algorithm

Meisam Mahdavi, Ali Kimiyaghalam, Hassan Haes Alhelou and 3 more

IEEE Access · 2021

doi:10.1109/access.2021.3116802 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Transmission expansion planning (TEP) is an important part of power system expansion planning. In TEP, optimal number of new transmission lines and their installation time and place are determined in an economic way. Uncertainties in load demand, place of power plants, and fuel price as well as voltage level of substations influence TEP solutions effectively. Therefore, in this paper, a scenario based-model is proposed for evaluating the fuel price impact on TEP considering the expansion of substations from the voltage level point of view. The fuel price is an important factor in power system expansion planning that includes severe uncertainties. This factor indirectly affects the lines loading and subsequent network configuration through the change of optimal generation of power plants. The efficiency of the proposed model is tested on the real transmission network of Azerbaijan regional electric company using a discrete artificial bee colony (DABC) and quadratic programming (QP) based method. Moreover, discrete particle swarm optimization (DPSO) and decimal codification genetic algorithm (DCGA) methods are used to verify the results of the DABC algorithm. The results evaluation reveals that considering uncertainty in fuel price for solving TEP problem affects the network configuration and the total expansion cost of the network. In this way, the total cost is optimized more and therefore the TEP problem is solved more precisely. Also, by comparing the convergence curve of the DABC with that of DPSO and DCGA algorithms, it can be seen that the efficiency of the DABC is more than DPSO and DCGA for solving the desired TEP problem.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.