Optimizing Latin hypercube designs by particle swarm

Ray Bing Chen, Dai Ni Hsieh, Ying Hung, Weichung Wang

Research output: Contribution to journalArticlepeer-review

40 Citations (Scopus)

Abstract

Latin hypercube designs (LHDs) are widely used in many applications. As the number of design points or factors becomes large, the total number of LHDs grows exponentially. The large number of feasible designs makes the search for optimal LHDs a difficult discrete optimization problem. To tackle this problem, we propose a new population-based algorithm named LaPSO that is adapted from the standard particle swarm optimization (PSO) and customized for LHD. Moreover, we accelerate LaPSO via a graphic processing unit (GPU). According to extensive comparisons, the proposed LaPSO is more stable than existing approaches and is capable of improving known results.

Original languageEnglish
Pages (from-to)663-676
Number of pages14
JournalStatistics and Computing
Volume23
Issue number5
DOIs
Publication statusPublished - 2013 Sep 1

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Optimizing Latin hypercube designs by particle swarm'. Together they form a unique fingerprint.

Cite this