This repository contains implementations of bio-inspired algorithms for solving combinatorial optimization problems, specifically focusing on the Knapsack Problem and the Cutting Stock Problem. The algorithms are based on Genetic Algorithms, a nature-inspired optimization technique.
-
Caio Henrique Araujo Braga
- Email: chab@cin.ufpe.br
-
Iara Yasmim Batista Pereira
- Email: iybp@cin.ufpe.br
The repository is organized as follows:
knapsack_problem/: Implementation of Genetic Algorithm for solving the Knapsack Problem.-
implementacaoKnapsack.py: Python script containing the genetic algorithm for the Knapsack Problem. -
utils.py: Utility functions used by both problem implementations. -
analiseKnapsack.ipynb: Python script containing the genetic algorithm for the Knapsack Problem.
-
The implementations use Python and require the following libraries:
random: Python built-in library for generating random numbers.os: Python built-in library for interacting with the operating system.pandas: A library providing high-performance, easy-to-use data structures and data analysis tools for Python.matplotlib.pyplot: A plotting module in Python's matplotlib library for creating static, interactive, and animated visualizations.
We welcome contributions and feedback. If you have any suggestions or find issues, please feel free to open an issue or submit a pull request.
This project is licensed under the MIT License.
Centro de Informática (CIn), UFPE