Topics

Metaheuristics

24 posts

Metaheuristics are general search strategies for hard optimization problems, where exact methods are too slow or the model is not smooth. They give up the guarantee of the very best answer in return for good answers in reasonable time.

Here you will find clear MATLAB and Python implementations of the classic methods, from simulated annealing and tabu search to particle swarm optimization and ant colony optimization. Each post explains how the method works and gives code that you can run and adapt.