We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...
Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...
Programmable self-assembly of modular robots offers promising means for structure formation at different scales. Rule-based approaches have been previously employed for distributed control of stochastic self-assembly processes. The assembly rate in the pro ...
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually,
passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view
in case of lar ...
This paper presents an integrated approach for short-term supply chain management (SCM) at a fast moving consumer goods production plant. The problem is to determine the production quantities, to provide a detailed production schedule, to trigger the relev ...
