The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach
Abstract
Honey-bees are one of the most well studied social insects. They exhibit many features that distinguish their use as models for intelligent behavior. These features include division of labor, communication on the individual and group level, and cooperative behavior. In this paper, we present a unified model for the marriage in honey-bees within an optimization context. The model simulates the evolution of honey-bees starting with a solitary colony (single queen without a family) to the emergence of an eusocial colony (one or more queens with a family). From optimization point of view, the model is a committee machine approach where we evolve solutions using a committee of heuristics. The model is applied to a fifty propositional satisfiability problems (SAT) with 50 variables and 215 constraints to guarantee that the problems are centered on the phase transition of 3-SAT. Our aim in this paper is to analyze the behavior of the algorithm using biological concepts (number of queens, spermatheca size, and number of broods) rather than trying to improve the performance of the algorithm while losing the underlying biological essence. Notwithstanding, the algorithm outperformed WalkSAT, one of the state-of-the-art algorithms for SAT.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Swarm Intelligence: From Natural to Artificial Systems
Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780195131581.001.0001 · Cited by 6,435
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
Dorigo, M., Bonabeau, E., & Theraulaz, G. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(00)00042-x · Cited by 816
Noise strategies for improving local search
Selman, B., Kautz, H., & Cohen, B. (1994) · Cited by 757
Local search strategies for satisfiability testing
Selman, B., Kautz, H., & Cohen, B. (1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026/25 · Cited by 516
Domain-independent extensions to GSAT: solving large structured satisfiability problems
Selman, B., & Kautz, H. (1993) · Cited by 291
From Natural to Artificial Swarm Intelligence
Bonabeau, E. W., Dorigo, M., & Guy Theraulaz, A. (1999) · Oxford University Press eBooks · Cited by 278
Local Search Strategies for Satisfiability Testing
Selman, B., Kautz, H., & Cohen, B. (1995) · Cited by 235
Local Search Algorithms for SAT: An Empirical Evaluation
Hoos, H. H., & Stützle, T. (2000) · Journal of Automated Reasoning · doi:10.1023/a:1006350622830 · Cited by 175
An empirical study of greedy local search for satisfiability testing
Selman, B., & Kautz, H. (1993) · Cited by 131
Dietz, A. (1986) · Elsevier eBooks · doi:10.1016/b978-0-12-588920-9.50006-6 · Cited by 9
Cited by
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
A comprehensive survey: artificial bee colony (ABC) algorithm and applications
Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9328-0 · Cited by 1,975
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Metadata
- Authors
- Abbass, H. A.
- Venue
- Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 1
- Pages
- 207-214
- OpenAlex
- W1957692442
- Cited by
- 380
- References
- 16
- FWCI
- 1.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.