skip to main content
10.1145/2817460.2817495acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
research-article
Free access

Fuzzzy constraint network topology and evolutionary hill-climbing

Published: 02 April 1997 Publication History

Abstract

This paper introduces an evolutionary/systematic hybrid which combines the concept of evolutionary hill-climbing search with the systematic search concept of arc revision to form a hybrid that quickly find solutions to Fuzzy Constraint Satisfaction Problems (FCSPs). The performance of this hybrid on 250 randomly generated FCSPs in which the fuzzy constraints are evenly distributed amongst the variables of the FCSP is compared with its performance on 250 randomly generated FCSPs where the fuzzy constraints are unevenly distributed. The results provide some interesting insights in the role that Fuzzy Constraint Network Topology has on Evolutionary Search.

References

[1]
Ackley, David H. (1987). An Empirical Study of Bit Vector Function Optimization, in: Lawrence Davis (ed.), Genetic Algorithms and Simulated Annealing. (Morgan Kaufman Publishers, Inc., Los Altos, California).
[2]
Benson Jr. Brent W., and Freuder, Eugene C. (1992). Interchangeability Preprocessing Can Improve Forward Checking Search, 10th European Conference on Artificial Intelligence.
[3]
Bowen J., and Dozier, G. (1996). Solving Randomly Generated Fuzzy Constraint Networks Using Evolutionary/Systematic Hill-Climbing, 5th IEEE International Conference on Fuzzy Systems pp. 226--231.
[4]
Bowen J., and Dozier, G. (1996). Solving Randomly Generated Fuzzy Constraint Networks Using Iterative Microevolutionary Hill-Climbing. To appear in: The 1st International Symposium of Soft Computing for Industry -- ISSCI '96.
[5]
Bowen J., and Dozier, G. (1995). Solving Constraint Satisfaction Problems Using A Genetic/Systematic Search Hybrid That Realizes When to Quit, Proc. of the 6th Intl. Conf. on Genetic Algorithms, ICGA-95
[6]
Bowen, J., Lai, R. and Bahler D. (1992). Lexical Imprecision in Fuzzy Constraint Networks, Proc. AAAI-92, 616--621, San Jose, CA.
[7]
Corne, D., Ross, P., and Fang, H-L. (1994). Fast Practical Evolutionary Timetabling, Proc. of the AISB Workshop on Evolutionary Computation, Springer-Verlag.
[8]
Crawford K. D. (1992), Solving the N-Queens Problem Using Genetic Algorithms, Proc. ACM/SIGAPP Symposium on Applied Computing, Kansas City, MO.
[9]
Dozier, G., Bowen J., and Bahler D. (1994). Solving Small and Large Scale Constraint Satisfaction Problems Using a Heuristic-Based Microgenetic Algorithm, Proceedings of the 1994 IEEE International Conference on Evolutionary Computation.
[10]
Eiben, A. E., Raue P-E. and Ruttkay, Zs. (1994). Solving Constraint Satisfaction Problems Using Genetic Algorithms, Proceedings of the 1994 IEEE International Conference on Evolutionary Computation.
[11]
Fogel, David B. (1994). A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems, Proceedings of the 4th Annual Conference on Evolutionary Programming.
[12]
Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning (Addison-Wesley Publishing Company).
[13]
Homaifar, A., Turner, J. and Ali, S. (1992). The N-Queens Problem and Genetic Algorithms, Proc. IEEE Southeast Conf., Vol 1.
[14]
Mackworth, A. K. (1977). Consistency in Networks of Relations. Artificial Intelligence, 8:98--118, 1977.
[15]
Michalewicz, Zbigniew (1992). Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag Artificial Intelligence Series.
[16]
Morris, Paul. (1993). The Breakout Method For Escaping From Local Minima, In Proceedings of AAAI-93.
[17]
Ryan C. (1994). Pygmies and Civil Servants, In Advances in Genetic Programming, K. Kinnear Jr., Ed. MIT Press.
[18]
Spears, W. M. (1994). Simple Subpopulation Schemes, Proceedings of the 3rd Ann Conf on Evolutionary Programming.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ACMSE '97: Proceedings of the 35th annual ACM Southeast Conference
April 1997
314 pages
ISBN:0897919254
DOI:10.1145/2817460
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 April 1997

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ACMSE '97
April 2 - 4, 1997
Tennessee, Murfreesboro

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 60
    Total Downloads
  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)14
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media