Skip to main content

Solving static and dynamic fuzzy constraint networks using evolutionary hill-climbing

  • Issues in Evolutionary Optimization
  • Conference paper
  • First Online:
Evolutionary Programming VI (EP 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1213))

Included in the following conference series:

  • 98 Accesses

Abstract

In this paper we combine the concept of evolutionary hill-climbing search with the systematic search concept of arc revision to form a hybrid system that quickly finds solutions to static and dynamic Fuzzy Constraint Truth Optimization Problems (FCTOPs). We compare the static and dynamic methods for solving FCTOPs using a test suite of an additional 250 randomly generated FCTOPs. In the static method, all the constraints of a FCTOP are known by the hybrid system at runtime. In the dynamic method, only half of the constraints of a FCTOP are known at run-time. Each time our hybrid system discovers a solution that satisfies all of the constraints of the the current network, one additional constraint is added. Results show that our algorithm performs exceptionally well in the presence of dynamic (incremental) constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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).

    Google Scholar 

  2. Benson Jr., Brent W., and Freuder, Eugene C. (1992). Interchangeability Preprocessing Can Improve Forward Checking Search, 10th European Conference on Artificial Intelligence.

    Google Scholar 

  3. Bessiere, C. (1992). Arc-consistency for non-binary dynamic CSPs, Proceedings of the 10th European Conference on Artificial Intelligence, 1992.

    Google Scholar 

  4. Bowen J., and Dozier, G. (1996). Solving Randomly Generated Fuzzy Constraint Networks Using Iterative Microevolutionary Hill-Climbing, Proceedings of the World Automation Congress (WAC'96).

    Google Scholar 

  5. Cheeseman, P., Kanefsky, B. and Taylor, M. (1991). Where the Really Hard Problems Are, Proceedings of the IJCAI-91.

    Google Scholar 

  6. 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

    Google Scholar 

  7. Bowen,J., Lai, R. and Bahler D. (1992). Lexical Imprecision in Fuzzy Constraint Networks, Proc. AAAI-92, 616–621, San Jose, CA.

    Google Scholar 

  8. Corne, D., Ross, P., and Fang, H-L. (1994). Fast Practical Evolutionary Timetabling, Proc. of the AISB Workshop on Evolutionary Computation, Springer-Verlag.

    Google Scholar 

  9. Crawford K. D. (1992), Solving the N-Queens Problem Using Genetic Algorithms, Proc. ACM/SIGAPP Symposium on Applied Computing, Kansas City, MO.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. Fogel, D.B. (1995) A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems, Simulation, Vol. 64:6, pp. 399–406.

    Google Scholar 

  13. Homaifar, A., Turner, J. and Ali, S. (1992). The N-Queens Problem and Genetic Algorithms, Proc. IEEE Southeast Conf., Vol 1.

    Google Scholar 

  14. Mackworth, A. K. (1977). Consistency in Networks of Relations. Artificial Intelligence, 8:98–118, 1977.

    Article  Google Scholar 

  15. Michalewicz, Zbigniew (1994). Genetic Algorithms + Data Structures = Evolution Programs, 2nd Edition, Springer-Verlag Artificial Intelligence Series.

    Google Scholar 

  16. Morris, Paul. (1993). The Breakout Method For Escaping From Local Minima, In Proceedings of AAAI-93.

    Google Scholar 

  17. Zimmermann, H.-J. (1994). Fuzzy Set Theory and Its Applications, 2nd Edition, Kluwer Academic Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter J. Angeline Robert G. Reynolds John R. McDonnell Russ Eberhart

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dozier, G., Bowen, J., Homaifar, A., Esterline, A. (1997). Solving static and dynamic fuzzy constraint networks using evolutionary hill-climbing. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds) Evolutionary Programming VI. EP 1997. Lecture Notes in Computer Science, vol 1213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014811

Download citation

  • DOI: https://doi.org/10.1007/BFb0014811

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62788-3

  • Online ISBN: 978-3-540-68518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics