OptaplannerAI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
Scikit OptGenetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)
OpenJijOpenJij : Framework for the Ising model and QUBO.
ai-n-queensSolving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
Mathematical-ModelingA sharing of the learning process of mathematical modeling 数学建模常用工具模型算法分享:数学建模竞赛优秀论文,数学建模常用算法模型,LaTeX论文模板,SPSS工具分享。
AscensionA metaheuristic optimization framework
optapyOptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
VariationalNeuralAnnealingA variational implementation of classical and quantum annealing using recurrent neural networks for the purpose of solving optimization problems.
Metaheuristics.jlHigh-performance metaheuristics for optimization coded purely in Julia.
soptsopt:A simple python optimization library
AI-Programming-using-PythonThis repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach
KnapsackFXSolving Knapsack 0/1 problem with various Local Search algorithms like Hill Climbing, Genetic Algorithms, Simulated Annealing, Tabu Search