IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/f556d9e2-e3b9-42db-96ee-94d31c3ba7d6.html
   My bibliography  Save this paper

Bounds for maximin Latin hypercube designs

Author

Listed:
  • van Dam, E.R.

    (Tilburg University, School of Economics and Management)

  • Rennen, G.

    (Tilburg University, School of Economics and Management)

  • Husslage, B.G.M.

    (Tilburg University, School of Economics and Management)

Abstract

Latin hypercube designs (LHDs) play an important role when approximating computer simulation models. To obtain good space-filling properties, the maximin criterion is frequently used. Unfortunately, constructing maximin LHDs can be quite time consuming when the number of dimensions and design points increase. In these cases, we can use heuristical maximin LHDs. In this paper, we construct bounds for the separation distance of certain classes of maximin LHDs. These bounds are useful for assessing the quality of heuristical maximin LHDs. Until now only upper bounds are known for the separation distance of certain classes of unrestricted maximin designs, i.e., for maximin designs without a Latin hypercube structure. The separation distance of maximin LHDs also satisfies these “unrestricted” bounds. By using some of the special properties of LHDs, we are able to find new and tighter bounds for maximin LHDs. Within the different methods used to determine the upper bounds, a variety of combinatorial optimization techniques are employed. Mixed-integer programming, the traveling salesman problem, and the graph-covering problem are among the formulations used to obtain the bounds. Besides these bounds, also a construction method is described for generating LHDs that meet Baer's bound for the (l-script) (infinity) distance measure for certain values of n .
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2009. "Bounds for maximin Latin hypercube designs," Other publications TiSEM f556d9e2-e3b9-42db-96ee-9, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:f556d9e2-e3b9-42db-96ee-94d31c3ba7d6
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/964428/Edwin36_boundslhd.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
    2. Volgenant, A., 1990. "Symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 49(1), pages 153-154, November.
    3. den Hertog, Dick & Stehouwer, Peter, 2002. "Optimizing color picture tubes by high-cost nonlinear programming," European Journal of Operational Research, Elsevier, vol. 140(2), pages 197-211, July.
    4. Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009. "Bounds for Maximin Latin Hypercube Designs," Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
    5. Volgenant, Ton & Jonker, Roy, 1982. "A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation," European Journal of Operational Research, Elsevier, vol. 9(1), pages 83-89, January.
    6. Stinstra, E., 2006. "The meta-model approach for simulation-based design optimization," Other publications TiSEM 713f828a-4716-4a19-af00-e, Tilburg University, School of Economics and Management.
    7. Edwin R. van Dam & Bart Husslage & Dick den Hertog & Hans Melissen, 2007. "Maximin Latin Hypercube Designs in Two Dimensions," Operations Research, INFORMS, vol. 55(1), pages 158-169, February.
    8. Husslage, B.G.M., 2006. "Maximin designs for computer experiments," Other publications TiSEM 216147a0-9c82-48d5-8913-6, Tilburg University, School of Economics and Management.
    9. Driessen, L., 2006. "Simulation-based optimization for product and process design," Other publications TiSEM 51ceee70-3c0a-44a6-a2bd-5, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    2. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Other publications TiSEM 9dfe6396-1933-45c0-b4e3-5, Tilburg University, School of Economics and Management.
    3. Jing Zhang & Jin Xu & Kai Jia & Yimin Yin & Zhengming Wang, 2019. "Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes," Mathematics, MDPI, vol. 7(9), pages 1-16, September.
    4. Mu, Weiyan & Xiong, Shifeng, 2018. "A class of space-filling designs and their projection properties," Statistics & Probability Letters, Elsevier, vol. 141(C), pages 129-134.
    5. Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009. "Bounds for Maximin Latin Hypercube Designs," Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
    6. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    7. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Other publications TiSEM 1c504ec0-f357-42d2-9c92-9, Tilburg University, School of Economics and Management.
    8. Liuqing Yang & Yongdao Zhou & Min-Qian Liu, 2021. "Maximin distance designs based on densest packings," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 84(5), pages 615-634, July.
    9. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
    10. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    11. HARCSA Imre Milán & KOVÁCS Sándor & NÁBRÁDI András, 2020. "Economic Analysis Of Subcontract Distilleries By Simulation Modeling Method," Annals of Faculty of Economics, University of Oradea, Faculty of Economics, vol. 1(1), pages 50-63, July.
    12. van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2007. "Bounds for Maximin Latin Hypercube Designs," Other publications TiSEM da0c15be-f18e-474e-b557-f, Tilburg University, School of Economics and Management.
    13. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Other publications TiSEM 1b5d18c7-b66f-4a9f-838c-b, Tilburg University, School of Economics and Management.
    14. van Dam, E.R., 2008. "Two-dimensional maximin Latin hypercube designs," Other publications TiSEM 61788dd1-b1b5-4c81-9151-8, Tilburg University, School of Economics and Management.
    15. Siem, A.Y.D. & den Hertog, D., 2007. "Kriging Models That Are Robust With Respect to Simulation Errors," Discussion Paper 2007-68, Tilburg University, Center for Economic Research.
    16. Vieira Jr., Hélcio & Sanchez, Susan & Kienitz, Karl Heinz & Belderrain, Mischel Carmen Neyra, 2011. "Generating and improving orthogonal designs by using mixed integer programming," European Journal of Operational Research, Elsevier, vol. 215(3), pages 629-638, December.
    17. Siem, A.Y.D. & den Hertog, D., 2007. "Kriging Models That Are Robust With Respect to Simulation Errors," Other publications TiSEM fe73dc8b-20d6-4f50-95eb-f, Tilburg University, School of Economics and Management.
    18. Xiangjing Lai & Jin-Kao Hao & Renbin Xiao & Fred Glover, 2023. "Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 725-746, July.
    19. Tonghui Pang & Yan Wang & Jian-Feng Yang, 2022. "Asymptotically optimal maximin distance Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(4), pages 405-418, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2007. "Bounds for Maximin Latin Hypercube Designs," Other publications TiSEM da0c15be-f18e-474e-b557-f, Tilburg University, School of Economics and Management.
    2. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    3. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
    4. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Other publications TiSEM 1b5d18c7-b66f-4a9f-838c-b, Tilburg University, School of Economics and Management.
    5. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    6. Liuqing Yang & Yongdao Zhou & Min-Qian Liu, 2021. "Maximin distance designs based on densest packings," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 84(5), pages 615-634, July.
    7. Rennen, G., 2009. "Efficient approximation of black-box functions and Pareto sets," Other publications TiSEM 83f4bb26-c7f0-4733-b08d-c, Tilburg University, School of Economics and Management.
    8. Stinstra, E., 2006. "The meta-model approach for simulation-based design optimization," Other publications TiSEM 713f828a-4716-4a19-af00-e, Tilburg University, School of Economics and Management.
    9. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Other publications TiSEM 1c504ec0-f357-42d2-9c92-9, Tilburg University, School of Economics and Management.
    10. Rooderkerk, R.P., 2007. "Optimizing product lines and assortments," Other publications TiSEM fa544b38-604e-410b-a5da-1, Tilburg University, School of Economics and Management.
    11. Jing Zhang & Jin Xu & Kai Jia & Yimin Yin & Zhengming Wang, 2019. "Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes," Mathematics, MDPI, vol. 7(9), pages 1-16, September.
    12. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    13. HARCSA Imre Milán & KOVÁCS Sándor & NÁBRÁDI András, 2020. "Economic Analysis Of Subcontract Distilleries By Simulation Modeling Method," Annals of Faculty of Economics, University of Oradea, Faculty of Economics, vol. 1(1), pages 50-63, July.
    14. Eiling, E., 2007. "Essays on International Finance and Asset Pricing," Other publications TiSEM 5f891179-600e-4965-a5eb-0, Tilburg University, School of Economics and Management.
    15. Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2005. "Nested Maximin Latin Hypercube Designs in Two Dimensions," Discussion Paper 2005-79, Tilburg University, Center for Economic Research.
    16. Mu, Weiyan & Xiong, Shifeng, 2018. "A class of space-filling designs and their projection properties," Statistics & Probability Letters, Elsevier, vol. 141(C), pages 129-134.
    17. Hollander, S., 2007. "The merits and economic consequences of reputation : Three essays," Other publications TiSEM d9932a90-7aac-4b23-bf99-6, Tilburg University, School of Economics and Management.
    18. Siem, A.Y.D. & den Hertog, D., 2007. "Kriging Models That Are Robust With Respect to Simulation Errors," Other publications TiSEM fe73dc8b-20d6-4f50-95eb-f, Tilburg University, School of Economics and Management.
    19. Grosso, A. & Jamali, A.R.M.J.U. & Locatelli, M., 2009. "Finding maximin latin hypercube designs by Iterated Local Search heuristics," European Journal of Operational Research, Elsevier, vol. 197(2), pages 541-547, September.
    20. Edwin R. van Dam & Bart Husslage & Dick den Hertog & Hans Melissen, 2007. "Maximin Latin Hypercube Designs in Two Dimensions," Operations Research, INFORMS, vol. 55(1), pages 158-169, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:f556d9e2-e3b9-42db-96ee-94d31c3ba7d6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.