Skip to content
#

meta-heuristic-optimization

Here are 4 public repositories matching this topic...

Language: All
Filter by language

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 3, 2024
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the meta-heuristic-optimization 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-optimization topic, visit your repo's landing page and select "manage topics."

Learn more