Earticle

초록

영어

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

키워드

저자

• Young-Woong Ko [ Dept. of Computer Engineering Hallym University ]
• DongHoi Kim [ Dept. of Computer Engineering Hallym University ]
• Minyeong Jeong [ Dept. of Computer Engineering Hallym University ]
• Wooram Jeon [ Dept. of Computer Engineering Hallym University ]
• Saangyong Uhmn [ Dept. of Computer Engineering Hallym University ]
• Jin Kim [ Dept. of Computer Engineering Hallym University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605