Alternative representations and multirecombined approaches for solving the single-machine common due date problem

Balance between exploitation and exploration is a main factor influencing convergence in an evolutionary algorithm. In order to improve this balance new trends in evolutionary algorithms make use of multi-recombinative approaches, known as multiple-crossovers-on-multiple-parents (MCMP). The use of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Villagra, Andrea, Pandolfi, Daniel, San Pedro, María Eugenia de, Vilanova, Gabriela, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2001
Materias:
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
date problem
multirecombined approaches
Alternative representations
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23415
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23415
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
date problem
multirecombined approaches
Alternative representations
spellingShingle Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
date problem
multirecombined approaches
Alternative representations
Villagra, Andrea
Pandolfi, Daniel
San Pedro, María Eugenia de
Vilanova, Gabriela
Gallard, Raúl Hector
Alternative representations and multirecombined approaches for solving the single-machine common due date problem
topic_facet Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
date problem
multirecombined approaches
Alternative representations
description Balance between exploitation and exploration is a main factor influencing convergence in an evolutionary algorithm. In order to improve this balance new trends in evolutionary algorithms make use of multi-recombinative approaches, known as multiple-crossovers-on-multiple-parents (MCMP). The use of a breeding individual (stud) which repeatedly mates individuals that randomly immigrates to a mating pool can further help the balance between exploration and exploitation. For the single-machine common due date problem an optimal schedule is V-shaped around the due date. To produce V-shaped schedules an appropriate binary representation, associated with a schedule builder, can be used. In this representation each bit indicates if a corresponding job belongs either to the tardy or the non-tardy set. When contrasted with commonly used permutation representations this approach reduces the searching space from n! to 2n. This paper compares three different implementations and shows their performance on a set of instances for the single machine scheduling problem with a common due date. Two of these approaches are based on a binary representation to form V-shaped schedules while the other is based on permutations. All these approaches apply different multirecombined methods. Details on implementation and results are discussed.
format Objeto de conferencia
Objeto de conferencia
author Villagra, Andrea
Pandolfi, Daniel
San Pedro, María Eugenia de
Vilanova, Gabriela
Gallard, Raúl Hector
author_facet Villagra, Andrea
Pandolfi, Daniel
San Pedro, María Eugenia de
Vilanova, Gabriela
Gallard, Raúl Hector
author_sort Villagra, Andrea
title Alternative representations and multirecombined approaches for solving the single-machine common due date problem
title_short Alternative representations and multirecombined approaches for solving the single-machine common due date problem
title_full Alternative representations and multirecombined approaches for solving the single-machine common due date problem
title_fullStr Alternative representations and multirecombined approaches for solving the single-machine common due date problem
title_full_unstemmed Alternative representations and multirecombined approaches for solving the single-machine common due date problem
title_sort alternative representations and multirecombined approaches for solving the single-machine common due date problem
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/23415
work_keys_str_mv AT villagraandrea alternativerepresentationsandmultirecombinedapproachesforsolvingthesinglemachinecommonduedateproblem
AT pandolfidaniel alternativerepresentationsandmultirecombinedapproachesforsolvingthesinglemachinecommonduedateproblem
AT sanpedromariaeugeniade alternativerepresentationsandmultirecombinedapproachesforsolvingthesinglemachinecommonduedateproblem
AT vilanovagabriela alternativerepresentationsandmultirecombinedapproachesforsolvingthesinglemachinecommonduedateproblem
AT gallardraulhector alternativerepresentationsandmultirecombinedapproachesforsolvingthesinglemachinecommonduedateproblem
bdutipo_str Repositorios
_version_ 1764820465896914945

Ejemplares similares