Inproceedings103: Unterschied zwischen den Versionen
K (Added from ontology) |
Uri (Diskussion | Beiträge) |
||
(Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
Zeile 1: | Zeile 1: | ||
+ | {{Publikation Erster Autor | ||
+ | |ErsterAutorNachname=Guntsch | ||
+ | |ErsterAutorVorname=Michael | ||
+ | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
|Author=Martin Middendorf | |Author=Martin Middendorf | ||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Zeile 14: | Zeile 14: | ||
|Pages=111-122 | |Pages=111-122 | ||
|Series=LNCS | |Series=LNCS | ||
− | |Volume=2463 | + | |Volume=2463 |
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Population based ACO algorithms for dynamic optimization problems are studied in this paper. In the population based approach a set of solutions is transferred from one iteration of the algorithm to the next instead of transferring pheromone information as in most ACO algorithms. The set of solutions is then used to compute the pheromone information for the ants of the next iteration. The population based approach can be used to solve dynamic optimization problems when a good solution of the old instance can be modified after a change of the problem instance so that it represents a reasonable solution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared. | |Abstract=Population based ACO algorithms for dynamic optimization problems are studied in this paper. In the population based approach a set of solutions is transferred from one iteration of the algorithm to the next instead of transferring pheromone information as in most ACO algorithms. The set of solutions is then used to compute the pheromone information for the ants of the next iteration. The population based approach can be used to solve dynamic optimization problems when a good solution of the old instance can be modified after a change of the problem instance so that it represents a reasonable solution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared. | ||
− | + | |Forschungsgruppe=Effiziente Algorithmen | |
− | |||
− | |Forschungsgruppe= | ||
}} | }} | ||
{{Forschungsgebiet Auswahl | {{Forschungsgebiet Auswahl | ||
|Forschungsgebiet=Ameisenalgorithmen | |Forschungsgebiet=Ameisenalgorithmen | ||
}} | }} |
Aktuelle Version vom 24. September 2009, 20:19 Uhr
Applying Population based ACO to Dynamic Optimization Problems
Applying Population based ACO to Dynamic Optimization Problems
Published: 2002
Buchtitel: Ant Algorithms, Proceedings of Third International Workshop ANTS 2002
Ausgabe: 2463
Reihe: LNCS
Seiten: 111-122
Referierte Veröffentlichung
BibTeX
Kurzfassung
Population based ACO algorithms for dynamic optimization problems are studied in this paper. In the population based approach a set of solutions is transferred from one iteration of the algorithm to the next instead of transferring pheromone information as in most ACO algorithms. The set of solutions is then used to compute the pheromone information for the ants of the next iteration. The population based approach can be used to solve dynamic optimization problems when a good solution of the old instance can be modified after a change of the problem instance so that it represents a reasonable solution for the new problem instance. This is tested experimentally for a dynamic TSP and dynamic QAP problem. Moreover the behavior of different strategies for updating the population of solutions are compared.