Agent-Based Approach to Solving Difficult Scheduling Problems
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.
KeywordsSchedule Problem Simulated Annealing Tabu Search Hybrid Genetic Algorithm Tabu Search Algorithm
Unable to display preview. Download preview PDF.
- 3.Czarnowski, I., Jędrzejowicz, P.: Application of the Parallel Population Learning Algorithm to Training Feed-forward ANN. In: Sincak, P. (ed.) Intelligent Technologies - Theory and Applications, pp. 10–16. IOS Press, Amsterdam (2002)Google Scholar
- 11.Ruiz, R., Maroto, C., Alcaraz, J.: New Genetic Algorithms for the Permutation Flowshop Scheduling Problems. In: Proc. The Fifth Metaheuristic International Conference, Kyoto, pp. 63-1–63-8 (2003)Google Scholar
- 13.Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18-59-96, Carnegie Mellon University, Pittsburgh (1996)Google Scholar