An ant colony system solving the travelling salesman region problem

A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.