On the Binarization of Grey Wolf Optimizer: A Novel Binary Optimizer Algorithm
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract Grey Wolf Optimizer (GWO) is a population-based evolutionary algorithm inspired by the hunting behaviour of grey wolves. GWO, in its basic form, is a real coded algorithm, therefore, it needs modifications to deal with binary optimization problems. In this paper, we review previous works on binarization of GWO, and classify them with respect to their encoding scheme, updating strategy, and transfer function. Then, we propose a novel binary GWO algorithm (named SetGWO), which is based on set encoding and uses set operations in its updating strategy. Experimental results on different real-world combinatorial optimization problems and different datasets, show that SetGWO outperforms other existing binary GWO algorithms in terms of quality of solutions, running time, and scalability.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0