Detalhes bibliográficos
| Resumo: | The Resource Constrained Project Scheduling Problem (RCPSP) is NP-hard thus justifying the use meta-heuristics for its solution. This paper presents an evolutionary algorithm developed for the RCPSP problem. This evolutionary algorithm uses an alphabet based on random keys that makes easier its implementation while solving combinatorial optimization problems. Random keys allow the use of conventional genetic operators, what makes easier the adaptation of the evolutionary algorithm to new problems. To improve the method's performance, this evolutionary algorithm uses an initial population that is generated considering the information available for the instance. This paper studies the impact of using that information in the initial population. The computational experiments presented compare two types of initial population - the conventional one (generated randomly) and this new approach that considers the information of the instance. |
|---|
| Autores principais: | Oliveira, José A. |
|---|
| Outros Autores: | Dias, Luís M. S.; Pereira, Guilherme |
|---|
| Assunto: | Genetic algorithm Metaheuristics Optimization Project management Random keys RCPSP Scheduling |
|---|
| Ano: | 2012 |
|---|
| País: | Portugal |
|---|
| Tipo de documento: | comunicação em conferência |
|---|
| Tipo de acesso: | acesso restrito |
|---|
| Instituição associada: | Universidade do Minho |
|---|
| Idioma: | inglês |
|---|
| Origem: | RepositóriUM - Universidade do Minho |
|---|