Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)

OplaPlanner has moved to https://github.com/apache/incubator-kie-drools. This repository is archived. OptaPlanner is an AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

Lightweight optimization with local, global, population-based and sequential techniques across mixed search spaces

🎯 A comprehensive gradient-free optimization framework written in Python

Configurable procedural layout generator

The purpose of this repository is to make prototypes as case study in the context of proof of concept(PoC) and research and development(R&D) that I have written in my website. The main research topics are Auto-Encoders in relation to the representation learning, the statistical machine learning for energy-based models, adversarial generation net…

OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.

High-performance metaheuristics for optimization coded purely in Julia.

Vehicle Routing Problem (VRP) using Simulated Annealing (SA) with Matlab / 模拟退火

Morph an input dataset of 2D points into select shapes, while preserving the summary statistics to a given number of decimal points through simulated annealing. It is intended to be used as a teaching tool to illustrate the importance of data visualization.

OpenJij : Framework for the Ising model and QUBO.

A solver to find a solution of the 2D rectangle packing problem by simulated annealing (SA) optimization.

Bayesian Optimization of Combinatorial Structures

A sharing of the learning process of mathematical modeling 数学建模常用工具模型算法分享：数学建模竞赛优秀论文，数学建模常用算法模型，LaTeX论文模板，SPSS工具分享。

Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer

A Java library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms

This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

This repository demonstrates how the Presentation Scheduling problem, which is analogous to the famous University Course Timetabling Problem (UCTP), can be solved using the Hybrid Genetic Algorithm-Simulated Annealing (HGASA) algorithm.

Metaheuristics / Blackbox Optimization Algorithms for Go: Simulated Annealing, Genetic Algorithm, Ant Colony Optimization, Tabu Search, Particle Swarm Optimization ...

Parameterising Simulated Annealing for the Travelling Salesman Problem