Name
Abstract | ||
|---|---|---|
Dynamic optimization problems (DOPs) are optimization problems that change over time, and most investigations in this area focus on tracking the moving optimum efficiently. However, continuously tracking a moving optimum is not practical in many real-world problems because changing solutions frequently is not possible or very costly. Recently, another practical way to tackle DOPs has been suggested: robust optimization over time (ROOT). In ROOT, the main goal is to find solutions that can remain acceptable over an extended period of time. In this paper, a new multi-swarm PSO algorithm is proposed in which different swarms track peaks and gather information about their behavior. This information is then used to make decisions about the next robust solution. The main goal of the proposed algorithm is to maximize the average number of environments during which the selected solutions' quality remains acceptable. The experimental results show that our proposed algorithm can perform significantly better than existing work in this aspect. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-55792-2_7 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Robust optimization over time,Robust optimization,Dynamic optimization,Benchmark problems,Tracking moving optima,Particle swarm optimization,Multi-swarm algorithm | Particle swarm optimization,Derivative-free optimization,Mathematical optimization,Robust optimization,Computer science,Meta-optimization,Multi-swarm optimization,Imperialist competitive algorithm,Optimization problem,Metaheuristic | Conference |
Volume | ISSN | Citations |
10200 | 0302-9743 | 4 |
PageRank | References | Authors |
0.39 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danial Yazdani | 1 | 131 | 8.36 |
| Trung Thanh Nguyen | 2 | 669 | 49.68 |
| Jürgen Branke | 3 | 2391 | 181.04 |
| Jin Wang | 4 | 202 | 15.69 |