Abstract
The metaheuristics can be conceived as general strategies for designing heuristic procedures with high performance. In this paper we deal with the fundamentals for stating the concept of metehuristic. The metaheuristic strategies refer to the design of some of the fundamental types of heuristic procedures for solving an optimization problem. We provide a description of the main metaheuristics for relaxation procedures, constructive processes, neighbourhood searches and evolutive procedures. We deal specially with the search metaheuristics that constitute the central paradigm of these techniques in the solution of optimisation problems. We propose and analyse the desirable characteristics of the metaheuristics, from their theoretical study and practical application points of view.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
