Harmony Search-Based Hyper-Heuristic For Scheduling Problems
| dc.contributor.author | Anwar, Khairul | |
| dc.date.accessioned | 2019-03-06T07:20:29Z | |
| dc.date.available | 2019-03-06T07:20:29Z | |
| dc.date.issued | 2018-04 | |
| dc.description.abstract | Scheduling problems are encountered in every field which are typically related to services such as in hospital, transportation, and also educational institutions. These problems can be extremely difficult when its involves a large number of events or resources to be scheduled and a wide variety of constraints which need to be satisfied or taken into consideration. Hence, many heuristic and meta-heuristic approaches have been introduced to solve these problems. However, some institutions look for a method that can deal with a wide range of scheduling problems without spending a lot of money and times as long the solutions produced are acceptable. For this reason, the hyper-heuristic approach have been introduced. The motivation of using hyper-heuristics is to produce a general method that can be used to solve different scheduling problems. Therefore, this research proposes a new alternative heuristic selection mechanism in a hyper-heuristic framework named Harmony Search-based Hyper-heuristic (HSHH). The original idea was to apply a sequence of low-level heuristics to a selected solution in order to produce good quality solutions to a given problem. Three main op-erators in harmony search algorithm: memory consideration, random consideration, and pitch adjustment were combined as high-level heuristics in order to select and generate a sequence of improvements low-level heuristics. To demonstrate the effectiveness of the method, the proposed method was tested with three different scheduling problems (two examination timetabling problems and one nurse rostering problem) taken from the real world. The results produced by the proposed methods were compared with those of other selection perturbative hyper-heuristic methods working on the same datasets. Experimentally, the HSHH approach had achieved comparable re-sults and in several instances was able to produce competitive results. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/7842 | |
| dc.language.iso | en | en_US |
| dc.publisher | Universiti Sains Malaysia | en_US |
| dc.subject | Hyper-heuristics is to produce a general method | en_US |
| dc.subject | used to solve different scheduling problems | en_US |
| dc.title | Harmony Search-Based Hyper-Heuristic For Scheduling Problems | en_US |
| dc.type | Thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: