An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem

Abdellah Salhi, José Antonio Vázquez Rodríguez, Qingfu Zhang

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

32 Citations (Scopus)

Abstract

An Estimation of Distribution Algorithm (EDA) is proposed toapproach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFS-SDST-UM) problem. The latter motivated by the needs of a real world company. The proposed EDA implements a fairly new mechanism to improve the search of more traditional EDAs. This is the Guided Mutation (GM). EDA-GM generates new solutions by using the information from a probability model, as all EDAs, and the local information from a good known solution. The approach is tested on several instances of HFS-SDST-UM and compared with adaptations of meta-heuristics designed for very similarproblems. Encouraging results are reported. Copyright 2007 ACM.
Original languageEnglish
Title of host publicationProceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
Pages570-576
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007 - London, United Kingdom
Duration: 7 Jul 200711 Jul 2007

Conference

Conference9th Annual Genetic and Evolutionary Computation Conference, GECCO 2007
Country/TerritoryUnited Kingdom
CityLondon
Period7/07/0711/07/07

Research Keywords

  • Combinatorial optimization
  • Metaheuristics
  • Timetabling and scheduling

Fingerprint

Dive into the research topics of 'An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem'. Together they form a unique fingerprint.

Cite this