Dynamic Seed Genetic Algorithm to Solve Job Shop Scheduling Problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Dynamic Seed Genetic Algorithm to Solve Job Shop Scheduling Problems

Pedro Schimit
  • Fonction : Auteur
  • PersonId : 1020795
Fabio Henrique Pereira
  • Fonction : Auteur
  • PersonId : 1020796

Résumé

This paper proposes a simple implementation of genetic algorithm with dynamic seed to solve deterministic job shop scheduling problems. The proposed methodology relies on a simple indirect binary representation of the chromosome and simple genetic operators (one-point crossover and bit-flip mutation), and it works by changing a seed that generates a solution from time to time, initially defined by the original sequencing of the problem addressed, and then adopting the best individual from the past runs of the GA as the seed for the next runs. The methodology was compared to three different approaches found in recent researches, and its results demonstrate that despite not finding the best results, the methodology, while being easy to be implemented, has its value and can be a starting point to more researches, combining it with other heuristics methods that rely in GA and other evolutionary algorithms as well.
Fichier principal
Vignette du fichier
434863_1_En_21_Chapter.pdf (302.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01615722 , version 1 (12-10-2017)

Licence

Paternité

Identifiants

Citer

Flávio Grassi, Pedro Schimit, Fabio Henrique Pereira. Dynamic Seed Genetic Algorithm to Solve Job Shop Scheduling Problems. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2016, Iguassu Falls, Brazil. pp.170-177, ⟨10.1007/978-3-319-51133-7_21⟩. ⟨hal-01615722⟩
77 Consultations
105 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More