Some metaheuristics for the optimization of complex systems are proposed in this paper. The metaheuristic approaches can be separate in two classes: the local search techniques and the global ones. An important difficulty which appears in complex optimization problems is the existence of constraints which can be strict and inviolable or soft. To resolve these problems, some hybrid approaches are considered.
Optimization, complex systems, metaheuristics, tabu search, simulated annealing, genetic algorithms, ant colony optimization, particle swarm optimization, tunneling Algorithms.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).