#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1996

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Krzysztof Socha, Joshua D. Knowles, Michael Sampels
- Ant Algorithms
- 2002

We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of soft constraints. A MAX -MIN Ant System, which makes use of a separate local search routine, is proposed for tackling this problem. We devise an appropriate construction graph and pheromone matrix representation after considering… (More)

- Olivia Rossi-Doria, Michael Sampels, +9 authors Thomas Stützle
- PATAT
- 2002

The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration are Evolutionary Algorithms, Ant Colony Optimization, Iterated Local Search, Simulated Annealing, and Tabu… (More)

- Krzysztof Socha, Michael Sampels, Max Manfrin
- EvoWorkshops
- 2003

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine… (More)

- Christian Blum, Michael Sampels
- J. Math. Model. Algorithms
- 2004

We deal with the application of ant colony optimization to group shop scheduling, which is a general shop scheduling problem that includes, among others, the open shop scheduling problem and the job shop scheduling problem as special cases. The contributions of this paper are twofold. First, we propose a neighborhood structure for this problem by extending… (More)

- Christian Blum, Michael Sampels
- PPSN
- 2002

The Group Shop Scheduling Problem (GSP) is a generalization of the classical Job Shop and Open Shop Scheduling Problems. In the GSP there are m machines and n jobs. Each job consists of a set of operations, which must be processed on specified machines without preemption. The operations of each job are partitioned into groups on which a total precedence… (More)

- Michael Sampels
- Discrete Applied Mathematics
- 2004

- Michael Sampels
- Parcella
- 1996

- Michael Sampels
- WG
- 1997

- Christian Blum, Michael Sampels, Mark Zlochin
- GECCO
- 2002

Giving positive feedback to good solutions is a common base technique in model-based search algorithms, such as Ant Colony Optimization, Estimation of Distribution Algorithms, or Neural Networks. In particular, the reinforcement of components of good solutions by positive feedback is known as a successful technique in tackling hard combinatorial… (More)