A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/a6020278 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014029878 / rank
 
Normal rank

Revision as of 17:42, 21 March 2024

scientific article
Language Label Description Also known as
English
A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
scientific article

    Statements

    A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (English)
    0 references
    0 references
    26 March 2019
    0 references
    Summary: In this contribution, a generic two-phase stochastic variable neighborhood approach is applied to nurse rostering problems. The proposed algorithm is used for creating feasible and efficient nurse rosters for many different nurse rostering cases. In order to demonstrate the efficiency and generic applicability of the proposed approach, experiments with real-world input data coming from many different nurse rostering cases have been conducted. The nurse rostering instances used have significant differences in nature, structure, philosophy and the type of hard and soft constraints. Computational results show that the proposed algorithm performs better than six different existing approaches applied to the same nurse rostering input instances using the same evaluation criteria. In addition, in all cases, it manages to reach the best-known fitness achieved in the literature, and in one case, it manages to beat the best-known fitness achieved till now.
    0 references
    nurse rostering
    0 references
    hospital personnel scheduling
    0 references
    stochastic variable neighborhood
    0 references
    two-phase algorithm
    0 references
    mutation element
    0 references
    swap selective mutation
    0 references
    reduce Rosters
    0 references
    cost
    0 references

    Identifiers