Lévy flights in binary optimization

December 2013
Problems of Improving the Efficiency of Infrastructure;2013, Vol. 23 Issue 4, p447
Academic Journal
There are many optimization heuristics which involves mutation operator. Reducing them to binary optimization allows to study properties of binary mutation operator. Modern heuristics yield from Lévy flights behavior, which is a bridge between local search and random shooting in binary space. The paper is oriented to statistical analysis of binary mutation with Lévy flight inside and Quantum Tunneling heuristics.


Related Articles

  • Optimization of Circular Antenna Arrays Using a Differential Search Algorithm. Recioui, A. // Acta Physica Polonica, A.;Aug2015, Vol. 128 Issue 2B, pB-7 

    Circular and concentric circular antenna array patterns are synthesized to generate array factors with minimum side-lobe level and high directivity. The comprehensive learning differential search algorithm is used for synthesizing a one-and a three-ring circular and concentric circular antenna...

  • Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization. DRAŽIĆ, MILAN; DRAŽIĆ, ZORICA; MLADENOVIĆ, NENAD; UROŠEVIĆ, DRAGAN; QIU HONG ZHAO // IMA Journal of Management Mathematics;Jan2016, Vol. 27 Issue 1, p75 

    Several variants of variable neighbourhood search (VNS) for solving unconstrained and constrained continuous optimization problems have been proposed in the literature. In this paper, we suggest two new variants, one of which uses the recent modified Nelder-Mead (MNM) direct search method as a...

  • Cuckoo Search Algorithm using Lèvy Flight: A Review. Roy, Sangita; Chaudhuri, Sheli Sinha // International Journal of Modern Education & Computer Science;Dec2013, Vol. 5 Issue 12, p10 

    Cuckoo Search (CS) is a new met heuristic algorithm. It is being used for solving optimization problem. It was developed in 2009 by Xin- She Yang and Susah Deb. Uniqueness of this algorithm is the obligatory brood parasitism behavior of some cuckoo species along with the Levy Flight behavior of...

  • Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. Hanafi, Saïd; Rebai, Ahmed-Riadh; Vasquez, Michel // Journal of Heuristics;Aug2013, Vol. 19 Issue 4, p645 

    The unconstrained binary quadratic minimization problem is known to be NP-hard and due to its computational challenge and application capability, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is...

  • Solving Optimal Power Flow Using Cuckoo Search Algorithm with Feedback Control and Local Search Mechanism. Gonggui Chen; Xingting Yi; Zhizhong Zhang; Shiyuan Qiu // IAENG International Journal of Computer Science;2019, Vol. 46 Issue 2, p321 

    Cuckoo search (CS) algorithm is a novel heuristic algorithm, which can effectively solve the optimization problem by simulating the brood parasitism of some cuckoo species and combining with Lévy flight mechanism. However, it has also been shown to have certain weaknesses, especially falling...

  • An Efficient Algorithm for the Knapsack Sharing Problem. Hifi, Mhand; Sadfi, Slim; Sbihi, Abdelkader // Computational Optimization & Applications;Oct2002, Vol. 23 Issue 1, p27 

    The Knapsack Sharing Problem (KSP) is an NP-Hard combinatorial optimization problem, admitted in numerous real world applications. In the KSP, we have a knapsack of capacity c and a set of n objects, namely N, where each object j, j = 1,..., n, is associated with a profit pj and a weight wj. The...

  • A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem. Defu Zhang; Lijun Wei; Leung, Stephen C. H.; Qingshan Chen // INFORMS Journal on Computing;Spring2013, Vol. 25 Issue 2, p332 

    This paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision...

  • Harmony search algorithm for power system stabilizer tuning. Boroujeni, Sayed Mojtaba Shirvani; Boroujeni, Babak Keyvani; Delafkar, Hamideh; Behzadipour, Elahe; Hemmati, Reza // Indian Journal of Science & Technology;Sep2011, Vol. 4 Issue 9, p1025 

    The problem of tuning Power system stabilizers (PSSs) is commonly formulated as a nonlinear optimization problem with some constraints. In this paper a new optimization technique based on Harmony Search (HS) to solve the proposed optimization problem is presented. This is a very complex...

  • Harmony search algorithm for STATCOM controllers tuning in a multi machine environment. Boroujeni, Sayed Mojtaba Shirvani; Boroujeni, Babak Keyvani; Delafkar, Hamideh; Behzadipour, Elahe; Hemmati, Reza // Indian Journal of Science & Technology;Sep2011, Vol. 4 Issue 9, p1031 

    This paper presents the application of static synchronous compensator (STATCOM) to voltage support in a multimachine electric power system. Harmony Search (HS) Algorithm as a meta-heuristic optimization method is considered for tuning the parameters of STATCOM. In order to evaluate the...

  • Determination of Line Opening Strategies Using Tabu Search for Voltage Security. Bonggyu Sung; Hwachang Song // International Journal of Software Engineering & Its Applications;Jun2014, Vol. 8 Issue 6, p157 

    The paper presents an algorithm for determining line opening strategies of power systems in voltage critical situations. The voltage security mainly considered in this paper is the local high voltage problem in the circumstances where the system load demand is critically low. Assuming that...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics