The Traveling Salesman Problem (TSP) is a well-known NP-hard problem that receives attention in many fields. To solve the NP-hard problems, Ant Colony Optimization (ACO) is a popular meta-heuristic ...

Capacitated vehicle routing problem implemented in python using DEAP package. Non dominated sorting Genetic algorithm is used to solve Multiobjective problem of minimizing Total distance travelled by ...

In real life, robots are subject to multiple constraints when moving in complex scenes, which can lead to problems such as poor optimization ability, unsmooth path planning, and slow convergence speed ...

Contribute to Josue2446/8-Queens-problem-Genetic-algorithm- development by creating an account on GitHub.