The DOI matches its Crossref record.
An ant colony algorithm for the multi-compartment vehicle routing problem
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Feature dimensionality reduction: a review
Jia, W., Sun, M., Lian, J., & Hou, S. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00637-x · Cited by 797
Electric vehicle routing problem with recharging stations for minimizing energy consumption
Zhang, S., Gajpal, Y., Appadoo, S. S., & Abdulkader, M. M. S. (2018) · International Journal of Production Economics · doi:10.1016/j.ijpe.2018.07.016 · Cited by 277
The role of artificial intelligence in photo-voltaic systems design and control: A review
Youssef, A., El-Telbany, M., & Zekry, A. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2017.04.046 · Cited by 202
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
Metadata
- Authors
- Reed, M., Yiannakou, A., & Evering, R.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2014-02
- Volume
- 15
- Pages
- 169-176
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2009168408
- Cited by
- 243
- References
- 0
- FWCI
- 33.99
- Type
- journal article
- Language
- en
- Open access
- green
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: An ant colony algorithm for the multi-compartment vehicle routing problem. https://app.cochat.ai/papers/10.1016/j.asoc.2013.10.017
- The paper
- Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing. https://doi.org/10.1016/j.asoc.2013.10.017
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.