Which Dynamic Constraint Problems Can Be Solved By Ants
作者： Tom Holvoet , Yolande Berbers , Koenraad Mertens
DOI:
关键词:
摘要: There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because the large variety in characteristics DynCSPs and DynCOPs, not all perform equally well on problems. In this paper, we present Dynamic Constraint Optimization Ant Algorithm (DynCOAA). It is based upon ant colony optimization (ACO) meta-heuristic has already proven its merit other We experiments to identify which our algorithm most suited for. turns out class problems, namely heterogeneous change often. find be common real-world applications. For these DynCOAA outperforms both complete non-complete traditional were used for comparison.
参考文章(10)
Paul Morris, The breakout method for escaping from local minima national conference on artificial intelligence. pp. 40- 45 ,(1993)
Rina Dechter, Avi Dechter, Belief maintenance in dynamic constraint networks national conference on artificial intelligence. pp. 37- 42 ,(1988)
Michael Guntsch, Hartmut Schmeck, Martin Middendorf, An Ant Colony Optimization approach to dynamic TSP genetic and evolutionary computation conference. pp. 860- 867 ,(2001)
Koenraad Mertens, Tom Holvoet, CSAA: A Constraint Satisfaction Ant Algorithm Framework Adaptive Computing in Design and Manufacture VI. pp. 285- 294 ,(2004) , 10.1007/978-0-85729-338-1_24
Jano I. van Hemert, Neil B. Urquhart, Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation parallel problem solving from nature. pp. 151- 160 ,(2004) , 10.1007/978-3-540-30217-9_16
Jano I. van Hemert, Christine Solnon, A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems Evolutionary Computation in Combinatorial Optimization. pp. 114- 123 ,(2004) , 10.1007/978-3-540-24652-7_12
B.G.W. Craenen, A.E. Eiben, J.I. van Hemert, Comparing evolutionary algorithms on binary constraint satisfaction problems IEEE Transactions on Evolutionary Computation. ,vol. 7, pp. 424- 444 ,(2003) , 10.1109/TEVC.2003.816584
Roger Mailler, Comparing two approaches to dynamic, distributed constraint satisfaction adaptive agents and multi-agents systems. pp. 1049- 1056 ,(2005) , 10.1145/1082473.1082632
Rina Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition Artificial Intelligence. ,vol. 41, pp. 273- 312 ,(1990) , 10.1016/0004-3702(90)90046-3
Peter Tiňo, John A. Bullinaria, Juan Julián Merelo-Guervós, Xin Yao, Edmund K. Burke, Jonathan E. Rowe, Hans-Paul Schwefel, José A. Lozano, Jim Smith, Ata Kabán, Parallel Problem Solving from Nature - PPSN VIII Springer Berlin Heidelberg. ,(2004) , 10.1007/B100601