A New Multiagent Algorithm for Dynamic Continuous Optimization

Julien Lepagnot, Amir Nakib, Hamouche Oulhadj and Patrick Siarry
Additional contact information
Julien Lepagnot: Université de Paris 12, France
Amir Nakib: Université de Paris 12, France
Hamouche Oulhadj: Université de Paris 12, France
Patrick Siarry: Université de Paris 12, France

International Journal of Applied Metaheuristic Computing (IJAMC), 2010, vol. 1, issue 1, 16-38

Abstract: Many real-world problems are dynamic and require an optimization algorithm that is able to continuously track a changing optimum over time. In this paper, a new multiagent algorithm is proposed to solve dynamic problems. This algorithm is based on multiple trajectory searches and saving the optima found to use them when a change is detected in the environment. The proposed algorithm is analyzed using the Moving Peaks Benchmark, and its performances are compared to competing dynamic optimization algorithms on several instances of this benchmark. The obtained results show the efficiency of the proposed algorithm, even in multimodal environments.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2010102602 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:1:y:2010:i:1:p:16-38

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().