Artificial Bee Colony Algorithm with Nelder–Mead Method to Solve Nurse Scheduling Problem
The nurse scheduling problem (NSP) is an NP-Hard combinatorial optimization scheduling problem that allocates a set of shifts to the group of nurses concerning the schedule period subject to the constraints. The objective of the NSP is to create a schedule that satisfies both hard and soft constrain...
Päätekijät: | Rajeswari Muniyan, Rajakumar Ramalingam, Sultan S. Alshamrani, Durgaprasad Gangodkar, Ankur Dumka, Rajesh Singh, Anita Gehlot, Mamoon Rashid |
---|---|
Aineistotyyppi: | Artikkeli |
Kieli: | English |
Julkaistu: |
MDPI AG
2022-07-01
|
Sarja: | Mathematics |
Aiheet: | |
Linkit: | https://www.mdpi.com/2227-7390/10/15/2576 |
Samankaltaisia teoksia
-
Quantum-behaved Particle Swarm Optimization with Nelder-Mead Simplex Search Method
Tekijä: Weiquan Yao
Julkaistu: (2015-04-01) -
Genetic Nelder-Mead neural network algorithm for fault parameter inversion using GPS data
Tekijä: Leyang Wang, et al.
Julkaistu: (2022-06-01) -
Dynamic Hassan Nelder Mead with Simplex Free Selectivity for Unconstrained Optimization
Tekijä: Hassan A. Musafer, et al.
Julkaistu: (2018-01-01) -
A Stochastic Convergence Result for the Nelder–Mead Simplex Method
Tekijä: Aurél Galántai
Julkaistu: (2023-04-01) -
Integrating the Opposition Nelder–Mead Algorithm into the Selection Phase of the Genetic Algorithm for Enhanced Optimization
Tekijä: Farouq Zitouni, et al.
Julkaistu: (2023-09-01)