2018
DOI: 10.1515/jisys-2018-0094
|View full text |Cite
|
Sign up to set email alerts
|

Harmony Search Algorithm for Patient Admission Scheduling Problem

Abstract: Abstract The patient admission scheduling (PAS) problem is an optimization problem in which we assign patients automatically to beds for a specific period of time while preserving their medical requirements and their preferences. In this paper, we present a novel solution to the PAS problem using the harmony search (HS) algorithm. We tailor the HS to solve the PAS problem by distributing patients to beds randomly in the harmony memory (HM) while respecting all hard constraints.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…The SSA performance was assessed in this research through four testing systems (6,13,15,40) generating units.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The SSA performance was assessed in this research through four testing systems (6,13,15,40) generating units.…”
Section: Resultsmentioning
confidence: 99%
“…The researcher interested in meta-heuristic techniques, especially in the last years, in many different areas that focus on many different issues, such as: scheduling problems [12][13][14][15][16], data classification [17], time series [18,19], data clustering [20,21], and global optimization [22]. Because of these methods, have multiple capabilities, the researchers concerned in depending them in developing solutions for the aim of resolving ELD.…”
Section: Meta-heuristic Algorithm For Eldmentioning
confidence: 99%
“…The main purpose behind the scheduling method is in the reduction of the patient waiting time, and in the hospital resource utilization enhancement. Moreover, [31] tackled PASP using a population-based metaheurstic called harmony search algorithm. The method has been tested on 6 instances of data set 1 and compare with other metaheurstic approaches.…”
Section: Pasp-based Optimization Methodsmentioning
confidence: 99%
“…e simulated annealing algorithm (SA) was first proposed by Metropolis and was used by Kirkpatrick for combinatorial optimization. e starting point of the simulated annealing algorithm is to simulate the physical annealing process in nature and combine it with a mathematical iterative solution strategy, which can be used to solve optimization problems in various engineering projects [19]. To prevent the entire search process from falling into the local minimum closest to the initial point, the simulated annealing method determines the optimization process based on the Boltzmann probability distribution.…”
Section: Simulated Annealing Algorithm For Designmentioning
confidence: 99%