Skip to main content

Advertisement

Log in

A dual-population search differential evolution algorithm for functional distributed constraint optimization problems

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Functional Distributed Constraint Optimization Problems (F-DCOPs) is a constraint processing framework for continuous variables in multi-agent system modeling. In the past years, researchers have proposed many F-DCOP solving algorithms with excellent performance. Nonetheless, there are some shortcomings in existing F-DCOP solving algorithms, such as the lack of anytime property, the limitation of constraint cost functions, and the inability to guarantee convergence. To deal with these problems, we proposed a Dual-population Search Differential Evolution Algorithm for F-DCOP (DSDE-FD). Firstly, we designed dual-population for local and global search respectively to balance the exploration and exploitation. Secondly, specific mutation operators are designed for local and global population. Finally, adaptive population size is designed to balance computational overhead and search ability. It is proved that the proposed algorithm is an anytime algorithm and has global convergence.The extensive experiments performed based on four types of benchmark problems shown that the proposed algorithm outperforms state-of-the-art F-DCOP solving algorithms.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Allan, R L, Fabrício, E., JeanPaul, A B: Distributed constraint optimization problems: Review and perspectives. Expert Syst. Appl. 41(11), 5139–5157 (2014)

    Article  Google Scholar 

  2. Maheswaran, R., Tambe, M., Bowring, E.: Taking dcop to the real world: Efficient complete solutions for distributed event scheduling. Paper presented at the 3rd International Conference on Autonomous Agents and Multiagent Systems, New York, USA, 310–317 July 2004 (2004)

  3. Ferdinando, F., William, Y., Enrico, P.: A distributed constraint optimization (DCOP) approach to the economic dispatch with demand response. Paper presented at the 16th International Conference on Autonomous Agents and Multiagent Systems, São Paulo, Brazil, 999–1007 May 2017 (2017)

  4. Harel, Y., Roie, Z.: Applying dcop mst to a team of mobile robots with directional sensing abilities. Paper presented at the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 1357–1358 May 2016 (2016)

  5. Pierre, R., Gauthier, P., Fano, R.: Using message-passing DCOP algorithms to solve energy-efficient smart environment configuration problems. Paper presented at the 25th International Joint Conference on Artificial Intelligence, New York, NY, USA, 468–474 July 2016 (2016)

  6. Katsutoshi, H., Makoto, Y.: Distributed partial constraint satisfaction problem. Paper presented at the 3rd International Conference on Principles and Practice of Constraint Programming, Linz, Austria, 222–236 October 1997 (1997)

  7. Pragnesh, J M, WeiMin, S., Milind, T.: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1-2), 149–180 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Adrian, P., Boi, F.: A scalable method for multiagent constraint optimization. Paper presented at the 19th International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, 266–271 July 2005 (2005)

  9. Omer, L., Amnon, M.: Forward Bounding on Pseudo-trees for DCOPs and ADCOPs. Artif. Intell. 252, 83–99 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  10. Weixiong, Z., Guandong, W., Zhao, X.: Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161(1–2), 55–87 (2005)

    MathSciNet  MATH  Google Scholar 

  11. Maheswaran, R., Jonathan, P P, Milind, T.: Distributed algorithms for DCOP: A graphical-game-based approach. Paper presented at the 17th International Conference on Parallel and Distributed Computing Systems, San Francisco, California, USA, 432–439 Aug 2004 (2004)

  12. Md, M K, Long, T T, Nicholas, R J: A generic domain pruning technique for gdl-based DCOP algorithms in cooperative multi-agent systems. Paper presented at the 17th International Conference on Autonomous Agents and Multiagent Systems, Stockholm, Sweden, 1595–1603 July 2018 (2018)

  13. Cornelis, J., Przemyslaw, P.: Cocoa: A non-iterative approach to a local search (A)DCOP solver. Paper presented at the 31st AAAI Conference on Artificial Intelligence, San Francisco, California, USA, 3944–3950 Feb 2017 (2017)

  14. Saaduddin, M., Moumita, C., Md, M K: AED: An anytime evolutionary DCOP algorithm. Paper presented at the 19th International Conference on Autonomous Agents and Multiagent Systems, San Francisco, Auckland, New Zealand, 825–833 May 2020 (2020)

  15. Saaduddin, M., Md, M K, Moumita, C.: Learning optimal temperature region for solving mixed integer functional dcops. Paper presented at the 29th International Joint Conference on Artificial Intelligence, Yokohama, Japan, 268–275 July 2020 (2020)

  16. Ziyu, C., Tengfei, W., Yanchen, D.: An ant-based algorithm to solve distributed constraint optimization problems. Paper presented at the 32st AAAI Conference on Artificial Intelligence, New Orleans, Louisiana, USA, 4654–4661 Feb 2018 (2018)

  17. Ruben, S., Alessandro, F., Alex, R.: Decentralised coordination of continuously valued control parameters using the max-sum algorithm. Paper presented at the 8th International Conference on Autonomous Agents and Multiagent Systems, Budapest, Hungary, 601–608 May 2009 (2009)

  18. Thomas, V., Ruben, S., Alex, R.: A hybrid continuous max-sum algorithm for decentralised coordination. Paper presented at the 19th European Conference on Artificial Intelligence, Lisbon, Portugal, 61–66 Aug 2010 (2010)

  19. Khoi, D H, William, Y., Makoto, Y.: New algorithms for continuous distributed constraint optimization problems. Paper presented at the 19th International Conference on Autonomous Agents and Multiagent Systems, Auckland, New Zealand, 502–510 May 2020 (2020)

  20. Moumita, C., Saaduddin, M., Md, M K: A particle swarm based algorithm for functional distributed constraint optimization problems. Paper presented at the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA, 7111–7118 Feb 2020 (2020)

  21. Amit, S., Moumita, C., Md, M K: A local search based approach to solve continuous dcops. Paper presented at the 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, 1127–1135 May 2021 (2021)

  22. Rainer, S., Kenneth, V P: Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ziyu, C., Lizhen, L., Jingyuan, H.: A genetic algorithm based framework for local search algorithms for distributed constraint optimization problems. Auton. Agent Multi. Agent Syst. 34(2), 1387–2532 (2020)

    Google Scholar 

  24. Ziyu, C., Zhen, H., Chen, H.: An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization. Artif. Intell. 47(3), 607–623 (2007)

    Google Scholar 

  25. Albert, R., Barabasi, A L: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  26. Watts, D J, Strogatz, S.: Collective dynamics of ’small-world’ networks. Nature 393(6684), 440–442 (1998)

    Article  MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by Youth Project of Science and Technology Research Program of Chongqing Education Commission of China (No. KJQN202001139), Chongqing Research Program of Basic Research and Frontier Technology(NO. cstc2018jcyjAX0287), Postgraduate Innovation Project of Chongqing University of Technology (NO. clgycx 20203110) and Scientific Research Foundation of Chongqing University of Technology (NO. 2019ZD03).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Liao.

Ethics declarations

Conflict of Interests

The authors declare that they have no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, M., Liao, X. & Chen, Y. A dual-population search differential evolution algorithm for functional distributed constraint optimization problems. Ann Math Artif Intell 90, 1055–1078 (2022). https://doi.org/10.1007/s10472-022-09805-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-022-09805-2

Keywords