Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 408

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Particle swarm optimization for traveling salesman problem

Kang-Ping Wang, Lan Huang, Chun-Guang Zhou, Wei Pang·2004·Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)

Abstract

This paper proposes a new application of particle swarm optimization for traveling salesman problem. We have developed some special methods for solving TSP using PSO. We have also proposed the concept of swap operator and swap sequence, and redefined some operators on the basis of them, in this way the paper has designed a special PSO. The experiments show that it can achieve good results.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icmlc.2003.1259748

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 7 references

Metadata

Authors
Wang, K.-P., Huang, L., Zhou, C.-G., & Pang, W.
Venue
Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)
Publisher
IEEE
Published
2004-06-21
Pages
1583-1585
OpenAlex
W2149523634
Cited by
408
References
7
FWCI
8.89
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: Particle swarm optimization for traveling salesman problem. https://app.cochat.ai/papers/10.1109/icmlc.2003.1259748
The paper
Wang, K.-P., Huang, L., Zhou, C.-G., & Pang, W. (2004). Particle swarm optimization for traveling salesman problem. Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693). https://doi.org/10.1109/icmlc.2003.1259748

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.