Skip to content
#

crossover-operator

Here are 16 public repositories matching this topic...

This repository contains a C++ program that solves the Knapsack Problem using a Genetic Algorithm. The Knapsack Problem is a classic optimization problem where we aim to maximize the total value of items to be packed in a knapsack, given the knapsack's weight capacity and a set of items with their respective weights and values.

  • Updated Aug 29, 2023
  • C++

This program implements a genetic algorithm for curve fitting using a polynomial equation. The goal is to find the best coefficients for the polynomial equation that minimize the distance between the curve and a given set of data points. The genetic algorithm is used to search for the optimal solution by evolving a population of candidate solutions

  • Updated Aug 29, 2023
  • C++

In this project, I implemented an Evolutionary Algorithm (EA) to solve the Travelling Salesman Problem (TSP), a classic optimization challenge where the goal is to find the shortest route that visits a set of cities exactly once and returns to the starting point.

  • Updated Sep 15, 2024
  • Python

This project solves the GECCO19 Traveling Thief Problem (TTP) using a Multi-objective Evolutionary Algorithm (MOEA) to optimize both travel time (TSP) and profit (KNP) with advanced crossover, mutation, and selection operators

  • Updated Oct 6, 2024
  • Jupyter Notebook

Improve this page

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

Learn more