Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem

Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity, different techniques to solve the Flow Shop Sche...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Villagra, Andrea, Vilanova, Gabriela, Pandolfi, Daniel, San Pedro, María Eugenia de, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2002
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23045
Aporte de:
id I19-R120-10915-23045
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
flow shop scheduling
evolutionary computation
Scheduling
Algorithms
Distributed Systems
Parallel
spellingShingle Ciencias Informáticas
flow shop scheduling
evolutionary computation
Scheduling
Algorithms
Distributed Systems
Parallel
Villagra, Andrea
Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Gallard, Raúl Hector
Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
topic_facet Ciencias Informáticas
flow shop scheduling
evolutionary computation
Scheduling
Algorithms
Distributed Systems
Parallel
description Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity, different techniques to solve the Flow Shop Scheduling problem (FSSP) has been developed. Current trends addressed to multire-combination, involve distinct evolutionary computation approaches providing not a single but a set of acceptable alternative solutions, which are created by intensive exploitation of multiple solutions previously found. Evolutionary algorithms perform their search based only in the relative fitness of each potential solution to the problem. On the other hand specialised heuristics are based on some specific features of the problem. This work shows alternative ways to insert knowledge in the search by means of the inherent infor-mation carried by solutions coming from that specialised heuristic or gathered by the evolutionary process itself. The present paper compares the performance of multirecombined evolutionary algo-rithms with and without knowledge insertion and their influence in the crossover rate, the popula-tion size and the quality of results when applied to selected instances of the FSSP.
format Objeto de conferencia
Objeto de conferencia
author Villagra, Andrea
Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Gallard, Raúl Hector
author_facet Villagra, Andrea
Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Gallard, Raúl Hector
author_sort Villagra, Andrea
title Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
title_short Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
title_full Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
title_fullStr Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
title_full_unstemmed Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
title_sort inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
publishDate 2002
url http://sedici.unlp.edu.ar/handle/10915/23045
work_keys_str_mv AT villagraandrea insertingknowledgeinmultirecombinedevolutionaryalgorithmsfortheflowshopschedulingproblem
AT vilanovagabriela insertingknowledgeinmultirecombinedevolutionaryalgorithmsfortheflowshopschedulingproblem
AT pandolfidaniel insertingknowledgeinmultirecombinedevolutionaryalgorithmsfortheflowshopschedulingproblem
AT sanpedromariaeugeniade insertingknowledgeinmultirecombinedevolutionaryalgorithmsfortheflowshopschedulingproblem
AT gallardraulhector insertingknowledgeinmultirecombinedevolutionaryalgorithmsfortheflowshopschedulingproblem
bdutipo_str Repositorios
_version_ 1764820468018184195