Listen
20 Ergebnisse
Bereich: Suchergebnisse
Publikation Attraction and diffusion in nature-inspired optimization algorithms(Springer, 15.05.2015) Yang, Xin-She; Deb, Suash; Hanne, Thomas; He, Xingshi01A - Beitrag in wissenschaftlicher ZeitschriftPublikation Genetic algorithm with embedded Ikeda map applied on an order picking problem in a multi-aisle warehouse(09.12.2014) Stauffer, Michael; Ryter, Remo; Davendra, Donald; Dornberger, Rolf; Hanne, Thomas04B - Beitrag KonferenzschriftPublikation Single and Multiobjective Optimization of the Train Staff Planning Problem Using Genetic Algorithms(01.06.2008) Dornberger, Rolf; Hanne, Thomas; Frey, Lukas04B - Beitrag KonferenzschriftPublikation Optimizing staff rosters for emergency shifts for doctors(IEEE, 28.06.2009) Frey, Lukas; Hanne, Thomas; Dornberger, RolfThe creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (e.g. holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem afterwards with a straightforward genetic algorithm. Thereby the main focus lays on two different mutation methods and the combination of them. The results of this procedure will be discussed in this work.04B - Beitrag KonferenzschriftPublikation Solving Optimization Problems by Metaheuristics Using the OpenOpal-Framework - Integration of Travelling Salesman Problem and Selected Solvers. Arbeitsberichte der Hochschule für Wirtschaft FHNW(01.02.2012) Dornberger, Rolf; Ernst, Ramona; Frey, Lukas; Hanne, Thomas05 - Forschungs- oder ArbeitsberichtPublikation Fallstudie Swiss Post Solutions / cablecom: Archive as a Service(Hanser, 2008) Hanne, Thomas; Wölfle, Ralf; Schubert, PetraDiese Fallstudie beschreibt eine elektronische Archivierungslösung für Rechnungen. Der Schweizer Kabelnetzbetreiber cablecom GmbH nutzt hierzu die Dienste des Business Process Outsourcing-Dienstleisters Swiss Post Solutions AG. Besonderheiten der Archivierungslösung sind der Archivzugriff durch cablecom-Kunden und -Mitarbeiter über eine Weblösung sowie die rechtskonforme Archivierung mittels elektronischer Signatur. Vorteile für cablecom lagen in der schnellen und kostengünstigen Realisierbarkeit der Archivierungslösung bei gleichzeitig hohem Qualitätsniveau, etwa in Bezug auf Sicherheit und Verfügbarkeit.04A - Beitrag SammelbandPublikation Optimization of the Picking Sequence of an Automated Storage and Retrieval System (AS/RS)(11.07.2014) Dornberger, Rolf; Hanne, Thomas; Ryter, Remo; Stauffer, Michael06 - PräsentationPublikation Index Tracking with Invasive Weed Optimization(27.09.2014) Affolter, Konstantin; Dornberger, Rolf; Hanne, Thomas; Schweizer, Daniel06 - PräsentationPublikation On utilizing infeasibility in multiobjective evolutionary algorithms(Springer, 2009) Hanne, Thomas; Barichard, Vincent; Ehrgott, Matthias; Gandibleux, Xavier; T'Kindt, VincentIn this article, we consider the problem of infeasible solutions (i.e. solutions which violate one or several restrictions of an optimization problem) which can hardly be avoided when new solutions are generated by stochastic and other means during the run of an optimization algorithm. Since typical approaches for dealing with infeasibility such as using a repair mechanism, a punishment approach, or a simple recalculation of solutions are not fully satisfying in many problems, we suggest a new approach of tolerating and actively using infeasible solutions within the framework of multiobjective evolutionary algorithms. The novel evolutionary algorithm allows solving a multiobjective optimization problem (MOP) with continuous variables by approximating the efficient set. The algorithm uses populations of variable size and new rules for selecting solutions for the subsequent generations. In particular, some of the selected solutions may be infeasible such that the Pareto front is approached at the same time from two sides, the feasible set and a subset of the infeasible set. Since the considered in feasible solutions correspond to a dual optimization problem, we call the new algorithm primaldual multiobjective optimization algorithm, or PDMOEA. The algorithm is demonstrated by considering a numerical test problem and is compared with two other approaches for dealing with infeasibility. The example shows a specific strength of the new approach: By tunneling through infeasible regions, the population may more easily extent to new separated parts of the Pareto set.04B - Beitrag Konferenzschrift
