Metaheuristics and local search network

• Research unit: EU RFP
• Project number: 99.0182

Key words (English)

Metaheuristics; local search; antcolony optimization

Alternative project number (English)

EU project number: HPRN-1999-00106

Research programs (English)

EU-programme: 5. Frame Research Programme - 4.1.1 Research training networks

Short description (English)

See abstract

Further information (English)

Full name of research-institution/enterprise:
Istituto dalle Molle di Studi sull'Intelligenza Artificiale IDSIA

Partners and International Organizations (English)

IRIDIA, Universite Libre de Bruxelles (B), COG, Eindhoven University of Technology (NL), EUROBIOS, Paris (F), IDSIA, Lugano (CH), INTELLEKTIK, Technische Universitat Darmstadt (D), ECRG, Napier University, Edinburgh (UK)

Abstract (English)

The research topic of the Metaheuristics Network is the study of metaheuristics for the solution of difficult combinatorial optimisation problems. The Metaheuristics Network will study metaheuristics from theoretical and experimental points of view with the aim of improving our understanding of how they work, and to make easier their effective application to the solution of important practical problems.
The research activities during this project year concerned investigations on metaheuristics for two optimization problems. The FopShop problem, a special type of a scheduling problem and the school time tabling problem as exemplary NP-hard combinatorial optimization problems. The following metaheuristics were studied: ant colony optimization (ACO), genetic algorithms (GA), iterated local search (ILS), simulated annealing (SA), and tabu search (TS). For each problem new instances of different complexity have been generated and they have been tested on new implementation of the different metaheuristics.

References in databases (English)

Swiss Database: Euro-DB of the
State Secretariat for Education and Research
Hallwylstrasse 4
CH-3003 Berne, Switzerland
Tel. [phone]
Swiss Project-Number: 99.0182