Home › Entities › academia › Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem

Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem

Research article (Swarm and Evolutionary Computation, 2018) · cited 107× · AI/ML
academia openalex:W2793329764
Press Enter · cited answer in seconds

Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem

Summary

Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem is a scholarly article[1].

Key Facts

  • Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Retrieved May 24, 2026, from https://4ort.xyz/entity/discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling
MLA “Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling.
BibTeX @misc{4ortxyz_discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem}}, year = {2026}, url = {https://4ort.xyz/entity/discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem — https://4ort.xyz/entity/discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/discrete-comprehensive-learning-particle-swarm-optimization-algorithm-with-metropolis-acceptance-criterion-for-traveling · Last refreshed: