Metaheuristic methods are approximate algorithms that produce efficient and appropriate solutions in an acceptable time for complex optimization problems to which conventional optimization algorithms are not able to provide an acceptable solution. Metaheuristic methods can provide efficient solutions to many different problems, such as scheduling, routing, timetabling, graph coloring owing to being easily adjustable to different problems. In this study, metaheuristic methods are classified as single solution based metaheuristic methods and population based metaheuristic methods based on solution number in search and the main algorithms of each class are introduced. In addition, primary application areas of metaheuristic methods are presented
Alan : Sosyal, Beşeri ve İdari Bilimler
Dergi Türü : Ulusal
Benzer Makaleler | Yazar | # |
---|
Makale | Yazar | # |
---|