Go to content
UR Home

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

DOI to cite this document:
Bentner, Johannes ; Bauer, Günter ; Obermair, Gustav M. ; Morgenstern, Ingo ; Schneider, Johannes
(214kB) - Repository staff only
Date of publication of this fulltext: 23 Aug 2010 12:04


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 ...


Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons