Skip to main content

Parallel Cooperating A-Teams Solving Instances of the Euclidean Planar Travelling Salesman Problem

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6682))

Abstract

The paper proposes an architecture for solving difficult combinatorial optimization problems through cooperation of several A-Teams working in parallel. The idea extends JABAT environment through integrating the team of asynchronous agent paradigm with the island-based genetic algorithm concept. The proposed architecture has been tested on instances of the Euclidean planar travelling salesman problem. Computational experiment has confirmed that the proposed architecture is competitive in terms of the quality of solutions in comparison with using traditional, non-cooperating A-Teams.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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, IDSA, Jinan Shandong China, pp. 144–149. IEEE, Los Alamos (2006)

    Google Scholar 

  2. Bellifemine, F., Caire, G., Poggi, A., Rimassa, G.: JADE. A White Paper. Exp. 3(3), 6–20 (2003)

    Google Scholar 

  3. 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 

  4. Czarnowski, I., Jędrzejowicz, P., Wierzbowska, I.: A-Team Middleware on a Cluster. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2009. LNCS, vol. 5559, pp. 764–772. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Jędrzejowicz, P., Wierzbowska, I.: JADE-Based A-Team Environment. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 719–726. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Library of sample instances for the TSP, http://comopt.ifi.uniheidelberg.de/software/TSPLIB95

  7. Talukdar, S.N.: Collaboration Rules for Autonomous Software Agents. Decision Support Systems 24, 269–278 (1999)

    Article  Google Scholar 

  8. Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics 4(4), 295–332 (1998)

    Article  MATH  Google Scholar 

  9. Talukdar, S.N., Pyo, S.S., Giras, T.: Asynchronous Procedures for Parallel Processing. IEEE Trans. on PAS 102(11), 3652–3659 (1983)

    Article  Google Scholar 

  10. Talukdar, S.N., de Souza, P., Murthy, S.: Organizations for Computer-Based Agents. Engineering Intelligent Systems 1(2), 56–69 (1993)

    Google Scholar 

  11. 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 (1989)

    Google Scholar 

  12. Whitley, D., Rana, S., Heckendorn, R.B.: The Island Model Genetic Algorithm: On Separability, Population Size and Convergence. Journal of Computing and Information Technology 7, 33–47 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jędrzejowicz, P., Wierzbowska, I. (2011). Parallel Cooperating A-Teams Solving Instances of the Euclidean Planar Travelling Salesman Problem. In: O’Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2011. Lecture Notes in Computer Science(), vol 6682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22000-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22000-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21999-3

  • Online ISBN: 978-3-642-22000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics