Dynamic cooperative interaction strategy for solving RCPSP by a team of agents

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a dynamic cooperative interaction strategy for the A-Team solving the Resource-Constrained Project Scheduling Problem (RCPSP) is proposed and experimentally validated. The RCPSP belongs to the class of NP-hard optimization problems. To solve this problem a team of asynchronous agents (A-Team) has been implemented using multiagent environment. An A-Team consist of the set of objects including multiple optimization agents, manager agents and the common memory which through interactions produce solutions of hard optimization problems. In this paper the dynamic cooperative interaction strategy is proposed. The strategy supervises cooperation between agents and the common memory. To validate the proposed approach the preliminary computational experiment has been carried out.

Cite

CITATION STYLE

APA

Jędrzejowicz, P., & Ratajczak-Ropel, E. (2016). Dynamic cooperative interaction strategy for solving RCPSP by a team of agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9875 LNCS, pp. 454–463). Springer Verlag. https://doi.org/10.1007/978-3-319-45243-2_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free