Convergence speed of five algorithms. by Huichao Guo (14515171)

“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Multi-algorithm comparison figure. by Dawei Wang (471687)

“…A sophisticated optimization model has been developed to simulate the optimal operation of machinery, aiming to maximize equipment utilization efficiency while addressing the challenges posed by worker fatigue. An innovative algorithm, the improved hybrid gray wolf and whale algorithm fused with a penalty function for construction machinery optimization (IHWGWO), is introduced, incorporating a penalty function to handle constraints effectively. …”

A combined algorithm to distinguish between IB and NC models based on the differences in binding kinetics and DynR temporal evolution. by Federico Sevlever (8934533)

“…This Example illustrates the only group of situations where the algorithm fails. A global analysis indicates that only the 5% of the cases fall in this group (this number corresponds to R₀ = 1000, which is the value used in the seven examples analyzed in this figure). …”

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”

A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases by Maru Song (22593561)

“…Crucially, we propose fitness functions based on approximate measures of the wave function compactness, which enable inexpensive genetic algorithm searches. …”

Multidomain, Automated Photopatterning of DNA-functionalized Hydrogels (MAPDH). by Moshe Rubanov (7289156)

“…<b>B)</b> Pseudocode for MAPDH in Python. The algorithm takes as input the vials that will be flowed through the patterning chamber. …”

Flowchart of one iteration of the CE-Symm algorithm. by Spencer E. Bliven (6672755)

Algorithm parameter setting. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”

Algorithm parameter setting. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”

The benchmark functions. by Shuhui Yu (1535500)

Partial behavioral switching. by Hiroyuki Ichijo (13891153)

Comparison of deconvolution and optimization algorithms on a batch of data. by Ali-Kemal Aydin (10968731)

“…Output is given by the vascular response, measured as the change in speed of red blood cells flowing inside a capillary proximal to the recorded neuronal activation (in yellow, right panel). Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”

Benchmark functions. by Peiwen Zhang (1863202)

Membership function of each target. by Tianrui Zhang (2294542)

“…Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management.…”

Artificial colony algorithm flow. by Jianpeng Zhang (528185)

“…In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. …”

Pseudo-code of ABC algorithm. by Jianpeng Zhang (528185)

“…In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. …”

Algorithm detection steps. by José M. Rivera-Arbeláez (12418512)

Completion times for different algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

The average cumulative reward of algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”