A new solution approach for non-convex combined heat and power economic dispatch problem considering power loss


URAZEL B., KESKİN K.

Energy, vol.278, 2023 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 278
  • Publication Date: 2023
  • Doi Number: 10.1016/j.energy.2023.128031
  • Journal Name: Energy
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Aquatic Science & Fisheries Abstracts (ASFA), CAB Abstracts, Communication Abstracts, Computer & Applied Sciences, Environment Index, INSPEC, Metadex, Pollution Abstracts, Public Affairs Index, Veterinary Science Database, Civil Engineering Abstracts
  • Keywords: Combined heat and power economic dispatch problem, COOT Algorithm, Marine predators algorithm, Non-convex optimization, Slime mould algorithm
  • Eskisehir Osmangazi University Affiliated: Yes

Abstract

The combined heat and power economic dispatch (CHPED) problem is a non-convex multivariate global optimization problem. The objective of the problem is to reduce total production costs while imposing a variety of constraints and meeting the demand for power and heat. Three recently presented metaheuristic approaches, Slime Mould Algorithm (SMA), COOT algorithm and Marine Predators Algorithm (MPA), are applied for solving CHPED problem. Studies dealing with the CHPED problem in the literature often do not consider valve points effect, prohibited operation zones for power-only units, feasible region constraints of combined heat and power units, all at once. Furthermore, power losses are neglected especially in large-scale problems. In this study, the CHPED problem is solved by considering all operational constraints including active power transmission losses. Three separate case studies with dimensions of 11 units, 48 units, and 96 units were used in the tests under various limitations. The experimental results revealed that MPA outperformed not only SMA, and COOT but also the algorithms proposed previously in the literature.