In this research we consider the problemof scheduling rounds of a non-professional table-tennisleague. We formalize the problem in terms of atimetabling optimization problem. Then we solve thishighly constrained problem with a permutation based GeneticAlgorithm for which feasibility preserving...

(...) Das Traveling-Salesman-Problem (TSP; synonym Handlungsreisenden- oder Rundreiseproblem) ist eine der populärsten kombinatorischen Problemstellungen der letzten vier Jahrzehnte. In seiner illustrativsten Formulierung unterstellt es einen Handlungsreisenden, welcher durch eine geeignete...

In many practical cases one has to choose an arrangement of different objects so that they are compatible. Whenever the compatibility of the objects can be checked by a pair-wise comparison the problem can be moddeled using the graph-theoretic notion of cliques.

This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19,31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In...

In this paper we propose an ACO approach, where two colonies of ants aim to optimize total costs in a transportation network. This main objective consists of two sub goals, namely fleet size minimization and minimization of the vehicle movement costs, which are conflicting for some regions of...