Abstract
In this paper, a new neighborhood structure is presented. The new neighborhood is obtained by performing a sequence of swaps between two timeslots, instead of only one move in the standard neighborhood structure. Based on new neighborhood, simulated annealing algorithm can solve the timetabling problem well. The computation results on two open benchmarks coming from two real-world high schools timetabling problems prove that the simulated annealing algorithm based on new neighborhood can compete with other effective approaches. Copyright 2009 ACM.
| Original language | English |
|---|---|
| Title of host publication | 2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09 |
| Pages | 381-386 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | 2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09 - Shanghai, China Duration: 12 Jun 2009 → 14 Jun 2009 |
Conference
| Conference | 2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09 |
|---|---|
| Place | China |
| City | Shanghai |
| Period | 12/06/09 → 14/06/09 |
Research Keywords
- Neighborhood
- Simulated Annealing
- Timetabling
Fingerprint
Dive into the research topics of 'A simulated annealing algorithm with a new neighborhood structure for the timetabling problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver