Efficient harmony search algorithm for multi-stages scheduling problem for power systems degradation

Electrical Engineering (Impact Factor: 0.37). 09/2010; 92(3):87-97. DOI: 10.1007/s00202-010-0165-3


Usually power energy demand increases randomly with time. To enhance system performance, expansion-planning to adapt the power
system capacity to the demand is predicted. This paper uses a harmony search meta-heuristic optimization method to solve the
multi-stage expansion problem for multi-state series-parallel power systems. The study horizon is divided into several periods.
At each period the demand distribution is forecasted in the form of a cumulative demand curve. A multiple-choice of additional
components from a list of available products can be chosen and included into any subsystem component at any stage to improve
the system performance. The components are characterized by their cost, performance (capacity), and availability. The objective
is to minimize each investment over its study period while satisfying availability or performance constraints. A universal
generating function technique is applied to evaluate power system availability. The harmony search approach is required to
identify the optimal combination of adding components with different parameters to be allocated in parallel at each stage.

KeywordsExpansion-planning-Harmony search-Redundancy optimization-Power system-Universal generating moment function

Download full-text


Available from: A. Zeblah
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a new combinatorial solution strategy for security constrained unit commitment (SCUC) problem is presented. In the proposed combinatorial solution strategy, the unit states are determined by a new stochastic search method, which is an enhanced harmony search technique, and the security constrained economic dispatch problem is solved using an efficient nonlinear analytical solver based on numerical optimization. Moreover, the proposed solution strategy also includes a hybrid constraint handling method. The effectiveness of the proposed combinatorial solution strategy to solve the SCUC problem is shown on different test systems and compared with some of the most recently published research works in the area. These comparisons confirm the validity of the developed strategy.
    No preview · Article · Jan 2013 · International Journal of Electrical Power & Energy Systems
  • [Show abstract] [Hide abstract]
    ABSTRACT: An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one compares the CMOHS with NSGA-II, and the other one compares the CMOHS with the algorithm without the inductor individual. The results show that the CMOHS is more effective than NSGA-II, and the induction mechanism improved the convergence and diversity of the algorithm.
    No preview · Article · Oct 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Deep-water offshore drilling vessels, such as a semisubmersible drilling rig, use the dynamic positioning (DP) system and the thruster-assisted position-mooring system for maintaining a stationary position. In the DP system, the thrust allocator is used to distribute the desired generalized forces computed by the motion controller among the thrusters. However, to ensure safe operation of the vessel despite the thruster failure, the vessel is equipped with redundant thruster configuration and, therefore, is overactuated. For overactuated vessels, the choice of a particular solution for thrust allocation is found using some kind of optimization process. In this paper, the thrust allocator tries to minimize the power consumption and takes forbidden/spoil zones into account. The formulated thrust allocation problem becomes nonconvex due to thrust direction constraints on azimuth thrusters. The conventional methods get trapped in local minima and fail to find the optimum solution for the formulated nonconvex thrust allocation problem. In this paper, an improved harmony search (IHS) algorithm for solving the nonconvex thrust allocation problem is proposed. IHS is a variant of the harmony search (HS) algorithm. The HS algorithm is a music-based meta-heuristic optimization method, which is analogous with the music improvisation process where a musician continues to polish the pitches to obtain better harmony. Obtained numerical results show that the IHS algorithm has better convergence property when compared to the HS algorithm and the genetic algorithm (GA). Moreover, the power consumption for thrust allocation using the IHS algorithm is lower when compared with HS, GA, and Mincon (sequential quadratic programming) algorithms. The percentage savings in total power consumption for thruster allocation as compared to the Mincon algorithm for GA, HS, and IHS methods are 44.96%, 48.39%, and 51.58%, respectively.
    No preview · Article · Jul 2014 · IEEE Journal of Oceanic Engineering