Abstract
The evolutionary algorithms (EAs) became more and more important in solving NP-hard problems in recent years. The representation of specific problems in EAs is very important and it has a great influence on the performance of EAs. The constraint satisfaction problems (CSPs) are typical NP-hard problems and the representation of CSPs can be traditionally divided into two types, namely the direct and indirect representations. The variables in direct representation represent the actual values that they can take, and can be evaluated directly. Whereas in indirect representation, a specific permutation is assigned to variables, and the individual is incapable of being evaluated without a decoder. In order to take advantage of both representations to enforce the ability of EAs in solving CSPs, we propose a combination of these two representations in this article. The minimum conflict decoder is employed to transform indirect representation to direct representation and several new behaviors are designed for agents in multiagent evolutionary algorithms. In experiments, 250 benchmark binary CSPs and 79 graph coloring problems are tested. The comparisons among the direct, indirect and the combined representation methods are conducted. Experimental results illustrate that the method of combined representation outperforms the two other methods.
Access this article
Rent this article via DeepDyve
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Alba E, Dorronsoro B (2005) The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans Evol Comput 9:126–142
Alba E, Dorronsoro B (2009) Cellular genetic algorithms. Springer, New York
Bruynooghe M (2004) Enhancing a search algorithm to perform intelligent backtracking. Artif Intell 4(3):371–380
Byrski A, Kisiel-Dorohinicki M (2014) Memetic computing in selected agent-based evolutionary systems. In: Process of the 28th European conference on modelling and simulation. EUROSIS, Brescia, pp 27–30
Byrski A, Dreżewski R, Siwik L, Kisiel-Dorohinicki M (2015) Evolutionary multi-agent systems. Knowl Eng Rev 30(02):171–186
Cavicchio DJ (1970) Adaptive search using simulated evolution. University of Michigan
Cooper MC (1989) An optimal k-consistency algorithm. Artif Intell 41(1):89–95
Craenen BGW, Eiben AE, Marchiori E (2000) Solving constraint satisfaction problems with heuristic-based evolutionary algorithms. In: Proceedings of IEEE congress on evolutionary computation, pp 1571–1577
Craenen BGW, Eiben AE (2001) Stepwise adaption of weights with refinement and decay on constraint satisfaction problems. In: Proceedings of the genetic and evolutionary computation conference GECCO 2001. GECCO, San Francisco, pp 291–298
Craenen BGW, Eiben AE, van Hemert JI (2003) Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Trans Evol Comput 7:424–444
Craenen BGW, Eiben AE (2005) Hybrid evolutionary algorithms for constraint satisfaction problems: Memetic overkill? In: The 2005 IEEE congress on evolutionary computation. IEEE, pp 1922–1928
Dib M, Rouwaida A, Alexandre C (2010) Arc-consistency in constraint satisfaction problems: a survey. In: 2010 second international conference on computational intelligence, modelling and simulation (CIMSiM). IEEE, Bali, pp 291–296
Dozier G, James B, Dennis B (1994) Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence. IEEE, Orlando, pp 306–311
Dozier G, James B, Abdollah H (1998) Solving constraint satisfaction problems using hybrid evolutionary search. IEEE Trans Evol Comput 2(1):23–33
Eiben AE, Raué PE, 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. IEEE, Orlando, pp 542–547
Eiben AE, Raué P-E, Ruttkay Z (1995) GA-easy and GA-hard constraint satisfaction problems. Constraint processing. Springer, Berlin, pp 267–283
Eiben AE, Ruttkay Z (1996) Self-adaptivity for constraint satisfaction: Learning penalty functions. In: Proceedings of IEEE international conference on evolutionary computation. IEEE, Nagoya, pp 258–261
Eiben AE, Van Hemert JI (1999) SAW-ing EAs: adapting the fitness function for solving constrained problems. In: New idears in optimization. McGrawHill, New York pp 389–402
Eiben AE (2001) Evolutionary algorithms and constraint satisfaction: definitions, survey, methodology, and research directions. Theoretical aspects of evolutionary computing. Springer, Berlin, pp 13–30
Ferber J (1999) Multi-Agent Systems: an Introduction to Distributed Artificial Intelligence. Addison-Wesley, Boston
Folino G, Pizzuti C, Spezzano G (2001) Parallel hybrid method for SAT that couples genetic algorithms and local search. IEEE Trans Evol Comput 5(4):323–334
Gu J (1992) Efficient local search for very large-scale satisfiability problems. ACM SIGART Bull 3(1):8–12
Han CC, Lee CH (1988) Comments on Mohr and Henderson’s path consistency algorithm. Artif Intell 36(1):125–130
Jennings NR, Katia S, Michael W (1998) A roadmap of agent research and development. Auton Agents Multi-agent Syst 1:7–38
Krzywicki D, Byrski A, Kisiel-Dorohinicki M (2014) Computing agents for decision support systems. Future Gener Comput Syst 37:390–400
Kumar V (1992) Algorithms for constraint-satisfaction problems: a survey. AI Mag 13(1):32–44
Liu C, Liu J, Jiang Z (2014) A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks. IEEE Trans Cybern 44(12):2274–2287
Liu J, Tang YY, Cao YC (1997) An evolutionary autonomous agents approach to image feature extraction. IEEE Trans Evol Comput 1:141–158
Liu J (2001) Autonomous agents and multi-agent systems: explorations in learning, self-organization, and adaptive computation. World Scientific, Singapore
Liu J, Han J, Tang YY (2002) Multi-agent oriented constraint satisfaction. Artif Intell 136:101–144
Liu J, Zhong W, Jiao L (2006) A multiagent evolutionary algorithm for constraint satisfaction problems. IEEE Trans Syst Man Cybern B Cybern 36(1):54–73
Liu J, Zhong W, Jiao L (2010a) A multiagent evolutionary algorithm for combinatorial optimization problems. IEEE Trans Syst Man Cybern B Cybern 40(1):229–240
Liu X, Tang K, Buhrman JR, Cheng H (2010b) An agent-based framework for collaborative data mining optimization. In: 2010 international symposium on collaborative technologies and systems (CTS). IEEE, Chicago, pp 295–301
Mackworth AK (1977) Consistency in networks of relations. Artif intell 8(1):99–118
Marchiori E (1997) combining constrain processing and genetic algorithms for constraint satisfaction problems. In: Proceedings of the 7th international conference on genetic algorithms. East lansing, pp 330–337
Marchiori E, Steenbeek A (2000) A genetic local search algorithm for random binary constraint satisfaction problems. In: Proceedings of the 2000 ACM symposium on applied computing—volume 1. ACM, New York, pp 458–462
Minton S, Johnston MD, Philips AB (1990) Solving large-scale constraint-satisfaction and scheduling problems using a heuristic repair method. AAAI 90:17–24
Minton S, Johnston MD, Philips AB, Laird P (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif Intell 58(1):161–205
Mohr R, Thomas CH (1986) Arc and path consistency revisited. Artif Intell 28(2):225–233
Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, technical report, 826, California Institute of Technology, Pasadena, California
Mussawar O, Al-Wahedi K (2013) Meeting scheduling using agent based modeling and multiagent decision making. In: 2013 third international conference on innovative computing technology (INTECH). IEEE, London, pp 252–257
Nakashima T, Ariyama T, Yoshida T, Ishibuchi H (2003) Performance evaluation of combined cellular genetic algorithms for function optimization problems. In: Proceedings of the 2003 IEEE international symposium on computational intelligence in robotics and automation, 2003, vol 1, pp 295–299
Rossi E, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, New York
Schaefer R, Byrski A, Kołodziej J, Smołka M (2012) An agent-based model of hierarchic genetic search. Comput Math Appl 64(12):3763–3776
Stallman RM, Gerald JS (1977) Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artif Intell 9(2):135–196
Tsang E (1993) Foundations of constraint satisfaction. Academic Press, London
Turky AM, Ahmad A,(2010) Using genetic algorithm for solving n-queens problem. In: 2010 international symposium in information technology (ITSim). IEEE, Kuala Lumpur, pp 745–747
Ullah ASSMB, Sarker R, Cornforth D, Lokan C (2009) AMA: a new approach for solving constrained real-valued optimization problems. Soft Comput 13(8–9):741–762
Wallace RJ (1996) Analysis of heuristic methods for partial constraint satisfaction problems. Principles and practice of constraint programming—CP96. Springer, Berlin, pp 486–496
Weiss G (1999) Multiagent systems: a modern approach to distributed artificial intelligence. MIT Press, Cambridge
Whitley LD (1993) Cellular genetic algorithms. In: Proceedings of the 5th international conference on genetic algorithms. Morgan Kaufmann, San Francisco
Zhong W, Liu J, Xue M, Jiao L (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Trans Syst Man Cybern B Cybern 34(2):1128–1141
Acknowledgments
This work is partially supported by the National Natural Science Foundation of China under Grant 61271301, the Research Fund for the Doctoral Program of Higher Education of China under Grant 20130203110010, and the Fundamental Research Funds for the Central Universities under Grant K5051202052.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Hao, X., Liu, J. A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems. Soft Comput 21, 781–793 (2017). https://doi.org/10.1007/s00500-015-1815-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1815-1