A study on bacterial evolutionary algorithm engine for interactive nurse scheduling support system

Author

Inoue, Takeshi ; Furuhashi, Takeshi ; Maeda, Hiroshi ; Takaba, Minoru

Author_Institution

Dept. of Electr. Eng., Nagoya Univ., Japan

Volume

1

fYear

2000

fDate

2000

Firstpage

651

Abstract

Nurse scheduling problem (NSP) is a combinatorial optimization problem. This paper presents an interactive nurse scheduling support system. This system learns the evaluation criteria from the past schedules, and generates new schedules using the bacterial evolutionary algorithm (BEA). The user can modify or fix parts of the candidate schedules. The system reschedules the parts that need improvement. The proposed system is needed to produce high quality schedules with a short computation time for a good human-machine interaction. This paper examines the BEA operations, and studies the hardware implementation of BEA on field programmable gate array (FPGA). Appropriate operations and parameters of BEA are clarified. A practical NSP was estimated and solved within 2 seconds by the hardware

Keywords

genetic algorithms; health care; interactive systems; medical administrative data processing; scheduling; FPGA; bacterial evolutionary algorithm; combinatorial optimization; evaluation criteria; human-machine interaction; interactive system; nurse scheduling system; rule extraction; Engines; Evolutionary computation; Field programmable gate arrays; Hardware; Humans; Information science; Interactive systems; Man machine systems; Microorganisms; Processor scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Electronics Society, 2000. IECON 2000. 26th Annual Confjerence of the IEEE

Conference_Location

Nagoya

Print_ISBN

0-7803-6456-2

Type

conf

DOI

10.1109/IECON.2000.973226

Filename

973226