Search space reduction technique for constrained optimization with tiny feasible space
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Multiagent Evolutionary Algorithm for T-coloring Problem
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A multiagent evolutionary algorithm for combinatorial optimization problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An evolutionary agent system for mathematical programming
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
Knowledge-Based Systems
Multi-objective job shop scheduling based on multiagent evolutionary algorithm
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Multiagent based differential evolution approach to optimal power flow
Applied Soft Computing
Knowledge-Inducing interactive genetic algorithms based on multi-agent
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Immune clonal MO algorithm for ZDT problems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Immune clonal strategies based on three mutation methods
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Multi-Agent immune clonal selection algorithm based multicast routing
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
The coarse-grained computing p2p algorithm based on SPKI
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
An immune clonal selection scheduling algorithm for input-queued switches
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Constrained layout optimization in satellite cabin using a multiagent genetic algorithm
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Minimum Span Frequency Assignment Based on a Multiagent Evolutionary Algorithm
International Journal of Swarm Intelligence Research
A multi-agent genetic algorithm for resource constrained project scheduling problems
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
With the intrinsic properties of constraint satisfaction problems (CSPs) in mind, we divide CSPs into two types, namely, permutation CSPs and nonpermutation CSPs. According to their characteristics, several behaviors are designed for agents by making use of the ability of agents to sense and act on the environment. These behaviors are controlled by means of evolution, so that the multiagent evolutionary algorithm for constraint satisfaction problems (MAEA-CSPs) results. To overcome the disadvantages of the general encoding methods, the minimum conflict encoding is also proposed. Theoretical analyzes show that MAEA-CSPs has a linear space complexity and converges to the global optimum. The first part of the experiments uses 250 benchmark binary CSPs and 79 graph coloring problems from the DIMACS challenge to test the performance of MAEA-CSPs for nonpermutation CSPs. MAEA-CSPs is compared with six well-defined algorithms and the effect of the parameters is analyzed systematically. The second part of the experiments uses a classical CSP, n-queen problems, and a more practical case, job-shop scheduling problems (JSPs), to test the performance of MAEA-CSPs for permutation CSPs. The scalability of MAEA-CSPs along n for n-queen problems is studied with great care. The results show that MAEA-CSPs achieves good performance when n increases from 104 to 107, and has a linear time complexity. Even for 107-queen problems, MAEA-CSPs finds the solutions by only 150 seconds. For JSPs, 59 benchmark problems are used, and good performance is also obtained.