Of matrices and ants

Matrices are used in many areas of application to clearly visualize complicated relationships. In the stochastic variant, they are used to describe random movements ("wrong turns") on a grid; matrix products allow the long-term behavior of such a wrong turn to be predicted. Conversely, aberrations can also be simulated on the computer, and estimates for the matrix products can be obtained from their observation.

In optimization, matrices are used to describe and solve linear optimization problems, which occur in many planning and control problems. Other optimization problems, for example in location or route planning, prove to be very complex and can often only be solved approximately using so-called heuristics. A special heuristic that can be applied to many problems imitates the behavior of ants. Ants find the shortest route between their burrow and a food source ("ant trails") after a few "odysseys". These odysseys can be simulated on the computer (using matrices) and are used, for example, to find the (approximate) shortest route for garbage collection.

In the course of the training, some mathematical principles and approaches for implementation on the computer are presented from this problem area.

Program

09.30 - 09.35Welcome
09.35 - 10.45Matrices and wandering (Prof. Dr. M. Kolonko)
10.45 - 11.15Coffee break
11.15 - 12.00Matrices in optimization (JProf. Dr. J. Kalcsics)
12.00 - 13.30Lunch break
13.30 - 14.15When the ice melts . . In search of the optimal location (JProf. Dr. J. Kalcsics)
14.15 - 14.45Coffee break
14.45 - 16.00Ant algorithms: crawling to success (Prof. Dr. M. Kolonko)
16.00 - 16.30Discussion and closing remarks