Finitely dominated chain complexes over a Laurent polynomial ring in one
indeterminate are characterised by vanishing of their Novikov homology. We
present an algebro-geometric approach to this result, based on extension of
chain complexes to sheaves on the projective line. We also discuss the
K-theoretical obstruction to extension.Comment: v1: 11 page

A. Schaerf

B. Paechter

D.S. Johnson

E. Bonabeau

F. Glover

H.R. Lourenço

L. Paquete

M. Dorigo

M.W. Carter

O. Martin

O. Rossi-Doria

P. Ross

S. Kirkpatrick

T. Baeck

V. Cerný

English

arXiv

The main goal of this paper is to attempt an unbiased comparison of the peformance 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 Search. To attempt fairness the implementations of all the algorithms use a common solution representation, and a common neighbourhood structure or local search. The results show that no metaheuristic is best on all the timetabling instances considered. Moreover, even when instances are very similar, from the point of view of the instance generator, it is not possible to predict the best metaheuristic, even if some trends appear when focusing on particular instance classes. These results underline..

Olivia Rossi-Doria

Michael Sampels

Mauro Birattari

Marco Chiarandini

Marco Dorigo

Luca M. Gambardella

Joshua Knowles

Max Manfrin

Monaldo Mastrolilli

Ben Paechter

Luis Paquete

Thomas Stützle

CiteSeerX

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem

Rossi-Doria, Olivia

Samples, Michael

Birattari, Mauro

Chiarandini, Marco

Dorigo, Marco

Gambardella, Luca

Knowles, Joshua

Manfrin, Max

Mastrolilli, Monaldo

Paechter, Ben

Paquete, Luis

Stützle, Thomas

TUbiblio

A comparison of the performance of different metaheuristics on the timetabling problem

Lugano, SwitzerlandIDSIA-18-02info:eu-repo/semantics/publishe

Rossi-Doria, Olivia O.

Sampels, Michaël

Mastrolilli, Monaldo M.

Gambardella, Luca Maria

DI-fusion

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 Search. To attempt fairness, the implementations of all the algorithms use a common solution representation, and a common neighbourhood structure or local search. The results show that no metaheuristic is best on all the timetabling instances considered. Moreover, even when instances are very similar, from the point of view of the instance generator, it is not possible to predict the best metaheuristic, even if some trends appear when focusing on particular instance classes. These results underline the difficulty of finding the best metaheuristics even for very restricted classes of timetabling problem. © Springer-Verlag Berlin Heidelberg 2003

Sampels, Michael

Gambardella, Luca M.

The University of Manchester - Institutional Repository

null Thomas Hüttemann

Crossref

Mathematical Proceedings of the Royal Irish Academy