Learning-guided iterated local search for the minmax multiple traveling salesman problem
Computers & Operations Research · 2026-01 · 185 · 107255
DOI: 10.1016/j.cor.2025.107255 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-01. Verfasst von Pengfei He und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Fundamental Research Funds for the Central Universities
- National Natural Science Foundation of China
Zitieren
APA
He, P., Hao, J., & Xia, J. (2026). Learning-guided iterated local search for the minmax multiple traveling salesman problem. Computers & Operations Research, 185, 107255. https://doi.org/10.1016/j.cor.2025.107255
Vancouver
He P, Hao J, Xia J. Learning-guided iterated local search for the minmax multiple traveling salesman problem. Computers & Operations Research. 2026;185:107255. doi:10.1016/j.cor.2025.107255
BibTeX
@article{He2026,
author = {He, Pengfei and Hao, Jin-Kao and Xia, Jinhui},
title = {Learning-guided iterated local search for the minmax multiple traveling salesman problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {185},
pages = {107255},
doi = {10.1016/j.cor.2025.107255}
}
EUVIMED