Home › Entities › academia › Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem

Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem

Research article (Information Sciences, 2017) · cited 77× · AI/ML
academia openalex:W2748032639
Press Enter · cited answer in seconds

Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem

Summary

Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem is a scholarly article[1].

Key Facts

  • Hybrid discrete artificial bee colony algorithm with threshold 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). Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Retrieved May 24, 2026, from https://4ort.xyz/entity/hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem
MLA “Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem.
BibTeX @misc{4ortxyz_hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem}}, year = {2026}, url = {https://4ort.xyz/entity/hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem — https://4ort.xyz/entity/hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/hybrid-discrete-artificial-bee-colony-algorithm-with-threshold-acceptance-criterion-for-traveling-salesman-problem · Last refreshed: