A Survey of Automated Timetabling
Artificial Intelligence Review
A Comparison of Annealing Techniques for Academic Course Scheduling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Solving combinatorial optimization problems using a new algorithm based on gravitational attraction
Solving combinatorial optimization problems using a new algorithm based on gravitational attraction
An effective hybrid algorithm for university course timetabling
Journal of Scheduling
An Extended Implementation of the Great Deluge Algorithm for Course Timetabling
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Generating University Course Timetable Using Genetic Algorithms and Local Search
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
Evolutionary Non-linear Great Deluge for University Course Timetabling
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Information Sciences: an International Journal
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Fish swarm intelligent algorithm for the course timetabling problem
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Local search techniques for large high school timetabling problems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hyper-heuristics with low level parameter adaptation
Evolutionary Computation
Performance evaluation of evolutionary heuristics in dynamic environments
Applied Intelligence
A graph coloring constructive hyper-heuristic for examination timetabling problems
Applied Intelligence
A hybrid algorithm for constrained portfolio selection problems
Applied Intelligence
An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle
Applied Intelligence
Hi-index | 0.00 |
Population based algorithms are generally better at exploring a search space than local search algorithms (i.e. searches based on a single heuristic). However, the limitation of many population based algorithms is in exploiting the search space. We propose a population based Local Search (PB-LS) heuristic that is embedded within a local search algorithm (as a mechanism to exploit the search space). PB-LS employs two operators. The first is applied to a single solution to determine the force between the incumbent solution and the trial current solution (i.e. a single direction force), whilst the second operator is applied to all solutions to determine the force in all directions. The progress of the search is governed by these forces, either in a single direction or in all directions. Our proposed algorithm is able to both diversify and intensify the search more effectively, when compared to other local search and population based algorithms. We use university course timetabling (Socha benchmark datasets) as a test domain. In order to evaluate the effectiveness of PB-LS, we perform a comparison between the performances of PB-LS with other approaches drawn from the scientific literature. Results demonstrate that PB-LS is able to produce statistically significantly higher quality solutions, outperforming many other approaches on the Socha dataset.