Metodologia de especificação de times assincronos para problemas de otimização combinatoria

AUTOR(ES)
DATA DE PUBLICAÇÃO

1995

RESUMO

Asynchronous Teams (A-Teams) are a new problem resolution technique that uses simultaneously various heuristic algorithms. These algorithms cooperate synergically one with the other to find optimal or nearly optimal solutions that would not be found through isolated algorithms. This technique has been successfully applied to large combinatorial problems. The main objective of this work is the development of a methodology to specify Asynchronous Teams to Combinatorial Optimization Problems with one objective function, since there is no literature about that. The purpose is to generate a sequence of steps and suggestions making the conception and implementation of Asyncbronous Teams easy and quick. As an example of the proposed methodology, Asynchronous Teams were specified and implemented to the classical permutation Flow Shop Problem. The results obtained by these A- Teams over the tested instances were equivalent or better than those published as the best known values. These A- Teams were executed in a parallel computer, showing linear speed up in the number of processors. Not on1y were the A- Teams to FSP developed, but do were two new formulas to calculate lower bounds. These lower bounds proved the optimally of two instances and improved the lower bounds of many others

ASSUNTO(S)

heuristica otimização combinatoria pesquisa operacional

ACESSO AO ARTIGO

Documentos Relacionados