Home ›
Entities
› academia
› A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
Research article (European Journal of Operational Research, 2020) · cited 58× · AI/ML
A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
Summary
A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles is a scholarly article[1].
Key Facts
A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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.
APA4ort.xyz Knowledge Graph. (2026). A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-parallelised-large-neighbourhood-search-heuristic-for-the-asymmetric-two-echelon-vehicle-routing-problem-with-swap-con
MLA“A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-parallelised-large-neighbourhood-search-heuristic-for-the-asymmetric-two-echelon-vehicle-routing-problem-with-swap-con.
BibTeX@misc{4ortxyz_a-parallelised-large-neighbourhood-search-heuristic-for-the-asymmetric-two-echelon-vehicle-routing-problem-with-swap-con_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles}}, year = {2026}, url = {https://4ort.xyz/entity/a-parallelised-large-neighbourhood-search-heuristic-for-the-asymmetric-two-echelon-vehicle-routing-problem-with-swap-con}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles — https://4ort.xyz/entity/a-parallelised-large-neighbourhood-search-heuristic-for-the-asymmetric-two-echelon-vehicle-routing-problem-with-swap-con (retrieved 2026-05-24)
