| Cooperation: | Deutsche Bahn AG |
| Support: | Federal Ministry of Education and Research (BMBF), Grant 03MS640D, Projektträger BEO, Forschungszentrum Jülich |
| Duration: | 1.7.2010 - 30.6.2013 |
| Description: | Given a routing and stopping time windows for passenger and freight trains within the German railway network, the task is to find a feasible operational plan for all trains that observes station capacities and headway time restrictions. The previous project concentrated on possibilities to find such plans for long term simulations. The time frame for medium term planning requires faster methods and this needs new mathematical ideas. We will explore possibilities offered by dynamic discretization approaches and parallel methods for weakly coupled systems that can be decomposed by Lagrangian relaxation. This is embedded into the joint project KOSMOS of TU Braunschweig, TU Chemnitz, TU Dortmund, Univ. Erlangen-Nürnberg, and ZIB (Konrad-Zuse-Zentrum Berlin). |
| Cooperation: | Nokia Siemens Networks GmbH & Co. KG |
| Support: | Federal Ministry of Education and Research (BMBF), Grant 03MS616D, Projektträger BEO, Forschungszentrum Jülich |
| Duration: | 1.7.2010 - 30.6.2013 |
| Description: | How much capacity should be installed on the links in a backbone network of an internet provider so that all arising internet traffic can be routed through it with high probability? This is one of the central robust network design problems attacked within the joint effort ROBUKOM (robust communication networks) of TU Aachen, TU Berlin, TU Chemnitz, and ZIB (Konrad-Zuse-Zentrum Berlin). In this particular project we will explore different possibilities offered by convex techniques for handling chance constraints for finding good integer capacity levels. |
| Cooperation: | eniPROD, TU Chemnitz Cluster of Excellence |
| Support: | State Ministry of Science and Arts (SMWK), based on EFRE funds of the European Union |
| Duration: | 1.4.2009 - 31.3.2012 |
| Description: | Under the leadership of the department of mechanical engineering, TU Chemnitz launched a common research effort directed at studying and improving energy efficiency in production. The focus of our work within this project are optimization models and methods in the sections Process Chains and Logistics and Factory Planning. |
| Cooperation: | Deutsche Bahn AG |
| Support: | Federal Ministry of Education and Research (BMBF), Grant 03HEPAG4, Projektträger BEO, Forschungszentrum Jülich |
| Duration: | 1.7.2007 - 30.6.2010 |
| Description: | For purposes of long term simulation the goal is to generate automatically, from given train data, a time table over a time slice of six hours for the entire German railway network, so that the resulting train schedule is conflict free. The main objectives are to manage the extreme size of the entire network and to develop approaches for increasing robustness of the operation plans with respect to delays or failures. |
| Cooperation: | Fiege eCom Gmbh & Co KG, Herlitz PBS AG |
| Support: | Federal Ministry of Education and Research (BMBF), Grant 03-HEM2B4, Projektträger BEO, Forschungszentrum Jülich |
| Duration: | 1.4.2001 - 31.03.2004 |
| Description: | Our industrial partner operates several warehouses within
the same city. Some of these warehouses are too small to
hold sufficient stock of each product for the day; therefore,
goods are constantly transferred between warehouses by
a shuttle service consisting of several trucks. Part of
the demand is known in advance, part is stochastic and has
to be estimated from available statistical data. The task is to find a schedule that distributes the goods between the warehouses by means of the trucks so that demand can be satisfied on time with high probability. |
| Cooperation: | Herlitz PBS AG |
| Duration: | 1997 - 2000 |
| Description: | For printing machines setup times account for a significant portion of the overall production time. They
depend heavily on the sequence of jobs. Based on a detailed model of the setup process a code has been developed that solves the following
scheduling problem: Given several non identical machines and a set of jobs, find an optimal
assignment of the jobs to the machines and a sequence on each machine so that the last job is
completed as early as possible. The code is based on a polyhedral approach for solving an m-Cost ATSP. Current work concentrates on extending the code to further applications. |