Name: | Description: | Size: | Format: | |
---|---|---|---|---|
378.51 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Este artigo apresenta uma meta-heurística baseada na escalada do monte para o problema “flowshop” de permutação (PFSP). O algoritmo é descrito e são propostas cinco afinações, que foram testadas e comparadas entre si e com o algoritmo proposto. É feito um conjunto de testes, onde se mostra que sem essas afinações os resultados pioram, e que a qualidade dos resultados desta abordagem está ao nível dos algoritmos de referência.
This paper presents a meta-heuristic to the permutation flowshop problem (PFSP) based on hill climbing. The algorithm is described and five adjustments proposed, which were tested and compared with each other and with the proposed algorithm. A set of tests is made, which shows that without these adjustments the results get worse, and that the quality of the results of this approach is at the level of the algorithms of reference.
This paper presents a meta-heuristic to the permutation flowshop problem (PFSP) based on hill climbing. The algorithm is described and five adjustments proposed, which were tested and compared with each other and with the proposed algorithm. A set of tests is made, which shows that without these adjustments the results get worse, and that the quality of the results of this approach is at the level of the algorithms of reference.
Description
Keywords
Meta-heurística Escalada do monte Flowshop Meta-heuristic Hill-climbing
Citation
Teixeira, Miguel Ângelo; Coelho, José - Escalada do monte aplicada ao problema flowshop de permutação. "Revista de Ciências da Computação" [Em linha]. ISSN 1646-6330. Vol. 7, nº 7 (2012), p. 57-65
Publisher
Universidade Aberta