Skip to main content
SpringerLink
Log in

Exceeding the Efficiency of Distributed Approximate Algorithms Enabling by the Multiplexing Method

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2011)

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

Abstract

Distributed constraint optimization problems have attracted attention as a method for resolving distribution problems in multiagent environments. In this paper, the authors propose a multiplex method aiming to improve the efficiency of a distributed nondeterministic approximate algorithm for distributed constraint optimization problems. Since much of the calculation time is used to transmit messages, improving efficiency using a multiplex calculation of distributed approximate algorithms might be feasible on the presupposition that the calculation time of each node or a small change in message length has no direct impact. The authors conducted a theoretical analysis of efforts to improve efficiency using a multiplex calculation of distributed approximate algorithms using extreme value theory and verifying with an experiment of a simple algorithm. A significant reduction in calculation time and improvement in the quality of the solution was ascertained, as a result of the experiment.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Calisti, M., Neagu, N.: Constraint satisfaction techniques and software agents. In: Agents and Constraints Workshop at AIIA 2004 (2004)

    Google Scholar 

  2. Falco, I.D., Balio, R.D., Tarantino, E., Vaccaro, R.: Improving search by incorporating evolution principles in parallel tabu search. In: 1994 IEEE Conference on Evolutionary Computation, pp. 823–828 (1994)

    Google Scholar 

  3. Fitzpatrick, S., Meertens, L.: An experimental assessment of a stochastic, anytime, decentralized, soft colourer for sparse graphs. In: 1st Symposium on Stochastic Algorithms: Foundations and Applications, pp. 49–64 (2001)

    Google Scholar 

  4. Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126, 43–62 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ringwelski, G., Hamadi, Y.: Boosting distributed constraint satisfaction. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 549–562. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Iizuka, Y., Takeuchi, I.: A fast approximation method for distributed constraint optimization problems. Computer Software - JSSST Journal 27 (2010)

    Google Scholar 

  7. Junges, R., Bazzan, A.L.C.: Evaluating the performance of dcop algorithms in a real world, dynamic problem. In: AAMAS 2008: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 599–606 (2008)

    Google Scholar 

  8. Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 438–445. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  9. Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. (161), 149–180 (2005)

    Google Scholar 

  10. Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 266–271 (2005), http://jmvidal.cse.sc.edu/library/petcu05a.pdf

  11. Silaghi, M.C., Yokoo, M.: Discussion on the three backjumping schemes existing in adopt-ng. In: Eighth International Workshop on Distributed Constraint Reasoning, in Twentieth International Joint Conference on Artificial Intelligence, pp. 83–97 (2007)

    Google Scholar 

  12. Yeoh, W., Koenig, S., Felner, A.: Idb-adopt: A depth-first search dcop algorithm. In: Eighth International Workshop on Distributed Constraint Reasoning, in Twentieth International Joint Conference on Artificial Intelligence, pp. 56–70 (2007)

    Google Scholar 

  13. Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems (2), 198–212 (2000)

    Google Scholar 

  14. Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. (161), 55–87 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Tokai University, Kanagawa, Japan

    Yasuki Iizuka

  2. School of Network and Information, Senshu University, Kanagawa, Japan

    Kayo Iizuka

Authors
  1. Yasuki Iizuka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kayo Iizuka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Integrated Sensor Systems, University of Kaiserslautern, Erwin-Schroedinger-str. 12, 67663, Kaiserslautern, Germany

    Andreas König

  2. Knowledge-Based Systems Group, Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Andreas Dengel

  3. School of Business, University of Applied Sciences Northwestern Switzerland, Riggenbachstr. 16, 4600, Olten, Switzerland

    Knut Hinkelmann

  4. Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, 599-8531, Osaka, Japan

    Koichi Kise

  5. KES International, P.O. Box 2115, BN43 9AF, Shoreham-by-sea, UK

    Robert J. Howlett

  6. University of South Australia, Adelaide, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iizuka, Y., Iizuka, K. (2011). Exceeding the Efficiency of Distributed Approximate Algorithms Enabling by the Multiplexing Method. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23854-3_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23854-3_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23853-6

  • Online ISBN: 978-3-642-23854-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation