Abstract
Nurse scheduling problem (NSP) is the problem of determining a reasonable and efficient work schedule for nurses. This paper presents a new external memory-based approach along with Multi-Objective Genetic Algorithms (MOGA) to solve multiobjective NSPs. In multiobjective modeling of NSPs, there are several objectives which are in conflict with each other, and there are some hard constraints that should be satisfied in any solution. The presented approach can solve multiobjective NSPs in an efficient way. As demonstrated by the experimental results, MOGA together with the maintained external memory extracted significantly more nondominated solutions compared to MOGA without a memory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
