A Bose-Einstein Extremal Optimization method for solving real-world instances of maximum satisfiability

Proceedings of the International Conference on Artificial Intelligence IC-AI 2003

Volumn 1, Issue , 2003, Pages 257-262

  Menai M B ^a   Batouche, M ^b  

^a UNIVERSITY OF TEBESSA   (Algeria)

^b Universite Mentouri Constantine   (Algeria)

Author keywords

Bose Einstein distribution; Extremal optimization; MAXSAT; Stochastic local search

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

BOSE-EINSTEIN EXTREMAL OPTIMIZATION; COMBINATORIAL OPTIMIZATION;

OPTIMIZATION;

EID: 1642385591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. Bak, C. Tang, and K. Wiesenfeld, "Self-organized Criticality: An Explanation of 1/f-noise.", Physical Review Letters, V86 N23. (1987) pp. 5211-5214
2. S. Boettcher and A.G. Percus, "Nature's Way of Optimizing.", Elsevier Science, Artificial Intelligence, 119. (2000) pp. 275-286
3. S. Boettcher and A. G. Percus, "Optimization with Extremal Dynamics.", Physical Review Letters, V86 N23. (2001a) pp. 5211-5214
4. S. Boettcher and A.G. Percus, "Extremal Optimization for Graph Partitioning.", Physical Review E, V64 026114, (2001b) pp. 1-13
5. B. Cha, K. Iwama, Y. Kambayashi and S. Miyazaki, "Local Search Algorithms for Partial MAXSAT.", Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference. (1997) pp. 263-268
6. F. Glover, "Tabu Search: Part I.", ORSA Journal on Computing 1 (3). (1989a) pp. 190-206
7. F. Glover, "Tabu Search: Part II.", ORSA Journal on Computing 2 (1). (1989a) pp. +32
8. P. Hansen and B. Jaumard, "Algorithms for the Maximum Satisfiability Problems.", Computing, 44. (1990) pp. 279-303
9. Y. Jiang, H. A. Kautz and B. Selman, "Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAXSAT.", Proceedings of the 1st International Joint Workshop on Artificial Intelligence and Operational Research.
10. D. Johnson, "Approximation Algorithms for Combinatorial Problems.", Journal of Computer and System Sciences, 9, (1974) pp. 256-278
11. B. Mazure, L. Sais and E. Gregoire, "Tabu Search for SAT.", Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference. (1997) pp. 281-285
12. M.B. Menaï and M. Batouche, "Efficient Initial Solution to Extremal Optimization Algorithm for Weighted MAXSAT Problem.", accepted for presentation at 16th International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems (IEA/AIE-2003) and for publication in LNAI, Springer, Verlag. (2003).
13. M.G.C. Resende, L.S. Pitsoulis and P.M. Pardalos, "Approximate Solution of Weighted MAX-SAT Problems using GRASP.", In Satisfiability Problem: Theory and Applications, Vol. 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1997). (1997) pp. 393-405
14. M.S. Ross, "Introduction to Probability Models.", Academic Press, New York, (2000) pp. 137-141
15. B. Selman and H.A., Kautz, "An Empirical Study of Greedy Local Search for Satisfiability Testing.", Proceedings of the 11th National Conference on Artificial Intelligence. (1993a) pp. 46-51
16. B. Selman and H.A. Kautz, "Domain Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems." Proceedings of the 13th International Joint Conference on Artificial Intelligence. (1993b) pp. 290-295
17. B. Selman, H.A. Kautz and B. Cohen, "Noise Strategies for Improving Local Search.", Proceedings of the 12th National Conference on Artificial Intelligence. (1994) pp. 337-343
18. S. Szedmak, "How to Find More Efficient Initial Solution for Searching?", RUTCOR Research Report, 49-2001, Rutgers Center for Operations Research, Rutgers University. (2001)
19. M. Yagiura and T. Ibaraki, "Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.", Journal of Heuristics, 7. (2001) pp. 423-442