Optimisation multi-objectif par colonies de fourmis : cas des problèmes de sac à dos

Abstract : In this thesis, we investigate the capabilities of Ant Colony Optimization (ACO) metaheuristic to solve combinatorial and multi-objective optimization problems. First, we propose a taxonomy of ACO algorithms proposed in the literature to solve multi-objective problems. Then, we studydifferent pheromonal strategies for the case of mono-objective multidimensional knapsackproblem. We propose, finally, a generic ACO algorithm to solve multi-objective problems. Thisalgorithm is parameterised by the number of ant colonies and the number of pheromonestructures. This algorithm allows us to evaluate and compare new and existing approaches in thesame framework. We compare six variants of this generic algorithm on the multi-objectivemultidimensional knapsack problem
Document type :
Theses
domain_other. Université Claude Bernard - Lyon I; Université de La Manouba, 2009. French. <NNT : 2009LYO10060>
Domain :


https://tel.archives-ouvertes.fr/tel-00603780
Contributor : Abes Star <>
Submitted on : Monday, June 27, 2011 - 1:33:13 PM
Last modification on : Wednesday, May 14, 2014 - 10:12:09 AM

File

TH2009_Alaya_-_Ines.pdf
fileSource_public_star

Identifiers

  • HAL Id : tel-00603780, version 1

Collections

Citation

Inès Alaya. Optimisation multi-objectif par colonies de fourmis : cas des problèmes de sac à dos. domain_other. Université Claude Bernard - Lyon I; Université de La Manouba, 2009. French. <NNT : 2009LYO10060>. <tel-00603780>

Export

Share

Metrics

Consultation de
la notice

824

Téléchargement du document

843