Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 47th Annual Conference of the Institute of Systems, Control and Information Engineers
Conference information
Research on improvement in search efficiency of Cooporative GA in a scheduling problem
Takeshi ITOGA, Yukinobu HOSHINO, Katsuari KAMEI
Author information
Keywords: Cooporative GA, scheduling
CONFERENCE PROCEEDINGS FREE ACCESS

Pages 4038

Details
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
Nurse Scheduling Problem (NSP) is a kind of the optimal combination problem. The creation by hand is difficult and the needs for automation are high. Cooperative GA (CGA) is proposed as a solution method effective until now. However, various children are hard to be generated in order that CGA may cross by one parent pair. In this paper, we propose improvement in search efficiency method of CGA. The proposal method generates various children, by crossing by two or more parent pairs, and aims at improvement in search efficiency.
Content from these authors
© 2003 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top