An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design (Q5059304): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128107443, #quickstatements; #temporary_batch_1722463431396
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficient design of experiments for sensitivity analysis based on polynomial chaos expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential experimental design based generalised ANOVA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Latin hypercube designs by particle swarm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design optimization of supersonic jet pumps using high fidelity flow analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximin Latin hypercube designs by iterated local search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-filling Latin hypercube designs for computer experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for constructing optimal design of computer experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3498633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kriging metamodeling in simulation: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel extension algorithm for optimized Latin hypercube sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on algorithms for optimization of Latin hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploratory designs for computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary optimization of low-discrepancy sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Array-Based Latin Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of optimal symmetric Latin hypercube designs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of the wrap-around \(L_2\)-discrepancy and relationships between MLHD and uniform design with a large size / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128107443 / rank
 
Normal rank

Latest revision as of 23:18, 31 July 2024

scientific article; zbMATH DE number 7637108
Language Label Description Also known as
English
An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
scientific article; zbMATH DE number 7637108

    Statements

    An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design (English)
    0 references
    23 December 2022
    0 references
    Latin hypercube design
    0 references
    space-filling quality
    0 references
    genetic algorithm
    0 references
    metamodel
    0 references
    0 references
    0 references

    Identifiers