Abstract
Personnel scheduling problems are multi-constrained combinatorial optimization problems. This paper deals with personnel scheduling problem where the objective is to assign personnel to task. The work presented is twofold, formulation of problem and application of genetic algorithmic approach to the problem. We have surveyed 45 Indian railway police stations from Mumbai division to formulate the problem and take the real world instances. This paper shows performance of genetic algorithms and hybrid genetic algorithms to a small problem instance with 14 personnel per shift. The results show that problem specific repair operator improves the working of GA at a significant level by avoiding premature convergence and gives the solution quickly.
Sign-in/Register to access full text options 
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.
