A multiagent system to solve JSSP using a multi-population cultural algorithm

Authors:
Mohammad R. Raeesi N.;Ziad Kobti
Affiliations:
School of Computer Science, University of Windsor, Windsor, ON, Canada;School of Computer Science, University of Windsor, Windsor, ON, Canada
Venue:
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Year:
2012

Citing 3
Cited 0

Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization

Journal of Heuristics
Knowledge Migration Based Multi-population Cultural Algorithm

ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 04

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, a multiagent system is proposed to solve Job Shop Scheduling Problems. In the proposed system, a number of autonomous agents cooperate in a Multi-Population Cultural Algorithm (MP-CA) framework. The proposed multiagent system consists of a number of groups of agents called sub-populations. The agents in each sub-population are co-evolving using a local CA. The local CAs are working in parallel and communicating to each other to exchange their extracted knowledge. The knowledge is migrated in the form of structured belief which is defined as a statistical records of an agent or a group of agents. Experiments show that our method outperforms some existing methods by offering better solutions as well as a better convergence rate.