Veuillez utiliser cette adresse pour citer ce document :
http://dspace1.univ-tlemcen.dz/handle/112/18248
Titre: | Optimization and Simulation Using Metaheuristic Algorithms. |
Auteur(s): | MOUALEK, Amina |
Mots-clés: | Optimization and Simulation Using Metaheuristic Algorithms. |
Date de publication: | 11-oct-2021 |
Editeur: | 31-01-2022 |
Référence bibliographique: | salle des thèses |
Collection/Numéro: | son.for.p.; |
Résumé: | In recent years, various Heuristic optimization methods have been developed. Some of these algorithms are inspired by swarm behaviors in nature others but Evolution and others are Physics based. In the first chapter of this work we covered the basic notions and definition that helped us understand the operating of metaheuristics In the second chapter we studied the methods that we were going to base our applications on as well as benchmark functions we used to test the performances of the said methods. And finally in the last chapter we put three metaheuristics to test by applying them to both constrained and unconstrained benchmark functions we showcased and discussed the results and compared them with previous studies. The three metaheuristics are : 1. The particle swarm algorithm inspired by swarm behavious. 2. The differential evolution inspired by evolutionary process. 3. The gravitational search algorithm inspired by Newtonian physics. The three algorithms showcased in this report have all proven themselves efficient methods to turn to when it comes to not only on unconstrained problems but also on constrained problems. For these reasons it would be very interesting to apply these methods on real existing physics problems |
URI/URL: | http://dspace.univ-tlemcen.dz/handle/112/18248 |
Collection(s) : | Master en Physique |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
Optimization-and-Simulation-Using-Metaheuristic..pdf | CD | 3 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.