$$\newcommand{\bra}[1]{\left<#1\right|}\newcommand{\ket}[1]{\left|#1\right>}\newcommand{\bk}[2]{\left<#1\middle|#2\right>}\newcommand{\bke}[3]{\left<#1\middle|#2\middle|#3\right>}$$
INFORMAÇÕES SOBRE DIREITOS AUTORAIS


As obras disponibilizadas nesta Biblioteca Digital foram publicadas sob expressa autorização dos respectivos autores, em conformidade com a Lei 9610/98.

A consulta aos textos, permitida por seus respectivos autores, é livre, bem como a impressão de trechos ou de um exemplar completo exclusivamente para uso próprio. Não são permitidas a impressão e a reprodução de obras completas com qualquer outra finalidade que não o uso próprio de quem imprime.

A reprodução de pequenos trechos, na forma de citações em trabalhos de terceiros que não o próprio autor do texto consultado,é permitida, na medida justificada para a compreeensão da citação e mediante a informação, junto à citação, do nome do autor do texto original, bem como da fonte da pesquisa.

A violação de direitos autorais é passível de sanções civis e penais.
Coleção Digital

Avançada


Estatísticas | Formato DC|



Título: SCHEDULE OPTIMIZATION WITH PRECEDENCE CONSTRAINTS USING GENETIC ALGORITHMS AND COOPERATIVE CO-EVOLUTION
Instituição: PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO - PUC-RIO
Autor(es): ANDRE VARGAS ABS DA CRUZ

Colaborador(es):  MARLEY MARIA BERNARDES REBUZZI VELLASCO - Orientador
MARCO AURELIO CAVALCANTI PACHECO - Orientador
Número do Conteúdo: 3725
Catalogação:  17/07/2003 Idioma(s):  PORTUGUESE - BRAZIL

Tipo:  TEXT Subtipo:  THESIS
Natureza:  SCHOLARLY PUBLICATION
Nota:  Todos os dados constantes dos documentos são de inteira responsabilidade de seus autores. Os dados utilizados nas descrições dos documentos estão em conformidade com os sistemas da administração da PUC-Rio.
Referência [pt]:  https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=3725@1
Referência [en]:  https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=3725@2
Referência DOI:  https://doi.org/10.17771/PUCRio.acad.3725

Resumo:
This work investigates the use of Genetic Algorithms and Cooperative Co-Evolution in optimization of scheduling problems with precedence constraints. In this kind of problem some or all tasks have constraints that imply planning or executing them before or after others. For this reason, the use of order-based conventional evolutionary models may generate invalid solutions, which cannot be penalized, needing to be discarded and therefore compromising the algorithm performance. The main goal was therefore to study models for this kind of problem that are capable of generating only valid solutions. The work was divided in 3 main steps: a survey on scheduling optimization problems using genetic algorithms; definition of two models based on genetic algorithms and cooperative co-evolution for optimizing scheduling problems with precedence constraints; and the implementation of a tool for a case study. The study on scheduling optimization problems with genetic algorithms consisted in gathering information about representations and characteristics of this kind of problem and, more specifically, about order-based representations. The genetic algorithm modeling consisted basically in defining a chromosome representation and an evaluation function that took into account the existence of precedence constraints (tasks that must be scheduled or executed before others). The co-evolutionary model consisted in defining a new population, with another representation scheme, which was responsible for distributing resources for tasks execution. On the conventional genetic algorithm model, this role was played by a simple set of heuristics. Finally, a tool was developed for implementing those models and treating a complex case study which offered the needed characteristics for testing representation performance and evaluating results. The chosen case study was the optimization of iron ore dumping, stocking and ship loading on a fictitious harbor, targeting minimization of ships waiting time. Tests were done in order to demonstrate the ability of the developed models in generating viable solutions without the need of corrective heuristics and the results were compared to the results obtained through exhaustive search. In all cases, the models` results were better than the exhaustive search ones. In the case where the representation used a single population the results obtained were up to 41% better than the ones with the exhaustive search. The co- evolutionary results outperformed the co-evolutionary search with the same solution representation by 33%. Compared to the single specie genetic algorithm, the co- evolutionary model outperformed it by 29%.

Descrição Arquivo
COVER, ACKNOWLEDGEMENTS, RESUMO, ABSTRACT, SUMMARY AND LISTS  PDF
CHAPTER 1  PDF
CHAPTER 2  PDF
CHAPTER 3  PDF
CHAPTER 4  PDF
CHAPTER 5  PDF
CHAPTER 6  PDF
REFERENCES  PDF
Agora você pode usar seu login do SAU no Maxwell!!
Fechar Janela



* Esqueceu a senha:
Senha SAU, clique aqui
Senha Maxwell, clique aqui