Job-Shop scheduling based on multiagent evolutionary algorithm

  • Authors:
  • Weicai Zhong;Jing Liu;Licheng Jiao

  • Affiliations:
  • Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the intrinsic properties of job-shop scheduling problems (JSPs) in mind, we integrate the multiagent systems and evolutionary algorithms to form a new algorithm, Multiagent Evolutionary Algorithm for JSPs (MAEA-JSPs). In MAEA-JSPs, all agents live in a latticelike environment. Making use of the designed behaviors, MAEA-JSPs realizes the ability of agents to sense and act on the environment in which they live. During the process of interacting with the environment and the other agents, each agent increases energy as much as possible, so that MAEA-JSPs can find the optima. In the experiments, 59 benchmark JSPs are used, and good performance is obtained.