Ant colony optimization and its application to regular and dynamic MAX-SAT problems

Studies in Computational Intelligence

Volumn 69, Issue , 2007, Pages 283-302

  Pinto, Pedro C ^a   Runkler, Thomas A ^b   Sousa, João M C ^a  

^a UNIVERSITY OF LISBON   (Portugal)

^b SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34447327843     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-72693-7_15     Document Type: Article

References (40)

1. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press (2004)
2. Garey, M.R., Johson, D.S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman Publishers (1979)
3. Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. MIC'2001 - Metaheuristics International Conference, Porto, Portugal (2001) 187-192
4. Kennedy, J., Eberhart, R.: Swarm intelligence. Morgan Kaufmann Publishers (2001)
5. Osman, I., Laporte, G.: Metaheuristics: A bibliography. Annals of Operations Research (63) (1996) 513-628,
6. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Compututational Survey 35 3) (2003) 268-308
7. Aarts, E.H.L., Korst, J.H.M., Laarhoven, P.J.M.V.: Simulated annealing. In: Local Search in Combinatorial Optimization. Wiley-Interscience Eds, Chichester, England (1997) 91-120
8. Glover, F., Laguna, M.: Tabu search. (1993) 70-150
9. Ramalhinho-Lourenço, H., Martin, O.C., Stützle, T.: Iterated local search. (513) (2000)
10. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
11. Cicirello, V.A., Smith, S.F.: Wasp-like agents for distributed factory coordination. Autonomous Agents and Multi-agent systems 8 (2004) 237-266
12. Pinto, P., Runkler, T.A., Sousa, J.M.C.: Agent based optimization of the MAX-SAT problem using wasp swarms. Controlo 2006, 7th Portuguese Conference on Automatic Control (2006)
13. Pinto, P., Runkler, T.A., Sousa, J.M.C.: Wasp swarm algorithm for dynamic MAX-SAT problems. ICANNGA 2007, 8th International Conference on Adaptive and Natural Computing Algorithms (2007)
14. Abbass, H.: An agent based approach to 3-SAT using marriage in honey-bees optimization. International Journal of Knowledge-Based Intelligent Engineering Systems (2002) 1-8
15. Grasse., P.P.: La reconstruction du nid et les coordinations inter-individuelles chez bellicositermes natalensis et cubitermes sp. la theorie de la stigmergie: Essai d'interpretation du comportement des termites constructeurs. Insectes Sociaux 6 (1959) 41-81
16. Pimont, S., Solnon, C.: A generic ant algorithm for solving constraint satisfaction problems. 2nd International Workshop on Ant Algorithms (ANTS 2000), Brussels, Belgium (2000) 100-108
17. Cicirello, V.A., Smith, S.F.: Ant colony for autonomous decentralized shop floor routing. In: Proceedings of ISADS-2001, Fifth International symposium on autonomous decentralized systems. (2001)
18. Silva, C.A., Runkler, T.A., Sousa, J.M.C., da Costa, J.M.S.: Optimization of logistic processes in supply-chains using meta-heuristics. In Pires, F.M., Abreu, S., eds.: Lecture Notes on Artificial Intelligence 2902, Progress in Artificial Intelligence, 11th Portuguese Conference on Artificial Intelligence. Springer Verlag, Beja, Portugal (2003) 9-23
19. Silva, C.A., Runkler, T.A., Sousa, J.M.C., Palm, R.: Ant colonies as logistic process optimizers. In Dorigo, M., Caro, G.D., Sampels, M., eds.: Ant Algorithms, International Workshop ANTS 2002, Brussels, Belgium. Lecture Notes in Computer Science LNCS 2463, Heidelberg, Springer (2002) 76-87
20. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2007)
21. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
22. Gennari, R.: Temporal reasoning and constraint programming: A survey (1998)
23. Frei, C., Faltings, B.: Resource allocation and constraint satisfaction techniques. In: CP '99: Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, London, UK, Springer-Verlag (1999) 204-218
24. Cesta, A., Cortellessa, G., Oddi, A., Policella, N., Susi, A.: A constraint-based architecture for flexible support to activity scheduling. In: AI*IA 01: Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence, London, UK, Springer-Verlag (2001) 369-381
25. Abril, M., Salido, M.A., Barber, F., Ingolotti, L.: Distributed constraint satisfaction problems to model railway scheduling problems. ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, Cumbria (England) (2006)
26. Rasconi, R., Policella, N., Cesta, A.: Fix the schedule or solve again - comparing constraint-based approaches to schedule execution. In: Proceedings of the ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. (2006)
27. Goodrich, M.T., Tamassia, R.: Algorithm Design - Foundations, Analysis, and Internet Examples. John Wiley & Sons, Inc. (2001)
28. Zhang, W.: Phase transitions and backbones of 3-SAT and maximum 3-SAT. In: Principles and Practice of Constraint Programming. (2001) 153-167
29. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, Sidney, Australia. (1991) 331-337
30. Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: 10-th National Conf. on Artificial Intelligence (AAAI-92), San Jose, CA (1992) 459-465
31. Mertens, K., Holvoet, T., Berbers, Y.: The dynCOAA algorithm for dynamic constraint optimization problems. In Weiss, G., Stone, Peter, e., eds.: Proceedings of the Fifth International Joint Conference on Autonomous Agents and MultiAgent Systems. (2006) 1421-1423
32. Mertens, K., Holvoet, T., Berbers, Y.: Which dynamic constraint problems can be solved by ants. In Sutcliffe, G., Goebel, Randy, E., eds.: Proceedings of The 19th International FLAIRS Conference. (2006) 439-444
33. Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: AAMAS '05: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, New York, NY, USA, ACM Press (2005) 1049-1056
34. Hoos, H.H., O'Neill, K.: Stochastic local search methods for dynamic SAT - an initial investigation. AAAI-2000 Workshop "Leveraging Probability and Uncertainty in Computation", Austin, Texas (2000) 22-26
35. Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6 (2002) 347-357
36. Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics 2 (1997)
37. Johnson, D., Trick, M.: Cliques, coloring, and satisfiability: Second DIMACS implementation challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996)
38. Hoos, H.H., Stützle, T.: SATLIB: An online resource for research on SAT. SAT 2000 (2000) 283-292
39. Hoos, H.H., Stützle, T.:ALocal search algorithms for SAT: an empirical evaluation. Journal of Automated Reasoning, special Issue "SAT 2000" (1999) 421-481
40. Smyth, K., Hoos, H.H., St_dustzle, T.: Iterated robust tabu search for MAX-SAT. Lecture Notes in Computer Science, Springer Verlag 44 (2003) 279-303