En-tête de navigationNavigation principaleSuiviFiche


Unité de recherche
PCRD EU
Numéro de projet
99.0182
Titre du projet
Metaheuristics and local search network
Titre du projet anglais
Metaheuristics and local search network

Textes relatifs à ce projet

 AllemandFrançaisItalienAnglais
Mots-clé
-
-
-
Anzeigen
Autre Numéro de projet
-
-
-
Anzeigen
Programme de recherche
-
-
-
Anzeigen
Description succincte
-
-
-
Anzeigen
Autres indications
-
-
-
Anzeigen
Partenaires et organisations internationales
-
-
-
Anzeigen
Résumé des résultats (Abstract)
-
-
-
Anzeigen
Références bases de données
-
-
-
Anzeigen

Textes saisis


CatégorieTexte
Mots-clé
(Anglais)
Metaheuristics; local search; antcolony optimization
Autre Numéro de projet
(Anglais)
EU project number: HPRN-1999-00106
Programme de recherche
(Anglais)
EU-programme: 5. Frame Research Programme - 4.1.1 Research training networks
Description succincte
(Anglais)
See abstract
Autres indications
(Anglais)
Full name of research-institution/enterprise:
Istituto dalle Molle di Studi sull'Intelligenza Artificiale IDSIA

Partenaires et organisations internationales
(Anglais)
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)
Résumé des résultats (Abstract)
(Anglais)
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.
Références bases de données
(Anglais)
Swiss Database: Euro-DB of the
State Secretariat for Education and Research
Hallwylstrasse 4
CH-3003 Berne, Switzerland
Tel. +41 31 322 74 82
Swiss Project-Number: 99.0182