EVOLUTIONARY ALGORITHM BASED ON SIMULATED ANNEALING FOR THE MULTI-OBJECTIVE OPTIMIZATION OF COMBINATORIAL PROBLEMS
This paper states a novel hybrid-metaheuristic based on the Theory of Deterministic Swapping, Theory of Evolution and Simulated Annealing Meta-heuristic for the multi-objective optimization of combinatorial problems. The proposed algorithm is named EMSA. It is an improvement of MODS algorithm. Unlik...
שמור ב:
| הוצא לאור ב: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Principais autores: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
International Journal of Combinatorial Optimization Problems and Informatics
2013
|
| נושאים: | |
| גישה מקוונת: | https://www.redalyc.org/articulo.oa?id=265229633005 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
