A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems
From MaRDI portal
Publication:1701558
DOI10.1007/s00500-015-1815-1zbMath1381.68282OpenAlexW2102449465MaRDI QIDQ1701558
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1815-1
constraint satisfaction problemdirect and indirect combined representationdirect representationindirect representationmultiagent evolutionary algorithm
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An agent-based model of hierarchic genetic search
- Comments on Mohr and Henderson's path consistency algorithm
- Cellular genetic algorithms
- An optimal k-consistency algorithm
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Consistency in networks of relations
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
- Multi-agent oriented constraint satisfaction