Home › Entities › academia › Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem

Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem

Research article (Future Generation Computer Systems, 2020) · cited 42× · AI/ML
academia openalex:W3043544546
Press Enter · cited answer in seconds

Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem

Summary

Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem is a scholarly article[1].

Key Facts

  • Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen 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 genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem. Retrieved May 24, 2026, from https://4ort.xyz/entity/hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble
MLA “Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble.
BibTeX @misc{4ortxyz_hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem}}, year = {2026}, url = {https://4ort.xyz/entity/hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem — https://4ort.xyz/entity/hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/hybrid-genetic-algorithm-with-variable-neighborhood-search-for-multi-scale-multiple-bottleneck-traveling-salesmen-proble · Last refreshed: