Skip to main content

Advertisement

SpringerLink
Log in

A genetic algorithm based framework for local search algorithms for distributed constraint optimization problems

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

Local search algorithms are widely applied in solving large-scale Distributed constraint optimization problems (DCOPs) where each agent holds a value assignment to its variable and iteratively makes a decision on whether to replace its assignment according to its neighbor states. However, the value assignments of their neighbors confine their search to a small space so that agents in local search algorithms easily fall into local optima. Fortunately, Genetic Algorithms (GAs) can direct a search process to a more promising space and help the search process to break up the confine of local states. Accordingly, we propose a GA-based framework (LSGA) to enhance local search algorithms, where a series of genetic operators are redesigned for agents in distributed scenario to accommodate DCOPs. First, a fitness function is designed to evaluate the assignments for each agent, considering the balance of local benefits and global benefits. Then, a new method is provided to decide crossover positions in terms of agent-communication and topological structure of DCOPs. Besides, a self-adaptive crossover probability and a self-adaptive mutation probability are proposed to control the uses of crossover operator and mutation operator, respectively. And more importantly, the LSGA framework can be easily applied in any local search algorithm. The experimental results demonstrate the superiority of the use of LSGA in the typical search algorithms over state-of-the-art incomplete algorithms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

Notes

  1. https://github.com/czy920/DCOPSovler

References

  1. Pujol-Gonzalez, M. (2011) . Multi-agent coordination: Dcops and beyond. In Proceedings of the twenty-second international joint conference on artificial intelligence (pp. 2838–2839).

  2. Fioretto, F., Pontelli, E., & Yeoh, W. (2018). Distributed constraint optimization problems and applications: A survey. Journal of Artificial Intelligence Research, 61, 623–698.

    Article  MathSciNet  Google Scholar 

  3. Maheswaran, R. T., Tambe, M., Bowring, E., Pearce, J. P., & Varakantham, P. (2004) . Taking dcop to the real world: efficient complete solutions for distributed multi-event scheduling. In Proceedings of the third international joint conference on autonomous agents and multiagent systems, 2004. AAMAS 2004. (pp. 310–317).

  4. Enembreck, F., & Barthés, J.-P. A. (2012). Distributed constraint optimization with mulbs: A case study on collaborative meeting scheduling. Journal of Network and Computer Applications, 35(1), 164–175.

    Article  Google Scholar 

  5. Sultanik, E. A., Modi, P. J., & Regli, W. C. (2007) . On modeling multiagent task scheduling as a distributed constraint optimization problem. In Proceedings of the 20th international joint conference on artifical intelligence, IJCAI’07 (pp. 1531–1536), San Francisco, CA, USA, 2007. Morgan Kaufmann Publishers Inc.

  6. Farinelli, A., Rogers, A., & Jennings, N. R. (2014). Agent-based decentralised coordination for sensor networks using the max-sum algorithm. Autonomous Agents and Multi-Agent Systems, 28, 337–380.

    Article  Google Scholar 

  7. Muldoon, C., Ohare, G. M. P., Ogrady, M. J.,Tynan, R.,& Trigoni, N. (2013). Distributed constraint optimisation for resource limited sensornetworks.Science of Computer Programming, 78:583–593

  8. Miller, S., Ramchurn, S. D., & Rogers, A. (2012) . Optimal decentralised dispatch of embedded generation in the smart grid. In Proceedings of the 11th international conference on autonomous agents and multiagent systems-volume 1, AAMAS ’12 (pp. 281–288), Richland, SC, 2012. International Foundation for Autonomous Agents and Multiagent Systems.

  9. Kumar, A., Faltings, B., & Petcu, A. (2009) . Distributed constraint optimization with structured resource constraints. In Proceedings of the 8th international conference on autonomous agents and multiagent systems-volume 2, AAMAS ’09 (pp. 923–930), Richland, SC, 2009. International Foundation for Autonomous Agents and Multiagent Systems.

  10. Hirayama, K., & Yokoo, M. (1997). Distributed partial constraint satisfaction problem. Journal of Japanese Society for Artificial Intelligence, 14, 636–645.

    Google Scholar 

  11. Gershman, A., Meisels, A., & Zivan, R. (2009). Asynchronous forward bounding for distributed cops. Journal of Artificial Intelligence Research, 34, 61–88.

    Article  MathSciNet  Google Scholar 

  12. Modi, P. J., Shen, W.-M., Tambe, M., & Yokoo, M. (2005). Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1–2), 149–180.

    Article  MathSciNet  Google Scholar 

  13. Silaghi, Marius C., & Yokoo, Makoto. (2006) . Nogood based asynchronous distributed optimization (adopt ng). In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 1389–1396

  14. Silaghi, M. C., & Yokoo, M. (2009). Adopt-ing: Unifying asynchronous distributed optimization withasynchronous backtracking. Autonomous Agents and Multi-Agent Systems, 19, 89–123.

    Article  Google Scholar 

  15. Yeoh, William, Felner, Ariel, & Koenig, Sven . (2008) . Bnb-adopt: An asynchronous branch-and-bound dcop algorithm. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pages 591–598

  16. Petcu, A., & Faltings, B. (2005) . A scalable method for multiagent constraint optimization. In Proceedings of the nineteenth international joint conference on artificial intelligence (pp. 266–271).

  17. Petcu, A., & Faltings, B. (2006) . Odpop: An algorithm for open/distributed constraint optimization. In Proceedings of the 21st national conference on artificial intelligence (pp. 703–708).

  18. Petcu, A., & Faltings, B. (2007) . Mb-dpop: A new memory-bounded algorithm for distributed optimization. In Proceedings of the twentieth international joint conference on artificial intelligence (pp. 1452–1457).

  19. Vinyals, M., Rodriguez-Aguilar, J. A., & Cerquides, J. (2009) . Generalizing dpop: Action-gdl, a new complete algorithm for dcops. In Proceedings of the 8th international conference on autonomous agents and multiagent systems-volume 2 (pp. 1239–1240). International Foundation for Autonomous Agents and Multiagent Systems

  20. Ottens, B., Dimitrakakis, C., & Faltings, B. (2017). Duct: An upper confidence bound approach to distributed constraint optimization problems. ACM Transactions on Intelligent Systems and Technology, 8, 69.

    Article  Google Scholar 

  21. Nguyen, D. T., Yeoh, W., Lau, H. C., & Zivan, R. (2019). Distributed gibbs: A linear-space sampling-based dcop algorithm. Journal of Artificial Intelligence Research, 64, 705–748.

    Article  MathSciNet  Google Scholar 

  22. Farinelli, A., Rogers, A., Petcu, A., & Jennings, N. R. (2008) . Decentralised coordination of low-power embedded devices using the max-sum algorithm. In Proceedings of the 7th international joint conference on autonomous agents and multiagent systems (pp. 639–646).

  23. Rogers, A., Farinelli, A., Stranders, R., & Jennings, N. R. (2011). Bounded approximate decentralised coordination via the max-sum algorithm. Artificial Intelligence, 175, 730–759.

    Article  MathSciNet  Google Scholar 

  24. Rollon, E., & Larrosa, J. (2012) . Improved bounded max-sum for distributed constraint optimization. In Principles and practice of constraint programming (pp. 624–632).

  25. Rollon, E., & Larrosa, J. (2014) . Decomposing utility functions in bounded max-sum for distributed constraint optimization. In Principles and practice of constraint programming (pp. 646–654).

  26. Zivan, R., & Peled, H. (2012) . Max/min-sum distributed constraint optimization through value propagation on an alternating dag. In Proceedings of the 11th International conference on autonomous agents and multiagent systems (pp. 265–272).

  27. Chen, Z., Deng, Y., Tengfei, W., & He, Z. (2018). A class of iterative refined max-sum algorithms via non-consecutive value propagation strategies. Autonomous Agents and Multi-Agent Systems, 32, 822–860.

    Article  Google Scholar 

  28. Zhang, W., Wang, G., Xing, Z., & Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161, 55–87.

    Article  MathSciNet  Google Scholar 

  29. Arshad, M., & Silaghi, M. C. (2004) . Distributed simulated annealing. Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems, 112

  30. Hirayama, K., & Yokoo, M. (2005). The distributed breakout algorithms. Artificial Intelligence, 161, 89–115.

    Article  MathSciNet  Google Scholar 

  31. Okamoto, Steven, Zivan, Roie, & Nahon, Aviv. (2016) . Distributed breakout: Beyond satisfaction. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pages 447–453

  32. Maheswaran, R. T., Pearce, J. P., & Tambe, M. (2006) . A family of graphical-game-based algorithms for distributed constraint optimization problems. In Coordination of large-scale multiagent systems (pp. 127–146).

  33. Vinyals, M., Shieh, E., Cerquides, J., Rodriguez-Aguilar, J. A., Yin, Z., Tambe, M., & Bowring, E. (2011) . Quality guarantees for region optimal dcop algorithms. In Proceedings of the 10th international conference on autonomous agents and multiagent systems (pp. 133–140).

  34. Pearce, J. P., & Tambe, M. (2007) . Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In Proceedings of the twentieth international joint conference on artificial intelligence (pp. 1446–1451).

  35. Leite, A. R., Enembreck, F., & Barthés, J. P. A. (2014) .Distributed constraint optimization problems: Review andperspectives.Expert Systems with Applications, 41, 5139–5157.

  36. Yu, Z., Chen, Z., He, J., & Deng, Y. (2017) . A partial decision scheme for local search algorithms for distributed constraint optimization problems. In Proceedings of the 16th international conference on autonomous agents and multiagent systems (pp. 187–194).

  37. Zivan, R., Okamoto, S., & Peled, H. (2014). Explorative anytime local search for distributed constraint optimization. Artificial Intelligence, 212, 1–26.

    Article  MathSciNet  Google Scholar 

  38. Chen, Z., Wu, T., Deng, Y., & Zhang, C. (2018) . An ant-based algorithm to solve distributed constraint optimization problems. In Proceedings of the thirty-second AAAI conference on artificial intelligence (pp. 4654–4661).

  39. Dozier, G., Cunningham, H., Winard Britt, Y., Wang, C. S., & Zhang, F. (2007). Distributed constraint satisfaction, restricted recombination, and genetic protocols. Applied Soft Computing, 7, 1005–1011.

    Article  Google Scholar 

  40. Zivan, R., & Meisels, A. (2005) . Asymmetric distributed constraints satisfaction problems. In Proceedings of the 11th international conference on principles and practice of constraint programmin (pp. 875–875).

  41. Netzer, A., Grubshtein, A., & Meisels, A. (2012). Concurrent forward bounding for distributed constraint optimization problems. Artificial Intelligence, 193, 186–216.

    Article  MathSciNet  Google Scholar 

  42. Gutierrez, P., & Meseguer, P. (2010) . Saving redundant messages in bnb-adopt. In Proceedings of the 24st national conference on artificial intelligence (pp. 1259–1260).

  43. Lei, K. M. (2013) . Maintaining soft arc consistencies in bnb-adopt+ during search. In Proceedings of the twenty-third international joint conference on artificial intelligence (pp. 3227–3228).

  44. Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., et al. (2012). A survey of monte carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in games, 4(1), 1–43.

    Article  Google Scholar 

  45. Ottens, B., Dimitrakakis, C., & Faltings, B. (2012). Duct: An upper confidence bound approach to distributed constraint optimization problems. In Proceedings of the twenty-sixth aaai conference on artificial intelligence (pp. 528–534).

  46. Nguyen, D. T., Yeoh, W., & Lau, H. C. (2013). Distributed gibbs: A memory-bounded sampling-based dcop algorithm. In Proceedings of the 12th international conference on autonomous agents and multiagent systems (pp. 167–174).

  47. Chen, Z., Deng, Y., & Wu, T. (2017). An iterative refined max-sum\_ad algorithm via single-side value propagation and local search. In Proceedings of the 16th international conference on autonomous agents and multiagent systems (pp. 195–202).

  48. Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on knowledge and data engineering, 10(5), 673–685.

    Article  Google Scholar 

  49. Eiben, A. E., Raué, P.-E., & Ruttkay, Z. (1994) . Solving constraint satisfaction problems using genetic algorithms. In Proceedings of the first IEEE conference on evolutionary computation. IEEE World congress on computational intelligence (pp. 542–547). IEEE

  50. Kanoh, H., Hasegawa, K., Matsumoto, M., Nishihara, S., & Kato, N. (1996) . Solving constraint satisfaction problems by a genetic algorithm adopting viral infection. In Proceedings IEEE international joint symposia on intelligence and systems (pp. 67–73).

  51. Handa, H., Katai, O., Konishi, T, & Baba, M. (2000). A new fitness function for discovering a lot of satisfiable solutions in constraint satisfaction problems. In Proceedings of the 2000 congress on evolutionary computation. CEC00 (Cat. No. 00TH8512) (Vol. 2, pp. 1184–1189). IEEE

  52. Homaifar, A., Qi, C. X., & Lai, S. H. (1994). Constrained optimization via genetic algorithms. Simulation, 62(4), 242–253.

    Article  Google Scholar 

  53. Chuang, Y.-C., Chen, C.-T., & Hwang, C. (2016). A simple and efficient real-coded genetic algorithm for constrained optimization. Applied Soft Computing, 38, 87–105.

    Article  Google Scholar 

  54. Dadios, E. P., & Ashraf, J. (2006). Genetic algorithm with adaptive and dynamic penalty functions for the selection of cleaner production measures: a constrained optimization problem. Clean Technologies and Environmental Policy, 8(2), 85–95.

    Article  Google Scholar 

  55. Grinshpoun, T. (2015) . Clustering variables by their agents. In 2015 IEEE/WIC/ACM international conference on web intelligence and intelligent agent technology (WI-IAT) (Vol. 2, pp. 250–256). IEEE

  56. Fioretto, F., Yeoh, W, & Pontelli, E. (2016). Multi-variable agents decomposition for dcops. In Thirtieth AAAI conference on artificial intelligence

  57. Davin, J., & Modi, P. (2006). Hierarchical variable ordering for multiagent agreement problems. In Proceedings of AAMAS (pp. 1433–1435).

  58. Portway, C., & Durfee, E. H . (2010) . The multi variable multi constrained distributed constraint optimization framework. In Proceedings of the 9th international conference on autonomous agents and multiagent systems: volume 1-Volume 1 (pp. 1385–1386). International Foundation for Autonomous Agents and Multiagent Systems

  59. Holland, J. H. (1992). Adaptation in natural and artificial systems: An Introductory analysis with applications to biology, control, and artificial intelligence. MIT press

  60. Antony, K., Raj, A. D., & Rajendran, C. (2012). A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Computers and Operations Research, 39(9), 2016–2032.

    Article  Google Scholar 

  61. Michalewicz, Z., Janikow, C. Z., & Krawczyk, J. B. (1992). A modified genetic algorithm for optimal control problems. Computers and Mathematics with Applications, 23(12), 83–94.

    Article  Google Scholar 

  62. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc

  63. Barabási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509–512.

    Article  MathSciNet  Google Scholar 

  64. Zivan, R., Parash, T., Cohen, L., Peled, H., & Okamoto, S. (2017). Balancing exploration and exploitation in incomplete min/max-sum inference for distributed constraint optimization. Autonomous Agents and Multi-Agent Systems, 31, 1165–1207.

    Article  Google Scholar 

  65. Cohen, L., Galiki, R., & Zivan, R. (2020). Governing convergence of max-sum on dcops through damping and splitting. Artificial Intelligence, 279, 103212.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research is funded by Chongqing Research Program of Basic Research and Frontier Technology (No. cstc2017jcyjAX0030) and Fundamental Research Funds for the Central Universities (No. 2018CDXYJSJ0026).

Author information

Authors and Affiliations

  1. College of Computer Science, Chongqing University, Chongqing, China

    Ziyu Chen, Lizhen Liu, Jingyuan He & Zhepeng Yu

Authors
  1. Ziyu Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lizhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jingyuan He
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhepeng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Ziyu Chen or Lizhen Liu.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Z., Liu, L., He, J. et al. A genetic algorithm based framework for local search algorithms for distributed constraint optimization problems. Auton Agent Multi-Agent Syst 34, 41 (2020). https://doi.org/10.1007/s10458-020-09464-9

Download citation

  • Published:

  • DOI: https://doi.org/10.1007/s10458-020-09464-9

Keywords

Search

Navigation