Skip to main content

Soft selection in D-optimal designs

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN III (PPSN 1994)

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

Included in the following conference series:

  • 171 Accesses

Abstract

A new algorithm generating the D-optimal experimental designs, based on an evolutionary search with soft selection, is presented. An efficiency of the numerical algorithm is compared with classical exchange algorithms. Preliminary results are promising and encourage more detailed investigations.

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.

Similar content being viewed by others

References

  1. R. Cook, C. Nachtsheim: A comparison of algorithms for constructing exact Doptimal designs. Technometrics 22, No. 3, pp.315–324 (1980)

    Google Scholar 

  2. Y. Dodge, V. Fedorov, H. Wynn: Optimal design of experiments: an overview. In: Y. Dodge, V.V. Fedorov, H.P. Wynn (eds.): Optimal design and analysis of experiments. Elsevier Science Publishers B.V., North-Holland (1988)

    Google Scholar 

  3. M. Eigen: Self-organization of matter and the evolution of biological macro-molecules. Naturwissenschaften 58, pp. 465–523 (1971)

    PubMed  Google Scholar 

  4. V. Fedorov: Theory of optimal experiments. Preprint No. 7, Publ. Moscow State University, Moscow (1969)

    Google Scholar 

  5. L.J. Fogel: Autonomous automata. Industrial Research 4, pp. 14–19 (1962)

    Google Scholar 

  6. R. Galar: Handicapped individua in evolutionary processes. Biol. Cybern. 51, pp.1–9 (1985)

    Article  Google Scholar 

  7. R. Galar: Evolutionary search with soft selection. Biol. Cybern. 60, pp.357–364 (1989)

    Article  Google Scholar 

  8. Z. Galil, J. Kiefer: Time-and space-saving computer methods, related to Mitchell's DETMAX, for finding D-optimum designs. Technometrics 22, No. 3, pp. 301–313 (1980)

    Google Scholar 

  9. J. Holland: Adaptation in natural and artificial systems. Ann Arbor, Univ. of Michigan Press (1975)

    Google Scholar 

  10. M.E. Johnson, C.J. Nachtsheim: Some guidelines for constructing exact D-optimal design on convex design space. Technometrics 25, No. 3, pp. 271–277 (1983)

    Google Scholar 

  11. S. Kirkpatrick, C.D. Gellat, M.P. Vecchi: Optimization by simulated annealing. Science 220, No. 4598, pp.671–680 (1983)

    Google Scholar 

  12. T.J. Mitchell: Algorithm for the construction ”D-optimal” experimental designs. Technometrics 16, No. 2, pp.203 (1974)

    Google Scholar 

  13. D. Van Schalkwyk: On the design of mixture experiments. Ph.D. thesis, Univ. of London. (1971)

    Google Scholar 

  14. H. Wynn: Results in the theory and construction of D-optimum Experimental Designs. J. Roy. Statist. Soc., B-34, pp. 133–14 (1972)

    Google Scholar 

  15. W.J. Welch: Branch-and-bound search for experimental designs based on D optimality and other criteria. Technometrics 24, No. 1, pp. 41–48 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yuval Davidor Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karcz-Duleba, I. (1994). Soft selection in D-optimal designs. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_303

Download citation

  • DOI: https://doi.org/10.1007/3-540-58484-6_303

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58484-1

  • Online ISBN: 978-3-540-49001-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics