Discrete flower pollination algorithm for patient admission scheduling problem

This paper aims to tackle the Patient Admission Scheduling Problem (PASP) using the Discrete Flower Pollination Algorithm (DFPA), a new, meta-heuristic optimization method based on plant pollination. PASP is one of the most important problems in the field of health care. It is a highly constrained a...

Full description

Saved in:
Bibliographic Details
Published in:Computers in biology and medicine 2022-02, Vol.141, p.105007-105007, Article 105007
Main Authors: Abdalkareem, Zahraa A., Al-Betar, Mohammed Azmi, Amir, Amiza, Ehkan, Phaklen, Hammouri, Abdelaziz I., Salman, Omar H.
Format: Article
Language:English
Subjects:
Algorithms
Civil engineering
Combinatorial analysis
Combinatorial optimization
Constraints
Costs
Datasets
Discretization
Flower pollination algorithm
Flowers
Gender
Health care
Heuristic
Heuristic methods
Heuristics
Humans
Integer programming
Meta-heuristics
Neighborhoods
Optimization
Patient Admission
Patient admission scheduling problem
Patients
Pollination
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper aims to tackle the Patient Admission Scheduling Problem (PASP) using the Discrete Flower Pollination Algorithm (DFPA), a new, meta-heuristic optimization method based on plant pollination. PASP is one of the most important problems in the field of health care. It is a highly constrained and combinatorial optimization problem of assigning patients to medical resources in a hospital, subject to predefined constraints, while maximizing patient comfort. While the flower pollination algorithm was designed for continuous optimization domains, a discretization of the algorithm has been carried out for application to the PASP. Various neighborhood structures have been employed to enhance the method, and to explore more solutions in the search space. The proposed method has been tested on six instances of benchmark datasets for comparison against another algorithm using the same dataset. The prospective method is shown to be very efficient in solving any scheduling problem. •A discrete flower pollination algorithm is proposed for PASP.•A discretization procedure is invoked to address such kind of problem.•3.Three neighborhood structures have been employed to enhance the method.•The proposed method has been successful in gaining promising feasible solutions.
ISSN:0010-4825
1879-0534
DOI:10.1016/j.compbiomed.2021.105007