Idioma:

Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling

Abdullah, Salwani ; Ahmadi, Samad ; Burke, Edmund K. ; Dror, Moshe

OR Spectrum, 2007-04, Vol.29 (2), p.351-372 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling
Autor: Abdullah, Salwani ; Ahmadi, Samad ; Burke, Edmund K. ; Dror, Moshe
Assuntos: Automation ; Combinatorics ; Effectiveness ; Genetic algorithms ; Graph representations ; Heuristic ; Methods ; Neighborhoods ; Searches ; Shortest path algorithms ; Studies
É parte de: OR Spectrum, 2007-04, Vol.29 (2), p.351-372
Descrição: Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of "adjacent" (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique.
Editor: Heidelberg: Springer Nature B.V
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 9 Avançar Ir para próxima página