single-jc.php

JACIII Vol.9 No.3 pp. 314-320
doi: 10.20965/jaciii.2005.p0314
(2005)

Paper:

Applying Multi-Agent Algorithm to a Class Scheduling System

Eiji Nunohiro, and Kenneth J. Mackin

Department of Information Systems, Tokyo University of Information Sciences, 1200-2 Yatoh-cho, Wakaba-ku, Chiba 265-8501, Japan

Received:
November 1, 2004
Accepted:
March 8, 2005
Published:
May 20, 2005
Keywords:
multi-agent, scheduling problem, agent negotiation, hill climbing method, self-organization
Abstract

We propose a multi-agent algorithm to solve a scheduling problem. The proposed application takes into account various restrictions relative to Japanese university class scheduling in particular. A multi-agent system consisting of agents representing the requirements and restrictions for professors and departments are introduced. Scheduling is solved using negotiation between agents together with the hill-climbing method. Through a software simulation, we were able to show that our proposed method successfully applies the self-organizing nature of agents to solve the scheduling problem.

Cite this article as:
E. Nunohiro and K. Mackin, “Applying Multi-Agent Algorithm to a Class Scheduling System,” J. Adv. Comput. Intell. Intell. Inform., Vol.9, No.3, pp. 314-320, 2005.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, IE9,10,11, Opera.

Last updated on Sep. 09, 2019