The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks
Open accessOverview
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 3,045
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Supply Chain Management: Strategy, Planning and Operations
Chopra, S., & Meindl, P. J. (2000) · Cited by 2,594
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Supply Chain Management: Strategy, Planning, and Operation
(2003) · International Journal of Quality & Reliability Management · doi:10.1108/02656710310461350 · Cited by 2,283
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
Cited by
A review on genetic algorithm: past, present, and future
Katoch, S., Chauhan, S. S., & Kumar, V. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10139-6 · Cited by 4,655
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
Jaafari, A., Zenner, E. K., Panahi, M., & Shahabi, H. (2019) · Agricultural and Forest Meteorology · doi:10.1016/j.agrformet.2018.12.015 · Cited by 299
Metadata
- Authors
- Soleimani, H., & Kannan, G.
- Venue
- Applied Mathematical Modelling
- Publisher
- Elsevier BV
- Published
- 2015-07
- Volume
- 39
- Issue
- 14
- Pages
- 3990-4012
- ISSN
- 0307-904X (ISSN-L)
- OpenAlex
- W2039397179
- Cited by
- 288
- References
- 37
- FWCI
- 66.99
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks. https://app.cochat.ai/papers/10.1016/j.apm.2014.12.016
- The paper
- Soleimani, H., & Kannan, G. (2015). A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks. Applied Mathematical Modelling. https://doi.org/10.1016/j.apm.2014.12.016
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.
