The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
A genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
Static pickup and delivery problems: a classification scheme and survey
Berbeglia, G., Cordeau, J., Gribkovskaia, I. V., & Gilbert Laporte, A. (2007) · Top · doi:10.1007/s11750-007-0009-0 · Cited by 746
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
Reimann, M., Doerner, K., & Hartl, R. F. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00014-5 · Cited by 387
Yang, X. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821986-7.00015-9 · Cited by 374
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
Bianchessi, N., & Righini, G. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.014 · Cited by 259
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
Comparison of Three Evolutionary Algorithms: GA, PSO, and DE
Kachitvichyanukul, V. (2012) · Industrial Engineering and Management Systems · doi:10.7232/iems.2012.11.3.215 · Cited by 355
Self-citation
Metadata
- Authors
- Ai, T. J., & Kachitvichyanukul, V.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2009-05
- Volume
- 36
- Issue
- 5
- Pages
- 1693-1702
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W1973494611
- Cited by
- 419
- References
- 14
- FWCI
- 64.84
- Type
- journal article
- 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: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. https://app.cochat.ai/papers/10.1016/j.cor.2008.04.003
- The paper
- Ai, T. J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research. https://doi.org/10.1016/j.cor.2008.04.003
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.