Related Experiment Video
Updated: Aug 18, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Optimization of the time-dependent traveling salesman problem with Monte Carlo methods
J Bentner1, G Bauer, G M Obermair
1Fakultät Physik, Universität Regensburg, D-93040 Regensburg, Germany. johannes.bentner@physik.uni-regensburg.de
Abstract:
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 treated with physical optimization algorithms. We will present results for a specific instance of Reinelt's library TSPLIB95, in which we define a zone with traffic jams in the afternoon.
Related Concept Videos
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Optimization Problems
Lagrange Multipliers: Two Constraints
Lagrange Multipliers: Problem Solving

