Research Repository

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

Salhi, A and Rodríguez, JAV and Zhang, Q (2007) An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Published proceedings: Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference
Subjects: Q Science > QA Mathematics
Q Science > QH Natural history > QH426 Genetics
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 09 Jan 2012 13:57
Last Modified: 14 Oct 2019 18:17
URI: http://repository.essex.ac.uk/id/eprint/1822

Actions (login required)

View Item View Item