Convergence analysis of the plant propagation algorithm for continuous global optimization

DOI10.1051/ro/2017037zbMath1401.90124OpenAlexW2614813668WikidataQ125998402 ScholiaQ125998402MaRDI QIDQ4553882

Megdouda Ourbih-Tari, Nassim Brahimi, Abdellah Salhi

Publication date: 1 November 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017037

zbMATH Keywords

convergence analysisglobal optimisationrandomised algorithmsstrawberry algorithm

Mathematics Subject Classification ID

Boolean programming (90C09) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the theoretical analysis of the plant propagation algorithms

Uses Software

• ABC

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties.
• Convergence of the simulated annealing algorithm for continuous global optimization
• ACO algorithms with guaranteed convergence to the optimal solution
• Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions
• A Convergence Proof for the Particle Swarm Optimiser
• Particle Swarm Optimization
• Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems
• Flower Pollination Algorithm for Global Optimization
• Evolutionary algorithms for continuous-space optimisation
• Equation of State Calculations by Fast Computing Machines
• Variable neighborhood search: Principles and applications

This page was built for publication: Convergence analysis of the plant propagation algorithm for continuous global optimization