A Guided Particle Swarm Optimization Algorithm for Nurse Scheduling Problem

Mohd Rasip, Norhayati and Basari, A.S.H and Hussin, Burairah and Ibrahim, N. K. (2014) A Guided Particle Swarm Optimization Algorithm for Nurse Scheduling Problem. Applied Mathematical Sciences. pp. 5625-5632. ISSN 1312-885X

[img] PDF
rasipAMS113-116-2014.pdf - Published Version
Restricted to Registered users only

Download (60kB) | Request a copy


The Nurse Scheduling Problem (NSP) is a combination of optimization problem and important management functions performed by nurses which directly affected the hospital services and the patient care . The NSP is varied which tends to be solved with nature inspired search approaches such as particle swarm optimization (PSO). Hence, the main purpose of this paper is to utilize the PSO to find the balance of nurse assignment by considering the coverage demand and nurse preferences. The actual task of generating the nurse schedule is investigated in ad, and H. Basari, “An Investigation of. The proposed algorithms are tested on the real data and the obtained results demonstrate that the proposed particle swarm optimization has better performance to cope with complex scheduling problem. The experimental results show that the guided randomly PSO algorithm is more effective in term of the time constraint and the feasible assignment solution.

Item Type: Article
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA76 Computer software
Divisions: Faculty of Information and Communication Technology > Department of Industrial Computing
Depositing User: Dr. Abd. Samad Hasan Basari
Date Deposited: 10 Feb 2015 00:27
Last Modified: 28 May 2015 04:36
URI: http://eprints.utem.edu.my/id/eprint/14196
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item