A HYBRID IMPROVEMENT HEURISTICS FOR THE BIN PACKING PROBLEM AND ITS APPLICATION TO THE PROBLEM OF TASK SCHEDULING / UMA HEURÍSTICA HÍBRIDA DE MELHORIA PARA O PROBLEMA DE BIN PACKING E SUA APLICAÇÃO AO PROBLEMA DE ESCALONAMENTO DE TAREFAS
AUTOR(ES)
ADRIANA CESARIO DE FARIA ALVIM
DATA DE PUBLICAÇÃO
2003
RESUMO
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several components: lower and upper bounds; reductions, construction of initial solutions by reference to the dual problem;heuristics for load redistribution based on dominance, differencing, and unbalancing; and tabu search. We also investigate the application of this hybrid heuristic to the problem of task scheduling on identical parallel processors. Computational results on hundreds of benchmark test problem are presented.
ASSUNTO(S)
metaheuristics combinatorial optimization heuristica tabu search heuristics otimizacao combinatoria metaheuristicas busca tabu
ACESSO AO ARTIGO
Documentos Relacionados
- New heuristics to crew scheduling problem
- Novas heurísticas para o problema de escalonamento de atripulações
- Metaheurística Híbrida GRASP e Busca Tabu Aplicada ao Problema de Escalonamento de Tarefas
- HYBRID HEURISTICS FOR THE PHYLOGENY PROBLEM
- Algoritmos aproximados para solucionar o problema de Bin Packing unidimensional.