It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...

We introduce a general quantifiable framework to study the location decisions of multinational firms. In the model, firms choose in which locations to pay the fixed costs of setting up production, taking into account potential complementarities among production locations. The firm's location...

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the...

Sebastian Meiswinkel studies optimization problems that arise at container ports from a classic optimization as well as from a mechanism design point of view. The first part of this dissertation is focused on scheduling problems with selfish job owners that have private information about their...

An information-theoretic thought experiment is developed to clarify why the maximum entropy methodology is appropriate for predicting the equilibrium state of economic systems. As a first step, object allocation problems, modeled as knapsack problems, are shown to be equivalent to congestion...

Planungsprobleme am Containerterminal -- Das RMG-System als potentieller Engpass -- RMG-Optimierung eines Lagerblockes -- Verfahren zur integrierten Transportoptimierung -- Vergleich der Optimierungsansätze.

This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in...

In der Arbeit wird ein Permutation Flow Shop Problem mit mehrfacher Zielsetzung betrachtet. Das Problem der Reihenfolgeplanung von Auftr?gen in einem Produktionssystem hat seit der Ver?ffentlichung des Johnson Algorithmus 1954 wesentliche Aufmerksamkeit erlangt. Dabei wurden haupts?chlich...

In this paper we present and analyze the application of an Ant System to the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). At the core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the...

Vorliegendes Arbeitspapier beschreibt den entsprechenden Einsatz künstlicher Ameisen und diskutiert erste numerische Ergebnisse.

Steuerung von Werkstattfertigungssystemen -- Modelle und Lösungsansätze zur Steuerung -- Neues Modell zur adaptiven Steuerung -- Konzept zur Steuerung -- Sequentielle und parallele Algorithmen für das neue Modell -- Analyse und exemplarische Validierung der neuen Algorithmen --...

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem.(...)

Particle Swarm Optimization (PSO) has proven to be a good metaheuristic for continuous optimizationproblems. In this paper we present a solution for applying the PSO to a combinatorial optimizationproblem of a real data university course timetabling problem. We first describe the...

The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also...

The Ant System is a new meta-heuristic method particularly appropriate to solve hard combinatorial optimization problems. It is a population-based, nature-inspired approach exploiting positive feedback as well as local information and has been applied successfully to a variety of combinatorial...