 |
|
Theses
Variantes d'algorithmes génétiques appliquéees aux problèmes d'ordonnancement
Variantes d'algorithmes génétiques appliquéees aux problèmes d'ordonnancement
Abstract : The genetic algorithm (GA), is based on the mechanisms of coding, selection, crossover, mutation and insertion. Each mechanism presents several choices to giving result to several GA's variants.
We obtained a better variant of genetic algorithm for resolving
Travelling Salesman Problem. In this GA's variant, we introduced
our new crossover operator Cedrx which when coupled with crossover operator edrx gave good results.
This led to the creation of effective variants of genetic algorithm for resolving the following problems:
+ Job Shop Scheduling Problem (JSSP);
+ Aircraft Landing Problem (ALP);
+ Scheduling Problem of Vehicles on a production line in a factory
(SPV).
We obtained a better variant of genetic algorithm for resolving
Travelling Salesman Problem. In this GA's variant, we introduced
our new crossover operator Cedrx which when coupled with crossover operator edrx gave good results.
This led to the creation of effective variants of genetic algorithm for resolving the following problems:
+ Job Shop Scheduling Problem (JSSP);
+ Aircraft Landing Problem (ALP);
+ Scheduling Problem of Vehicles on a production line in a factory
(SPV).
https://tel.archives-ouvertes.fr/tel-00126292
Contributor : Said Bourazza <>
Submitted on : Thursday, March 8, 2007 - 2:14:21 PM
Last modification on : Tuesday, February 5, 2019 - 11:41:16 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 12:06:21 PM
Contributor : Said Bourazza <>
Submitted on : Thursday, March 8, 2007 - 2:14:21 PM
Last modification on : Tuesday, February 5, 2019 - 11:41:16 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 12:06:21 PM