Agent-based approach to solving difficult scheduling problems

Authors:
Joanna Jędrzejowicz;Piotr Jędrzejowicz
Affiliations:
Institute of Mathematics, Gdańsk University, Gdańsk, Poland;Department of Information Systems, Gdynia Maritime University, Gdynia, Poland
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 2
Cited 3

A-Teams: An Agent Architecture for Optimization and Decision Support

ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
New upper bounds for the permutation flowshop scheduling problem

IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence

An agent-based approach to knapsack optimization problems

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
An investigation of agent-based hybrid approach to solve flowshop and job-shop scheduling problems

KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Study of the migration scheme influence on performance of a-teams solving the job shop scheduling problem

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes a variant of the A-Team architecture called PLA-Team. An A-Team is a problem solving architecture in which the agents are autonomous and co-operate by modifying one another’s trial solutions. A PLA-Team differs from other A-Teams with respect to strategy of generating and destroying solutions kept in the common memory. The proposed PLA-Team performance is evaluated basing on computational experiments involving benchmark instances of two well known combinatorial optimization problems – flow shop and job-shop scheduling. Solutions generated by the PLA-Team are compared with those produced by state-of-the-arts algorithms.