Abstract:Economic dispatch (ED) plays an important role in power system operation, since it can decrease the operating cost, save energy resources, and reduce environmental load. This paper presents an improved particle swarm optimization called biogeographybased learning particle swarm optimization (BLPSO) for solving the ED problems involving different equality and inequality constraints, such as power balance, prohibited operating zones, and ramp-rate limits. In the proposed BLPSO, a biogeographybased learning strat… Show more
“…GLxBBO is an incomplete variant of ILxBBO, which is LxBBO with only the two-global-best guiding operator, without the dynamic two-differential perturbing operator and improved Laplace migration operator DLxBBO is an incomplete variant of ILxBBO, which is LxBBO with only the dynamic two-differential perturbing operator without the improved Laplace migration operator and two-global-best guiding operator OLxBBO is an incomplete variant of ILxBBO, which contains the improved Laplace migration operator without the dynamic two-differential perturbing operator and two-global-best guiding operator e experimental results are shown in Table 1 [39], BIBBO [25], BBOM [40], DEBBO [30], BLPSO [41], PRBBO [24], WRBBO [37], EMBBO [27], and BHCS [42]. ese algorithms are all BBO variants proposed in recent years, with much comparability.…”
Section: Comparison Of Ilxbbo With Its Incomplete Variantsmentioning
Laplacian Biogeography-Based Optimization (LxBBO) is a BBO variant which improves BBO’s performance largely. When it solves some complex problems, however, it has some drawbacks such as poor performance, weak operability, and high complexity, so an improved LxBBO (ILxBBO) is proposed. First, a two-global-best guiding operator is created for guiding the worst habitat mainly to enhance the exploitation of LxBBO. Second, a dynamic two-differential perturbing operator is proposed for the first two best habitats’ updating to improve the global search ability in the early search phase and the local one in the late search one, respectively. Third, an improved Laplace migration operator is formulated for other habitats’ updating to improve the search ability and the operability. Finally, some measures such as example learning, mutation operation removing, and greedy selection are adopted mostly to reduce the computation complexity of LxBBO. A lot of experimental results on the complex functions from the CEC-2013 test set show ILxBBO obtains better performance than LxBBO and quite a few state-of-the-art algorithms do. Also, the results on Quadratic Assignment Problems (QAPs) show that ILxBBO is more competitive compared with LxBBO, Improved Particle Swarm Optimization (IPSO), and Improved Firefly Algorithm (IFA).
“…GLxBBO is an incomplete variant of ILxBBO, which is LxBBO with only the two-global-best guiding operator, without the dynamic two-differential perturbing operator and improved Laplace migration operator DLxBBO is an incomplete variant of ILxBBO, which is LxBBO with only the dynamic two-differential perturbing operator without the improved Laplace migration operator and two-global-best guiding operator OLxBBO is an incomplete variant of ILxBBO, which contains the improved Laplace migration operator without the dynamic two-differential perturbing operator and two-global-best guiding operator e experimental results are shown in Table 1 [39], BIBBO [25], BBOM [40], DEBBO [30], BLPSO [41], PRBBO [24], WRBBO [37], EMBBO [27], and BHCS [42]. ese algorithms are all BBO variants proposed in recent years, with much comparability.…”
Section: Comparison Of Ilxbbo With Its Incomplete Variantsmentioning
Laplacian Biogeography-Based Optimization (LxBBO) is a BBO variant which improves BBO’s performance largely. When it solves some complex problems, however, it has some drawbacks such as poor performance, weak operability, and high complexity, so an improved LxBBO (ILxBBO) is proposed. First, a two-global-best guiding operator is created for guiding the worst habitat mainly to enhance the exploitation of LxBBO. Second, a dynamic two-differential perturbing operator is proposed for the first two best habitats’ updating to improve the global search ability in the early search phase and the local one in the late search one, respectively. Third, an improved Laplace migration operator is formulated for other habitats’ updating to improve the search ability and the operability. Finally, some measures such as example learning, mutation operation removing, and greedy selection are adopted mostly to reduce the computation complexity of LxBBO. A lot of experimental results on the complex functions from the CEC-2013 test set show ILxBBO obtains better performance than LxBBO and quite a few state-of-the-art algorithms do. Also, the results on Quadratic Assignment Problems (QAPs) show that ILxBBO is more competitive compared with LxBBO, Improved Particle Swarm Optimization (IPSO), and Improved Firefly Algorithm (IFA).
“…(3) while G � 1 to Mg do (4) P(G + 1) � ∅; (5) while P(G) ≠ ∅ do (6) Generate two random indices r 1 and r 2 from np; (7) if…”
Section: Remarkmentioning
confidence: 99%
“…ere were an enormous number of studies on hybrid system optimization over the past twenty years. Advanced technologies have been applied to the economic power dispatch problem in hybrid energy systems [5][6][7]. Most of such studies focused on power ow control strategies where the demand side was rather considered constraints in the system.…”
A technoeconomic optimization problem for a domestic grid-connected PV-battery hybrid energy system is investigated. It incorporates the appliance time scheduling with appliance-specific power dispatch. The optimization is aimed at minimizing energy cost, maximizing renewable energy penetration, and increasing user satisfaction over a finite horizon. Nonlinear objective functions and constraints, as well as discrete and continuous decision variables, are involved. To solve the proposed mixed-integer nonlinear programming problem at a large scale, a competitive swarm optimizer-based numerical solver is designed and employed. The effectiveness of the proposed approach is verified by simulation results.
“…Another important topic is about the valve point effect [28][29][30][31][32][33][34][35][36][37][38][39][40][41]. Many meaningful works are focused on the valve point effect, such as evolutionary programming [28,29], genetic algorithm [30][31][32][33], and particle swarm optimisation [34,35].…”
The distributed prescribed finite time consensus schemes for economic dispatch (ED) of smart grids with and without the valve point effect are researched in this paper. First, the optimization problem is transformed into a consensus of multiagent system problem, where both with and without the valve point effect are considered. Second, for the directed balance network, a prescribed finite time method has been arranged to solve the ED problem with and without the valve point effect. Third, with considering the constraints of generation units, the prescribed finite time result is also achieved. Finally, from the simulations, the efficiency of the proposed algorithms is validated.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.