Crossref
A reinforced hybrid genetic algorithm for the traveling salesman problem
Computers & Operations Research · 2023-09 · 157 · 106249
DOI: 10.1016/j.cor.2023.106249 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2023-09. Verfasst von Jiongzhi Zheng und 3 weiteren Autor:innen. Die Arbeit wurde bisher 43-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zheng, J., Zhong, J., Chen, M., & He, K. (2023). A reinforced hybrid genetic algorithm for the traveling salesman problem. Computers & Operations Research, 157, 106249. https://doi.org/10.1016/j.cor.2023.106249
Vancouver
Zheng J, Zhong J, Chen M, He K. A reinforced hybrid genetic algorithm for the traveling salesman problem. Computers & Operations Research. 2023;157:106249. doi:10.1016/j.cor.2023.106249
BibTeX
@article{Zheng2023,
author = {Zheng, Jiongzhi and Zhong, Jialun and Chen, Menglei and He, Kun},
title = {A reinforced hybrid genetic algorithm for the traveling salesman problem},
journal = {Computers & Operations Research},
year = {2023},
volume = {157},
pages = {106249},
doi = {10.1016/j.cor.2023.106249}
}
EUVIMED