Metraipolis › archive › dc_8908df192301

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem — Europe PMC PMID:27812175

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/27812175
DOI
10.1371/journal.pone.0165804
License (as archived)
solo-consultazione
Archived
2026-10-08T15:53:40.621Z
SHA-256 of the archived text
e41101f98bf7bc6b8b64d0ecc12040719d40f681e5de3be941bc694b3856bca8
Stable URL of this page
https://metraipolis.com/documento/dc_8908df192301

How to cite

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem — Europe PMC PMID:27812175 — Europe PMC (en), https://europepmc.org/article/MED/27812175 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_8908df192301 (Metraipolis archive dc_8908df192301, sha256 e41101f98bf7bc6b8b64d0ecc12040719d40f681e5de3be941bc694b3856bca8)
BibTeX
@misc{dc8908df192301,
  title = {A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem — Europe PMC PMID:27812175},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/27812175},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_8908df192301; sha256 e41101f98bf7bc6b8b64d0ecc12040719d40f681e5de3be941bc694b3856bca8},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/27812175. Agents can read the archived copy with the MCP tool read_document.