The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition
Abstract
This paper proposes an algorithm for optimization inspired by the imperialistic competition. Like other evolutionary ones, the proposed algorithm starts with an initial population. Population individuals called country are in two types: colonies and imperialists that all together form some empires. Imperialistic competition among these empires forms the basis of the proposed evolutionary algorithm. During this competition, weak empires collapse and powerful ones take possession of their colonies. Imperialistic competition hopefully converges to a state in which there exist only one empire and its colonies are in the same position and have the same cost as the imperialist. Applying the proposed algorithm to some of benchmark cost functions, shows its ability in dealing with different types of optimization problems.
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
Artificial evolution for computer graphics
Sims, K. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122752 · Cited by 741
Cited by
Digital twin-driven rapid individualised designing of automated flow-shop manufacturing system
Liu, Q., Zhang, H., Leng, J., & Chen, X. (2019) · International Journal of Production Research · doi:10.1080/00207543.2018.1471243 · Cited by 370
Merrikh-Bayat, F. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.048 · Cited by 134
New hybrid method for heart disease diagnosis utilizing optimization algorithm in feature selection
Nourmohammadi-Khiarak, J., Feizi-Derakhshi, M.-R., Behrouzi, K., Mazaheri, S., Zamani-Harghalani, Y., & Tayebi, R. M. (2020) · Health and Technology · doi:10.1007/s12553-019-00396-3 · Cited by 109
Hashemzadeh, M., & Zademehdi, A. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.04.019 · Cited by 100
Application of Artificial Neural Network in Tunnel Engineering: A Systematic Review
Wang, X., Lu, H., Wei, X., Wei, G., Behbahani, S. S., & Iseley, T. (2020) · IEEE Access · doi:10.1109/access.2020.3004995 · Cited by 70
Metadata
- Authors
- Atashpaz-Gargari, E., & Lucas, C.
- Venue
- 2007 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2007-09
- Pages
- 4661-4667
- OpenAlex
- W2033011996
- Cited by
- 2,628
- References
- 1
- FWCI
- 7.59
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. https://app.cochat.ai/papers/10.1109/cec.2007.4425083
- The paper
- Atashpaz-Gargari, E., & Lucas, C. (2007). Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. 2007 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/cec.2007.4425083
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.
