Showing 1 - 20 results of 86 for search '(( library based case optimization algorithm ) OR ( binary a dynamic optimization algorithm ))', query time: 0.68s Refine Results
  1. 1

    Table_1_A scheduling route planning algorithm based on the dynamic genetic algorithm with ant colony binary iterative optimization for unmanned aerial vehicle spraying in multiple tea fields.XLSX by Yangyang Liu (807797)

    Published 2022
    “…By optimizing the crossover and mutation operators of the genetic algorithm (GA), the crossover and mutation probabilities are automatically adjusted with the individual fitness and a dynamic genetic algorithm (DGA) is proposed. …”
  2. 2
  3. 3

    DE algorithm 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. …”
  4. 4

    Test results of different algorithms. 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. 5
  6. 6
  7. 7

    An optimal solution for the HFS instance. by Xiang Tian (4369285)

    Published 2025
    “…Next, a CP model (IPMMPO-CP) applicable to multi-scenario HFS problems is proposed. Finally, based on a large number of instances and real cases, IPMMPO-CP is compared with 9 representative algorithms and 2 latest CP models. …”
  8. 8
  9. 9
  10. 10

    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

    Published 2025
    “…In response to these challenges, this work presents a method to fine-tune a genetic algorithm for CAMD. The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”
  11. 11

    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

    Published 2025
    “…In response to these challenges, this work presents a method to fine-tune a genetic algorithm for CAMD. The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”
  12. 12

    Proposed Algorithm. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  13. 13
  14. 14

    Comparison based on hard instances from [79]. by Xiang Tian (4369285)

    Published 2025
    “…Next, a CP model (IPMMPO-CP) applicable to multi-scenario HFS problems is proposed. Finally, based on a large number of instances and real cases, IPMMPO-CP is compared with 9 representative algorithms and 2 latest CP models. …”
  15. 15
  16. 16
  17. 17
  18. 18

    Comparisons between ADAM and NADAM optimizers. by Hend Bayoumi (22693738)

    Published 2025
    “…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
  19. 19
  20. 20