A PSO inspired asynchronous cooperative distributed hyper-heuristic for course timetabling problems
This paper presents a novel approach for asynchronous cooperative hyper-heuristic incorporated with particle swarm optimisation which inspired by social individual behaviour of swarm intelligence, like bird flocking and fish schooling. The proposed hyper-heuristic algorithm starts with a complete so...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
American Scientific Publishers
2017
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/29017/1/A%20PSO%20inspired%20asynchronous%20cooperative%20distributed%20hyper-heuristic%20for%20course%20timetabling%20problems%20ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/29017/4/A%20PSO%20inspired%20asynchronous%20cooperative%20distributed%20hyper-heuristic%20for%20course%20timetabling%20problems%20FULL%20TEXT-2-9.pdf https://eprints.ums.edu.my/id/eprint/29017/ https://www.ingentaconnect.com/contentone/asp/asl/2017/00000023/00000011/art00127 http://dx.doi.org/10.1166/asl.2017.10210 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Malaysia Sabah |
| Language: | English English |
| Summary: | This paper presents a novel approach for asynchronous cooperative hyper-heuristic incorporated with particle swarm optimisation which inspired by social individual behaviour of swarm intelligence, like bird flocking and fish schooling. The proposed hyper-heuristic algorithm starts with a complete solution and tries to improve the soft constraints, whilst always remaining in the feasible region of the search space. The performances of the proposed cooperative hyper-heuristics are evaluated using the standard course timetabling benchmark problem. From the experimental results, it shows that the proposed Asynchronous Cooperative Distribute Low-level heuristics (ACDLLHs) algorithm is able to find new best solutions for all five medium problem instances and shared optimal solutions for all five small instances. When coupled with two, four and six agents, the Asynchronous Cooperative Distributed Hyper-heuristic (ACDHH) algorithm is able to improve the solution quality for a large instance. |
|---|