A Neural Network Parallel Algorithm for Meeting Schedule Problems

Kazuhiro Tsuchiya, Yoshiyasu Takefuji

研究成果: Article査読

4 被引用数 (Scopus)

抄録

A parallel algorithm for solving meeting schedule problems is presented in this paper where the problem is NP-complete. The proposed system is composed of two maximum neural networks which interact with each other. One is an M x S neural network to assign meetings to available time slots on a timetable where M and S are the number of meetings and the number of time slots, respectively. The other is an M x P neural network to assign persons to the meetings where P is the number of persons. The simulation results show that the state of the system always converges to one of the solutions. Our empirical study shows that the solution quality of the proposed algorithm does not degrade with the problem size.

本文言語English
ページ(範囲)205-213
ページ数9
ジャーナルApplied Intelligence
7
3
DOI
出版ステータスPublished - 1997

ASJC Scopus subject areas

  • 人工知能

フィンガープリント

「A Neural Network Parallel Algorithm for Meeting Schedule Problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル