Showing 121 - 140 results of 273 for search '(( binary based based optimization algorithm ) OR ( library based work optimization algorithm ))', query time: 0.52s Refine Results
  1. 121
  2. 122

    Plan frame of the house. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  3. 123

    Ablation test results. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  4. 124

    Hyperparameter selection test. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  5. 125

    Multiple index test results of different methods. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  6. 126

    Backtracking strategy diagram. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  7. 127

    Comparison of differences in literature methods. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  8. 128

    New building interior space layout model flow. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  9. 129

    Schematic of iteration process of IDE-IIGA. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  10. 130

    Schematic diagram of IGA chromosome coding. by Ling Zhao (111365)

    Published 2025
    “…<div><p>To solve the problems of insufficient global optimization ability and easy loss of population diversity in building interior layout design, this study proposes a novel layout optimization model integrating interactive genetic algorithm and improved differential evolutionary algorithm to improve the global optimization ability and maintain population diversity in building layout design. …”
  11. 131

    <i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

    Published 2023
    “…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i><sub><i>δ</i></sub>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i><sub><i>δ</i></sub>, <i>hi</i>PRS constructs <i>I</i><sub><i>K</i></sub>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …”
  12. 132

    A simple HFS instance. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  13. 133

    The scheduling Gantt chart. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  14. 134

    Structure and computational framework of IPMMPO. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  15. 135

    Data types contained in and . by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  16. 136

    Data construction of the first and last rows in . by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  17. 137

    Schematic diagram of PM model. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  18. 138

    Schematic diagram of the atomic function . by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  19. 139

    Multiple comparison of means - Tukey HSD. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
  20. 140

    Schematic diagram of the cut-and-mark operation. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”