Solving the ED problem with ACO algorithm modified by mRMR and local search method

Jiahui Yu, Ji An Pan, Yuezu Lv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents an efficient Max-Relevance and Min-Redundancy (mRMR) based ant colony algorithm (ACO) method, called mACOR, for solving the economic dispatch (ED) problem. The mRMR algorithms are applied to reduce the redundancy among units in the power system and improve the ability of solving large-scale optimizations. And a random hill-climbing algorithm is employed to improve local search ability and avoid falling into local optima. Two objectives, the total coal consumption and the amount of pollution, were assigned different weights to transform the bi-objective problem to single objective problem. The effectiveness of the proposed approach is validated in the case study of 15 units, which plays better performance compared with the existing ACOR and PSO methods.

Original languageEnglish
Title of host publicationProceedings - 2020 Chinese Automation Congress, CAC 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2131-2136
Number of pages6
ISBN (Electronic)9781728176871
DOIs
Publication statusPublished - 6 Nov 2020
Externally publishedYes
Event2020 Chinese Automation Congress, CAC 2020 - Shanghai, China
Duration: 6 Nov 20208 Nov 2020

Publication series

NameProceedings - 2020 Chinese Automation Congress, CAC 2020

Conference

Conference2020 Chinese Automation Congress, CAC 2020
Country/TerritoryChina
CityShanghai
Period6/11/208/11/20

Keywords

  • Ant colony optimization
  • economic dispatch
  • hill-climbing algorithm
  • mRMR method

Fingerprint

Dive into the research topics of 'Solving the ED problem with ACO algorithm modified by mRMR and local search method'. Together they form a unique fingerprint.

Cite this