As a NP-hard combinatorial problem, nurse scheduling problem (NSP) is a well-known personnel scheduling task whose goal is to create a nurse schedule under a series of hard and soft constraints in a practical world. In this paper, a variant of structure-redesigned-based bacterial foraging optimization (SRBFO) with a dynamic topology structure (SRBFO-DN) is employed for solving nurse scheduling problem (NSP). In SRBFO-DN, each bacterium achieves cooperation by information exchange mechanism switching the topology structure between star topology and ring topology. A special encoding operation of bacteria in SRBFO-DN is adopted to transform position vectors into feasible solutions, which can make SRBFO-DN successfully dealing with this typical difficult and discrete NSP. Experiment results obtained by SRBFO-DN compared with SRBFO and SPSO demonstrated that the efficiency of the proposed SRBFO-DN algorithm is better than other two algorithms for dealing with NSP.
CITATION STYLE
Niu, B., Wang, C., Liu, J., Gan, J., & Yuan, L. (2015). Improved bacterial foraging optimization algorithm with information communication mechanism for nurse scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9226, pp. 701–707). Springer Verlag. https://doi.org/10.1007/978-3-319-22186-1_69
Mendeley helps you to discover research relevant for your work.