Skip to content
#

meta-heuristic-algorithms

Here are 9 public repositories matching this topic...

This repository implements the LAB (Leader Advocate Believer) Algorithm to solve the 0-1 Knapsack Problem, a classic optimization problem. The LAB Algorithm is inspired by human social interactions, simulating the roles of leaders, advocates, and believers to efficiently explore and exploit the solution space.

  • Updated Jun 21, 2024
  • Jupyter Notebook

This project aimed to implement three well-known meta-heuristic algorithms: cuckoo search (CS), bat algorithm (BA), and flower pollination algorithm (FPA). We found that three algorithms could have a promising performance generally. It might need more runs to be converged when training BA. The time cost of BA was the highest while the difference…

  • Updated Jun 30, 2021
  • Python

Improve this page

Add a description, image, and links to the meta-heuristic-algorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the meta-heuristic-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy