A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems

The economic dispatch problem is a kind of challenging non-convex problem, which minimizes the total operating cost while being subject to a collection of complex equality and inequality constraints. This paper presents a novel meta-heuristic named across neighborhood search (ANS) algorithm to solve...

Full description

Bibliographic Details
Main Authors: Xin Shen, Guohua Wu, Rui Wang, Huangke Chen, Haifeng Li, Jianmai Shi
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8417319/
_version_ 1831807251553189888
author Xin Shen
Guohua Wu
Rui Wang
Huangke Chen
Haifeng Li
Jianmai Shi
author_facet Xin Shen
Guohua Wu
Rui Wang
Huangke Chen
Haifeng Li
Jianmai Shi
author_sort Xin Shen
collection DOAJ
description The economic dispatch problem is a kind of challenging non-convex problem, which minimizes the total operating cost while being subject to a collection of complex equality and inequality constraints. This paper presents a novel meta-heuristic named across neighborhood search (ANS) algorithm to solve both dynamic and static economic dispatch problems. The ANS algorithm is augmented by a solution-difference disturbance mechanism and a parameter self-adaptation strategy. It is generally hard for metaheuristics to handle complex nonlinear equality constraints, because a meta-heuristic's search behavior is essentially stochastic while the equality constraints require the algorithm to exactly locate feasible solutions at the constraint bound. Therefore, a variable reduction strategy (VRS) is employed to deal with the equality constraint when solving the economic dispatch problem. VRS eliminates the equality constraint and reduces the dimensionality of the problem simultaneously, such that significantly improves the optimization efficiency. Extensive experiments and comparisons suggest that the proposed algorithm could generate the state-of-the-art results for both static and dynamic economic dispatch problems.
first_indexed 2024-12-22T19:56:43Z
format Article
id doaj.art-b98616cd5ead4b14be12321f38eb3922
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-22T19:56:43Z
publishDate 2018-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-b98616cd5ead4b14be12321f38eb39222022-12-21T18:14:24ZengIEEEIEEE Access2169-35362018-01-016413144132410.1109/ACCESS.2018.28585548417319A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch ProblemsXin Shen0Guohua Wu1https://orcid.org/0000-0003-1552-9620Rui Wang2Huangke Chen3https://orcid.org/0000-0003-2463-5580Haifeng Li4Jianmai Shi5State Key Laboratory of Information Engineering in Surveying, Mapping, and Remote Sensing, Wuhan University, Wuhan, ChinaSchool of Traffic and Transportation Engineering, Central South University, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaSchool of Geosciences and Info-physics, Central South University, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaThe economic dispatch problem is a kind of challenging non-convex problem, which minimizes the total operating cost while being subject to a collection of complex equality and inequality constraints. This paper presents a novel meta-heuristic named across neighborhood search (ANS) algorithm to solve both dynamic and static economic dispatch problems. The ANS algorithm is augmented by a solution-difference disturbance mechanism and a parameter self-adaptation strategy. It is generally hard for metaheuristics to handle complex nonlinear equality constraints, because a meta-heuristic's search behavior is essentially stochastic while the equality constraints require the algorithm to exactly locate feasible solutions at the constraint bound. Therefore, a variable reduction strategy (VRS) is employed to deal with the equality constraint when solving the economic dispatch problem. VRS eliminates the equality constraint and reduces the dimensionality of the problem simultaneously, such that significantly improves the optimization efficiency. Extensive experiments and comparisons suggest that the proposed algorithm could generate the state-of-the-art results for both static and dynamic economic dispatch problems.https://ieeexplore.ieee.org/document/8417319/Economic dispatch problemacross neighborhood searchvariable reductionevolutionary optimizationswarm intelligence
spellingShingle Xin Shen
Guohua Wu
Rui Wang
Huangke Chen
Haifeng Li
Jianmai Shi
A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
IEEE Access
Economic dispatch problem
across neighborhood search
variable reduction
evolutionary optimization
swarm intelligence
title A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
title_full A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
title_fullStr A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
title_full_unstemmed A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
title_short A Self-Adapted Across Neighborhood Search Algorithm With Variable Reduction Strategy for Solving Non-Convex Static and Dynamic Economic Dispatch Problems
title_sort self adapted across neighborhood search algorithm with variable reduction strategy for solving non convex static and dynamic economic dispatch problems
topic Economic dispatch problem
across neighborhood search
variable reduction
evolutionary optimization
swarm intelligence
url https://ieeexplore.ieee.org/document/8417319/
work_keys_str_mv AT xinshen aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT guohuawu aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT ruiwang aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT huangkechen aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT haifengli aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT jianmaishi aselfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT xinshen selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT guohuawu selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT ruiwang selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT huangkechen selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT haifengli selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems
AT jianmaishi selfadaptedacrossneighborhoodsearchalgorithmwithvariablereductionstrategyforsolvingnonconvexstaticanddynamiceconomicdispatchproblems