Optimization of the time-dependent traveling salesman problem with Monte Carlo methods

DOI zum Zitieren dieses Dokuments:: 10.5283/epub.16272

Bentner, Johannes ; Bauer, Günter ; Obermair, Gustav M. ; Morgenstern, Ingo ; Schneider, Johannes

PDF
(214kB) - Nur für Mitarbeiter des Archivs

Veröffentlichungsdatum dieses Volltextes: 23 Aug 2010 12:04

Alternative Links zum Volltext:DOI

Details

Bibliographische Daten exportieren

Zusammenfassung

A problem often considered in operations research and computational physics is the traveling salesman problem, in which a traveling salesperson has to find the shortest closed tour between a certain set of cities. This problem has been extended to more realistic scenarios, e.g., the “real” traveling salesperson has to take rush hours into consideration. We will show how this extended problem is ...