Using NSGAII to Solve Bi-objective Bed Allocation Problems

Authors

  • Jalal A. Sultan Department of Mathematics, College of Al-Hamdaniah Education, University of Mosul, Al-Hamdaniah, Iraq
  • Ban A. Mitras Department of Statistics & Information, College of Mathematics and Computer Sciences, University of Mosul, Mosul, Iraq.
  • Raghad M. Jasim Department of Operation Research, College of Mathematics and Computer Sciences, University of Mosul, Mosul, Iraq

DOI:

https://doi.org/10.21928/juhd.v1n3y2015.pp397-401

Keywords:

Bed Allocation Problem, Non-Dominated Sorting, Genetic Algorithm, Multi-Objective Optimization

Abstract

The Bed Allocation Problem (BAP) is NP-complete and always high dimensional. In this paper, a bi-objective decision aiding model based on queuing theory is introduced for allocation of beds in a hospital. The problem is modeled as an M/PH/n queue. The objectives include maximizing the patient admission rate human resources, in particular, maximization of the nursing work hours. The proposed model is solved by using Non-dominated Sorting Genetic Algorithm-II (NSGA-II), which is a very effective algorithm for solving multi-objective optimization problems and finding optimal Pareto front. The paper describes an application of the model, dealing with a public hospital in Iraq. The results related that multi-objective model was presented suitable framework for bed allocation and optimum use.

Downloads

Published

2015-08-31

Issue

Vol. 1 No. 3 (2015)

Section

Articles

How to Cite

Using NSGAII to Solve Bi-objective Bed Allocation Problems. (2015). Journal of University of Human Development, 1(3), 397-401. https://doi.org/10.21928/juhd.v1n3y2015.pp397-401

Most read articles by the same author(s)