EUVIMEDEUVIMED entdecken
Crossref

Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version

Cédric Pralet

Computers & Operations Research · 2023-02 · 150 · 106078

DOI: 10.1016/j.cor.2022.106078 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2023-02. Verfasst von Cédric Pralet. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 43 Literaturangaben. Gefördert von: Bpifrance.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Bpifrance

Zitieren

APA

Pralet, C. (2023). Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version. Computers & Operations Research, 150, 106078. https://doi.org/10.1016/j.cor.2022.106078

Vancouver

Pralet C. Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version. Computers & Operations Research. 2023;150:106078. doi:10.1016/j.cor.2022.106078

BibTeX
@article{Pralet2023,
  author = {Pralet, Cédric},
  title = {Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version},
  journal = {Computers & Operations Research},
  year = {2023},
  volume = {150},
  pages = {106078},
  doi = {10.1016/j.cor.2022.106078}
}
Kostenlos starten →