Bandingkan metode
Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.
| Algoritma Optimasi Paus (Whale Optimization Algorithm, WOA)× | Annealing Simulasi× | |
|---|---|---|
| Bidang | Optimasi | Optimasi |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 2016 | 1983 |
| Pencetus≠ | Seyedali Mirjalili & Andrew Lewis | — |
| Tipe≠ | Swarm-based metaheuristic | Probabilistic metaheuristic / local search |
| Sumber perintis≠ | Mirjalili, S. & Lewis, A. (2016). The Whale Optimization Algorithm. Advances in Engineering Software, 95, 51-67. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| Alias | WOA, Balina Optimizasyon Algoritması (WOA), bubble-net attacking method | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| Terkait | 5 | 5 |
| Ringkasan≠ | The Whale Optimization Algorithm (WOA) is a swarm-based metaheuristic introduced by Mirjalili and Lewis in 2016. It models the bubble-net hunting strategy of humpback whales, in which a group of whales spirals around prey while gradually tightening the encirclement. The algorithm balances global exploration and local exploitation through a small set of parameters and has become widely used in continuous engineering optimisation problems. | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. |
| ScholarGateSet data ↗ |
|
|