원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In this application of artificial intelligence to a real-world problem, the constrained scheduling of
employee resourcing for a mall type shop is solved by means of a genetic algorithm. hromosomes encode a one-week schedule and a constraint matrix handles all requirements for the population. The genetic operators are purposely designed to preserve all constraints and the objective function assures an imposed coverage, this is for people on both sections of the mall. The results demonstrate that the genetic algorithm approach can provide acceptable solutions to this type of employee scheduling problem with constrains.
목차
Abstract
1. Introduction
2. Problem formulation
3. Problem solution
3.1. Chromosome encoding
3.2. Objective function
3.3. Constraint setting
3.4. Initial population
3.5. Mutation operator
3.6. Cross-over operator
3.7. Elitism
3.8. Other genetic algorithm settings
4. Results
5. Conclusion
References
1. Introduction
2. Problem formulation
3. Problem solution
3.1. Chromosome encoding
3.2. Objective function
3.3. Constraint setting
3.4. Initial population
3.5. Mutation operator
3.6. Cross-over operator
3.7. Elitism
3.8. Other genetic algorithm settings
4. Results
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보