An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem

Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural evolution, they work on populations of individuals instead of on single solutions. In this way, the search is performed in a parallel manner. During the last decades, there has been an increasing inte...

Descripción completa

Detalles Bibliográficos
Autores principales: Stark, Natalia, Salto, Carolina, Alfonso, Hugo, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2002
Materias:
Ciencias Informáticas
evolutionary algorithms
representation
selection
crossover operator
multiplicity features
ARTIFICIAL INTELLIGENCE
Scheduling
Algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23008
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23008
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
evolutionary algorithms
representation
selection
crossover operator
multiplicity features
ARTIFICIAL INTELLIGENCE
Scheduling
Algorithms
spellingShingle Ciencias Informáticas
evolutionary algorithms
representation
selection
crossover operator
multiplicity features
ARTIFICIAL INTELLIGENCE
Scheduling
Algorithms
Stark, Natalia
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
topic_facet Ciencias Informáticas
evolutionary algorithms
representation
selection
crossover operator
multiplicity features
ARTIFICIAL INTELLIGENCE
Scheduling
Algorithms
description Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural evolution, they work on populations of individuals instead of on single solutions. In this way, the search is performed in a parallel manner. During the last decades, there has been an increasing interest in evolutionary algorithms to solve scheduling problems. One important feature in these algorithms is the selection of individuals. Selection is the operation by which individuals (i.e. their chromosomes) are selected for mating. To emulate natural selection, individuals with higher fitness should be selected with higher probability, and thus it is one of the operators where the fitness plays an important role. There are many different models of selection (some are not biologically plausible). Commonly, proportional, ranking, tournament selection and stochastic universal sampling are used. EAs considered in this work are improved with a multiplicity feature to solve the job shop scheduling problems (JSSP). The algorithm applied here, multiple crossovers on multiple parents (MCMP), considers more than two parents for reproduction with the possibility to generate multiple children. This approach uses a permutation representation for the chromosome. The objective of this work is to compare the algorithms performance using different selection mechanisms and to analyse the different crossover methods developed to apply MCMP with a permutation representation.
format Objeto de conferencia
Objeto de conferencia
author Stark, Natalia
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author_facet Stark, Natalia
Salto, Carolina
Alfonso, Hugo
Gallard, Raúl Hector
author_sort Stark, Natalia
title An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
title_short An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
title_full An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
title_fullStr An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
title_full_unstemmed An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
title_sort analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
publishDate 2002
url http://sedici.unlp.edu.ar/handle/10915/23008
work_keys_str_mv AT starknatalia ananalysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT saltocarolina ananalysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT alfonsohugo ananalysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT gallardraulhector ananalysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT starknatalia analysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT saltocarolina analysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT alfonsohugo analysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
AT gallardraulhector analysisonselectionmethodsandmultirecombinationinevolutionarysearchwhensolvingthejobshopschedulingproblem
bdutipo_str Repositorios
_version_ 1764820467982532612

Ejemplares similares