EUVIMEDEUVIMED entdecken
Crossref

A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem

Sasan Mahmoudinazlou, Changhyun Kwon

Computers & Operations Research · 2024-02 · 162 · 106455

DOI: 10.1016/j.cor.2023.106455 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2024-02. Verfasst von Sasan Mahmoudinazlou und 1 weiteren Autor:innen. Die Arbeit wurde bisher 74-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: National Research Foundation of Korea, National Science Foundation, NSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Research Foundation of Korea
  • National Science Foundation
  • NSF
  • Ministry of Science, ICT and Future Planning

Zitieren

APA

Mahmoudinazlou, S., & Kwon, C. (2024). A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem. Computers & Operations Research, 162, 106455. https://doi.org/10.1016/j.cor.2023.106455

Vancouver

Mahmoudinazlou S, Kwon C. A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem. Computers & Operations Research. 2024;162:106455. doi:10.1016/j.cor.2023.106455

BibTeX
@article{Mahmoudinazlou2024,
  author = {Mahmoudinazlou, Sasan and Kwon, Changhyun},
  title = {A hybrid genetic algorithm for the min–max Multiple Traveling Salesman Problem},
  journal = {Computers & Operations Research},
  year = {2024},
  volume = {162},
  pages = {106455},
  doi = {10.1016/j.cor.2023.106455}
}
Kostenlos starten →