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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.3390/a6020278 / rank
Normal rank
 
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
Property / cites work
 
Property / cites work: Using tabu search with longer-term memory and relaxation to create examination timetables. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state of the art of nurse rostering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Personnel scheduling: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indirect genetic algorithm for a nurse-scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary approach for the nurse rerostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multi-objective nurse scheduling problem with a weighted cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy-based neighborhood search approach to a nurse rostering problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the resource-constrained project scheduling problem by a variable neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for graph coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid variable neighbourhood approaches to university exam timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shift sequence based approach for nurse scheduling and a new benchmark dataset / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3390/A6020278 / rank
 
Normal rank

Latest revision as of 07:00, 11 December 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