Abstract

The quest for robust heuristics that are able to solve more than one problem is ongoing. In this paper, we present, discuss and analyze a technique called Evolutionary Squeaky Wheel Optimization and apply it to two different personnel scheduling problems. Evolutionary Squeaky Wheel Optimization improves the original squeaky wheel optimization's effectiveness and execution speed by incorporating two additional steps (selection and mutation) for added evolution. In the evolutionary squeaky wheel optimization, a cycle of analysis-selection-mutation-prioritization-construction continues until stopping conditions are reached. The aim of the analysis step is to identify below average solution components by calculating a fitness value for all components. The selection step then chooses amongst these underperformers and discards some probabilistically based on fitness. The mutation step further discards a few components at random. Solutions can become incomplete and thus repairs may be required. The repair is carried out by using the prioritization step to first produce priorities that determine an order by which the following construction step then schedules the remaining components. Therefore, improvements in the evolutionary squeaky wheel optimization is achieved by selective solution disruption mixed with iterative improvement and constructive repair. Strong experimental results are reported on two different domains of personnel scheduling: bus and rail driver scheduling and hospital nurse scheduling.

Full Text
Paper version not known

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 call

Disclaimer: 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.