PENYELESAIAN NURSE ROSTERING PROBLEM DENGAN MODIFIED HARMONY SEARCH ALGORITHM
| Main Author: | SONYA AGNESIA SIMANJUNTAK, 081411631045 |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://repository.unair.ac.id/80013/1/KKC%20KK%20ST.SI%2003-19%20Sim%20p%20abs.pdf http://repository.unair.ac.id/80013/2/KKC%20KK%20ST.SI%2003-19%20Sim%20p.pdf http://repository.unair.ac.id/80013/ http://lib.unair.ac.id |
Daftar Isi:
- Nurse Rostering Problem (NRP) is a combinatorial problem about nurses scheduling which has several constraints that must be considered. The main problem in NRP is to get an optimal combination of nurse shifts. In this research, Harmony Search Algorithm (HSA) and Modified Harmony Search Algorithm (MHSA) will be compared to solve the NRP. MHSA is the development of the HSA which had been modified in its improvisation of new solutions step by using pitch adjustment operator: Move, Swap, and Switch. In this research, there is adjustment step on both method. This adjustment is completing the lack of fulfillment of the number of nurses' requests. NRP data used are: Small Data (18 nurses), Medium Data (50 nurses) and Large Data (73 nurses). The completion of NRP with HSA and MHSA use different Harmony Memory Size (HMS) and Number of Improvisation (NI) values. The results of NRP using HSA and MHSA consist of nurses shift scheduling and objective function value or penalty value of the best solution. In this research, the result of NRP using HSA and MHSA with computer program written by Java displays that the smallest objective function value can be obtained using HMS = 50 and NI = 5000 for less than 100 nurses and NRP completion with MHSA has better result than HSA.