Skip to main content

Factor Analytic Studies of CSP Heuristics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3709))

Abstract

Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying variables. In this study factor analysis was used to determine if variation in search efficiency due to different variable ordering heuristics could be analyzed by this method to reveal basic sources of variation. It was found that the variation could be ascribed to two major factors, which appear to be related to contention (immediate failure) and to forward propagation (future failure). This was most clearcut with homogeneous random problems, but similar factor patterns were demonstrated for problems with small-world characteristics. Heuristics can be classified in terms of whether they tend to support one or the other strategy, or whether they balance the two; these differences are reflected in the pattern of loadings on the two major factors. Moreover, improvements in efficiency can be obtained by heuristic combinations (“heuristic synergy”) only if the combination includes heuristics that are highly correlated with each factor; therefore, two such heuristics are sufficient. This work represents a step toward understanding the action of heuristics as well as suggesting limits to heuristic performance.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W.R.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1, 9–32 (1995)

    Article  MATH  Google Scholar 

  2. Harman, H.H.: Modern Factor Analysis, 2nd edn. University of Chicago, Chicago and London (1967)

    MATH  Google Scholar 

  3. Lawley, D.N., Maxwell, A.E.: Factor Analysis as a Statistical Method, 2nd edn. Butterworths, London (1971)

    MATH  Google Scholar 

  4. McNemar, Q.: Psychological Statistics, 4th edn. John Wiley, New York (1969)

    Google Scholar 

  5. Cooley, W.W., Lohnes, P.R.: Multivariate Data Analysis. John Wiley, New York (1971)

    MATH  Google Scholar 

  6. Smith, B.M., Grant, S.A.: Trying harder to fail first. In: Proc. Thirteenth European Conference on Artificial Intelligence-ECAI 1998, pp. 249–253. John Wiley & Sons, Chichester (1998)

    Google Scholar 

  7. Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proc. Tenth European Conference on Artificial Intelligence-ECAI 1992, pp. 31–35 (1992)

    Google Scholar 

  8. Epstein, S.L., Freuder, E.C., Wallace, R., Morozov, A., Samuels, B.: The adaptive constraint engine. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 525–540. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 41–55. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Beck, J.C., Prosser, P., Wallace, R.J.: Variable ordering heuristics show promise. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 711–715. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 179–193. Springer, Heidelberg (1996)

    Google Scholar 

  12. Bessière, C., Chmeiss, A., Saïs, L.: Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 565–569. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Boussemart, F., Hemery, F., Lecoutre, C., Saïs, L.: Boosting systematic search by weighting constraints. In: Proc. Sixteenth European Conference on Artificial Intelligence-ECAI 2004, pp. 146–150 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wallace, R.J. (2005). Factor Analytic Studies of CSP Heuristics. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_52

Download citation

  • DOI: https://doi.org/10.1007/11564751_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics