Impact of Migration Topologies on Performance of Teams of Agents

Chapter
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 234)

Abstract

The chapter sums up the impact of some parameters defining the process of migration of data between asynchronous team of agents (A-Team) working in parallel in the architecture designed for solving difficult combinatorial optimization problems. A-Teams cooperate through exchange of intermediary computation results. The process of forwarding a result from one A-Team to another is called migration. Several known migration models have been compared, with different topologies and frequencies of migration. Also, an original model of communication has been proposed. The model, called Randomized, has no predefined migration topology, each A-Team sends data to another A-Team that is chosen at random. In this model migration is non-periodic and triggered only after an A-Team failed to improve its best current solution within a predefined time. All considered models, differing in migration topologies and frequencies, have been tested on instances of the Euclidean planar traveling salesman problem. The proposed model, Randomized, outperforms all other models under investigation, producing significantly better results.

Keywords

A-Teams Optimization Computationally Hard Problems Migration TSP 

Notes

Acknowledgments

Calculations have been performed in the Academic Computer Centre TASK in Gdansk. The research has been supported by the Ministry of Science and Higher Education no. N N519 576438 for years 2010-2013.

References

  1. 1.
    Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: Influence of the working strategy on A-Team performance. In: Smart Information and Knowledge Management, pp. 83–102 (2010)Google Scholar
  2. 2.
    Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak, E., Wierzbowska, I.: JADE-based A-Team as a tool for implementing population-based algorithms. In: Chen, Y., Abraham, A. (eds.) Intelligent Systems Design and Applications, ISDA, Jinan Shandong China, pp. 144–149. IEEE Los Alamos (2006)Google Scholar
  3. 3.
    Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak, E., Wierzbowska, I.: Parallel Co-operating A-Teams. In: Jȩdrzejowicz P. et al. (eds.): ICCCI 2011, LNCS 6923, pp. 322–331, Springer, Berlin (2011)Google Scholar
  4. 4.
    Barbucha, D., Jȩdrzejowicz, P.: An experimental investigation of the synergetic effect of multiple agents working together in the A-Team. Syst. Sci. 34(2), 55–62 (2008)MATHGoogle Scholar
  5. 5.
    Bellifemine, F., Caire, G., Poggi, A., Rimassa, G.: A white paper. JADE Exp. 3(3), 6–20 (2003)Google Scholar
  6. 6.
    Cohoon, J.P., Hegde, S.U., Martin, W.N., Richards, D.: Punctuated equilibria: a parallel genetic algorithm. In: Proceedings of the Second International Conference on Genetic Algorithms. pp. 148–154. Lawrence Erlbaum Associates, Hillsdale (1987)Google Scholar
  7. 7.
    Czarnowski, I., Jȩdrzejowicz P., Wierzbowska, I.: A-Team middleware on a cluster. In: Hakansson A. et al. (eds.) KES - AMSTA 2009, LNAI 5559, pp. 764–772. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Czarnowski, I., Jȩdrzejowicz, P.: Agent-based simulated annealing and Tabu search procedures applied to solving the data reduction problem. Int. J. Appl. Math. Comput. Sci. 21(1), 57–68 (2011)CrossRefMATHGoogle Scholar
  9. 9.
    Jȩdrzejowicz, P., Wierzbowska, I.: JADE-based A-Team environment. In: Alexandrov V.N. et al. (eds.): ICCS 2006, Part III, LNCS 3993, pp. 719–726. Springer, Berlin (2006)Google Scholar
  10. 10.
    Jȩdrzejowicz, P., Wierzbowska, I.: Experimental investigation of the synergetic effect produced by agents solving together instances of the euclidean planar travelling salesman problem. KES-AMSTA 2, 160–169 (2010)Google Scholar
  11. 11.
    Jȩdrzejowicz, P., Wierzbowska, I.: Impact of migration topologies on performance of teams of A-Teams. In: Grana M. et al. (eds) Advances in Knowledge-Based and Intelligent Information and Engineering Systems, pp. 1161–1180. IOS Press (2012)Google Scholar
  12. 12.
    Rucinski, M., Izzo, D., Biscani, F.: On the impact of the migration topology on the Island model. Parallel Comput. 36(10–11), 555–571 (2010)Google Scholar
  13. 13.
    Talukdar, S.N.: Collaboration rules for autonomous software agents. Decis. Support Syst. 24, 269–278 (1999)CrossRefGoogle Scholar
  14. 14.
    Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous teams: cooperation schemes for autonomous agents. J. Heuristics 4(4), 295–332 (1998)CrossRefGoogle Scholar
  15. 15.
    Talukdar, S.N., Pyo, S.S., Giras, T.: Asynchronous procedures for parallel processing. IEEE Trans. PAS PAS-102(11), 3652–3659 (1983)Google Scholar
  16. 16.
    Talukdar, S.N., de Souza, P., Murthy, S.: Organizations for computer-based agents. Eng. Intell. Syst. 1(2), 56–69 (1993)Google Scholar
  17. 17.
    Tanese, R.: Distributed genetic algorithms. In: Schaffer, J. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 434–439. Morgan Kaufmann, San Mateo, USA (1989)Google Scholar
  18. 18.
    Whitley, D., Rana, S., Heckendorn, R.B.: The Island model genetic algorithm: on separability, population size and convergence. J. Comput. Inform. Technol. 7, 33–47 (1998)Google Scholar
  19. 19.
    Wooldridge, M.: An Introduction to multiagent systems. Wiley, England (2002)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Information SystemsGdynia Maritime UniversityGdyniaPoland

Personalised recommendations