Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering

European Journal of Operational Research

Volumn 175, Issue 2, 2006, Pages 649-671

  Beddoe, Gareth R ^a   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Case based reasoning; Feature selection and weighting; Knowledge based systems; Meta heuristics; Scheduling

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; KNOWLEDGE BASED SYSTEMS; METADATA; NUMBER THEORY; PROBLEM SOLVING; SCHEDULING;

CASE BASED REASONING (CBR); FEATURE SELECTION AND WEIGHTING; META HEURISTICS; ROSTERING DECISIONS;

FORMAL LOGIC;

EID: 33748436263     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.12.028     Document Type: Article

References (30)

1. S. Abdennadher, H. Schlenker, INTERDIP-an interactive constraint based nurse scheduler, in: Proceedings of the First International Conference and Exhibition on the Practical Application of Constraint Technologies and Logic Programming, PACLP, 1999.
2. Aha D.W. Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms. International Journal of Man-Machine Studies 36 (1992) 267-287
3. Bailey J. Integrated days off and shift personnel scheduling. Computing and Industrial Engineering 9 4 (1985) 395-404
4. Bailey R.N., Garner K.M., and Hobbs M.F. Using simulated annealing and genetic algorithms to solve staff scheduling problems. Asia-Pacific Journal of Operational Research 14 (1997) 27-43
5. Beasley D., Bull D., and Martin R. An overview of genetic algorithms: Part 1, fundamentals. University Computing 15 2 (1993) 58-69
6. Beaumont N. Scheduling staff using mixed integer programming. European Journal of Operational Research 98 (1997) 473-484
7. G.R. Beddoe, S. Petrovic, A novel approach to finding feasible solutions to personnel rostering problems, in: Proceedings of the 14th Annual Conference of the Production and Operation Management Society, Savannah, Georgia, United States, 2003.
8. Burke E.K., De Causmaecker P., and Vanden Berghe G. A hybrid tabu search algorithm for the nurse rostering problem. Selected Papers from the 2nd Asia Pacific Conference on Simulated Evolution and Learning Volume. LNAI vol. 1585 (1998), Springer-Verlag 187-194
9. E.K. Burke, P. De Causmaecker, S. Petrovic, G. Vanden Berghe, Fitness evaluation for nurse scheduling problems, in: Proceedings of the 2001 IEEE Congress on Evolutionary Computation, Seoul, Korea, pp. 1139-1146.
10. Burke E.K., Kendall G., and Soubeiga E. A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9 6 (2003) 451-470
11. B.M.W. Cheng, J.H.M. Lee, J.C.K. Wu, A constriant-based nurse rostering system using a redundant modeling approach. Technical report, Department of Computer Science and Engineering at The Chinese University of Hong Kong, 1996.
12. Dowsland K. Nures scheduling with tabu search and strategic oscillation. European Journal of Operational Research 106 (1998) 393-407
13. A. Duenas, N. Mort, C. Reeves, D. Petrovic, Handling preferences using genetic algorithms for the nurse scheduling problem, in: Proceedings of The First Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), vol. 1, 2003, pp. 180-196.
14. In: Dasarathy B.V. (Ed). Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques (1991), IEEE Computer Society Press
15. Goldberg D. Genetic Algorithms in Search, Optimisation, and Machine Learning (1989), Addison Wesley
16. Holland J. Adaption in Natural and Artificial Systems (1975), MIT Press
17. J.D. Kelly Jr., L. Davis, A hybrid genetic algorithm for classification, in: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 645-650, 1991.
18. Kolodner J.L. Case-Based Reasoning (1993), Morgan Kaufmann Publishers Inc.
19. Kuncheva L.I., and Jain L.C. Nearest neighbor classifier: Simultaneous editing and feature selection. Pattern Recognition Letters 20 (1999) 1149-1156
20. Meyer anf'm Hofe H. Solving rostering tasks as constraint optimization. Selected Papers from the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT). Lecture Notes on Computer Science (2000), Springer-Verlag 280-297
21. Michalewicz Z., and Fogel D.B. How to Solve It: Modern Heuristics (2000), Springer
22. S. Petrovic, G.R. Beddoe, G. Vanden Berghe, Case-based reasoning in employee rostering: Learning repair strategies from domain experts. Technical Report NOTTCS-TR-2002-4, Automated Scheduling Optimisation and Planning Research Group, School of Computer Science and Information Technology, University of Nottingham, 2002.
23. Petrovic S., Beddoe G.R., and Vanden Berghe G. Storing and adapting repair experiences in employee rostering. Practice and Theory of Automated Timetabling IV-Selected Papers from PATAT'2002. Lecture Notes in Computer Science vol. LNCS2740 (2003), Springer-Verlag 149-166
24. Raymer M.L., Punch W.F., Goodman E.D., Kuhn L.A., and Jain A.K. Dimensionality reduction using genetic algorithms. IEEE Transactions on Evolutionary Computation 4 (2000) 164-171
25. Salzberg S. A nearest hyperrectangle learning method. Machine Learning 6 (1991) 251-276
26. S. Scott, R. Simpson, Case-based incorporating scheduling constraint dimensions-experiences in nurse rostering, in: Advances in Case-Based Reasoning-EWCBR98, Lecture Notes in Artificial Intelligence, Springer-Verlag.
27. D.B. Skalak, Prototype and feature selection by sampling and random mutation hill climbing algorithms, in: Proceedings of the International Conference on Machine Learning, 1994, pp. 293-301.
28. Warner M. Scheduling nursing personnel according to nurse preference: A mathematical programming approach. Operations Research 24 (1976) 842-856
29. Wettschereck D., Aha D.W., and Mohri T. A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artificial Intelligence Review 11 1 (1997) 273-314
30. Wren A. Scheduling, timetabling and rostering-a special relationship?. In: Burke E., and Ross P. (Eds). Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science Vol. LNCS 1153 (1996), Springer-Verlag 46-75