A novel numerical optimization algorithm inspired from weed colonization

Mehrabian, Ali Reza; Lucas, Caro

doi:10.1016/j.ecoinf.2006.07.003

Cited by 1,241 publications

(656 citation statements)

References 8 publications

Supporting

Mentioning

647

Contrasting

Unclassified

Order By: Relevance

“…Inspired from the behavior of colonization of invasive weeds in nature that try to find a suitable place for growth and reproduction, the invasive weed optimization was first proposed by Mehrabian and Lucas for solving continuous optimization problems [12], has found several applications in antenna design [13][14][15][16][17] as well as array's far field pattern synthesis [18][19][20][21][22][23]. All the attempts have shown the robustness, high efficiency of the IWO.…”

Section: Description Of the Iwo-ift Methodsmentioning

confidence: 99%

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Wang¹,

Jiao²,

Liu³

et al. 2013

PIER

View full text Add to dashboard Cite

Abstract-The iterative Fourier technique (IFT) is a high efficiency method that was proposed in recent past for the synthesis of large planar thinned arrays with isotropic radiating elements. However, the selection mechanism of IFT cannot always include the most useful elements in the "turned ON" families, which make the method trap in some local minima. Therefore, in this paper, inspired by invasive weed optimization (IWO) algorithm, a developed version of the iterative Fourier technique (IFT), IWO-IFT, is proposed for thinning large planar arrays. In this new method, the initial weeds are produced by IFT, and are further perturbed by IWO through repeatedly reproduction, dispersion, and exclusion over search space to find better weeds. Numerical results for synthesizing different circular thinned arrays demonstrated the superiority of IWO-IFT over the IFT method.

show abstract

Section: Description Of the Iwo-ift Methodsmentioning

confidence: 99%

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Wang¹,

Jiao²,

Liu³

et al. 2013

PIER

View full text Add to dashboard Cite

show abstract

“…In order to overcome the drawbacks of BIWO, adaptive dispersion mechanism is integrated in the BIWO algorithm. The adaptive dispersion mechanism is that the δ cur of the current generation distribute linearly among the weeds as weed with the highest fitness achieves the lowest δ cur , and the lowest fitness achieves the highest δ cur , which can be represented by Equation (12). j is the index of weeds in the colony sorted according to their fitness, and σ cur can be calculated by Equation (1).…”

Section: Ibiwomentioning

confidence: 99%

“…The IWO algorithm may be summarized as four steps, and more details can be found in [12]: (I) Initialization: In this step, the solutions are randomly initialized and dispersed in the given ddimensional search space. (II) Reproduction: In this step the parent weed produces seeds depending on its own fitness as well as the colony's lowest and highest fitness.…”

Section: Continuous Iwomentioning

confidence: 99%

“…In 2006, a derivative-free, metaheuristic algorithm proposed by Mehrbian and Lucas in [12], known as the Invasive Weed Optimization, mimicking the ecological behavior of colonizing weeds. Since its inception, IWO has found successful application in many electromagnetic problems like design of Printed Yagi Antenna [13], E-shaped MIMO antenna [14], multi-feed reflector antennas [15], Broadband Patch Antenna [16], Conformal Phased Arrays [17], Circular Antenna Arrays [18] etc..…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis of Thinned Array With Side Lobe Levels Reduction Using Improved Binary Invasive Weed Optimization

Liu¹,

Wu²

2014

PIER M

View full text Add to dashboard Cite

Abstract-As a very powerful optimization algorithm, invasive weed optimization has been widely applied to continuous optimization problems in electromagnetic (EM) field. However, the optimization of a thinned array can be formulated as a discrete-variable optimization problem with solutions encoded as binary strings. Therefore, in this paper, an improved binary invasive weed optimization (IBIWO) is proposed to design a thinned array with minimum side lobe levels. To evaluate the performance of the proposed algorithm, two examples have been presented and solved. Simulation results of the proposed thinned arrays obtained by IBIWO are compared with published results to verify the effectiveness of the proposed method.

show abstract

“…Aktualnie realizowana iteracja nosi numer iter, a łączna liczba iteracji (iter max ), równoważna łącznej liczbie populacji, może zostać zadana jako kryterium stopu algorytmu lub -jeśli kryterium stopu jest czas obliczeń -może zostać oszacowana na tej podstawie. Wynikająca z formuły (1) tendencja do stopniowego zmniejszania odległości dla kolejnych populacji zgodna jest z intencją autorów oryginalnej wersji algorytmu IWO [8,10,14].…”

unclassified

Verification of the Search Space Exploration Strategy Based on the Solutions of the Join Ordering Problem

Kostrzewa

Josiński

2011

Advances in Intelligent and Soft Computing

View full text Add to dashboard Cite

Streszczenie. Artykuł stanowi próbę oceny jakości autorskiej strategii eksploracji przestrzeni poszukiwań dla problemu określenia kolejności realizacji złączeń w zapytaniu adresowanym do bazy danych. Jakość strategii zostanie oceniona przez porównanie czasów wykonania zapytania, uzyskanych w systemie SQL Server 2008: z jednej strony przez realizację planu wygenerowanego za pomocą algorytmu IWO, z drugiej zaś -przez realizację planu wyznaczonego przez moduł optymalizacyjny systemu zarządza-nia bazą danych.Słowa kluczowe: eksploracja przestrzeni poszukiwań, określenie kolejności realizacji złączeń, algorytm IWO VERIFICATION OF THE SEARCH SPACE EXPLORATION STRATEGY BASED ON THE SOLUTIONS OF THE JOIN ORDERING PROBLEMSummary. The paper addresses the problem of quality estimation of the search space exploration strategy. The strategy is used to find a satisfying solution to the join ordering problem, which constitutes a crucial part of the database query optimization task. The method of strategy verification is based on the comparison of the execution time for the solution produced by the IWO algorithm with the execution time for the solution determined by the SQL Server 2008 optimizer.

show abstract

A novel numerical optimization algorithm inspired from weed colonization

Cited by 1,241 publications

References 8 publications

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Synthesis of Large Planar Thinned Arrays Using Iwo-Ift Algorithm

Synthesis of Thinned Array With Side Lobe Levels Reduction Using Improved Binary Invasive Weed Optimization

Verification of the Search Space Exploration Strategy Based on the Solutions of the Join Ordering Problem

Contact Info

Product

Resources

About