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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Jȩdrzejowicz, J., & Jȩdrzejowicz, P. (2006). Agent-based approach to solving difficult scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 24–33). Springer Verlag. https://doi.org/10.1007/11779568_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
