원문정보
보안공학연구지원센터(IJSEIA)
International Journal of Software Engineering and Its Applications
Vol.7 No.4
2013.07
pp.269-278
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The simulated annealing was perceived as a useful method for many intractable problems. However, it needs additional strategies to cope with time complexity due to an initial state and search space reduction. In this work, we suggested an efficient transition rule and ap-plied it to a nurse scheduling problem. It uses a cost matrix to reduce a set of candidates, which results in performance improvement. The experimental results showed that the sug-gested method generated a feasible solution for the nurse scheduling problem faster in time and better in quality compared to traditional simulated annealing.
목차
Abstract
1. Introduction
2. Problem Description
2.1. Nurse Scheduling Problem
2.2. Cost Function
3. Algorithmic Flow of CMSA
3.1. Simulated Annealing
3.2. Cost Matrix and Transition Rule for CMSA
3.3. Cost Matrix and Transition Rule Temperature Scheduling for CMSA
4. Experiments and Results
5. Conclusion and Future Work
Acknowledgements
References
1. Introduction
2. Problem Description
2.1. Nurse Scheduling Problem
2.2. Cost Function
3. Algorithmic Flow of CMSA
3.1. Simulated Annealing
3.2. Cost Matrix and Transition Rule for CMSA
3.3. Cost Matrix and Transition Rule Temperature Scheduling for CMSA
4. Experiments and Results
5. Conclusion and Future Work
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보