Chaos-Enhanced Cuckoo Search for Economic Dispatch with Valve Point Effects

Economic dispatch determines the optimal generation outputs to minimize the toal fuel cost while satisfying the load demand and operational constraints. Modern optimization techniques fail to solve the problem in a robust manner and finding robust global optimization techniques is necessary for efficient system operation. In this study, the potentiality of introducing chaos into the standard Cuckoo Search (CS) in order to further enhance its global search ability is investigated. Deterministic chaotic maps are random-based techniques that can provide a balanced exploration and exploitation searches for the algorithm. Four different variants are generated by carefully choosing four different locations (within the standard CS) with potential adoption of a candidate chaotic map.Then detailed studies are carried out on benchmark power system problems with four different locations to find out the most efficient one. The best of all test cases generated is chosen and compared with algorithms presented in the literature. The results show that the proposed method with the proposed chaotic map outperforms standard CS. Additionally, the chaos-enhanced CS has a very good performance in comparison with QPSO and NSS

Efficiency Analysis of Swarm Intelligence and Randomization Techniques

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and L\'evy flights. We will discuss how these techniques are used and their implications for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146

Firefly Algorithm: Recent Advances and Applications

Nature-inspired metaheuristic algorithms, especially those based on swarm intelligence, have attracted much attention in the last ten years. Firefly algorithm appeared in about five years ago, its literature has expanded dramatically with diverse applications. In this paper, we will briefly review the fundamentals of firefly algorithm together with a selection of recent publications. Then, we discuss the optimality associated with balancing exploration and exploitation, which is essential for all metaheuristic algorithms. By comparing with intermittent search strategy, we conclude that metaheuristics such as firefly algorithm are better than the optimal intermittent search strategy. We also analyse algorithms and their implications for higher-dimensional optimization problems.Comment: 15 page