Boxplots obtained by testing rat575 for 20 times by each algorithm. by Jin Zhang (53297)

Boxplots obtained by testing ch150 for 50 times by each algorithm. by Jin Zhang (53297)

Boxplots obtained by testing fl1400 for 10 times by each algorithm. by Jin Zhang (53297)

Schematic diagram of RRT-Connect algorithm expansion. by Zhenggang Wang (1753657)

Subjects: “…target gravitational function…”

Computational time of each algorithm—Part I. by Xuan Chen (158617)

Subjects:

Computational time of each algorithm—Part II. by Xuan Chen (158617)

Subjects:

The pseudocode for the NAFPSO algorithm. by Huichao Guo (14515171)

“…<div><p>This paper aims to solve the scheduling optimization problem in the emergency management of long-distance natural gas pipelines, with the goal of minimizing the total scheduling time. To this end, the objective function of the minimum total scheduling time is established, and the relevant constraints are set. …”

PSO algorithm flowchart. by Huichao Guo (14515171)

“…<div><p>This paper aims to solve the scheduling optimization problem in the emergency management of long-distance natural gas pipelines, with the goal of minimizing the total scheduling time. To this end, the objective function of the minimum total scheduling time is established, and the relevant constraints are set. …”

Run times of two algorithms. by Gourab Saha (8987405)

Subjects:

Details of path flows and path travel times by the proposed algorithms. by C. K. Wong (3224922)

“trend+var” algorithm. by Roman Olson (6577004)

Average running times for the different algorithms. by Ayush Dogra (17054597)

Subjects:

Comparative statistical performance of various algorithms in minimizing the <i>F</i> cost function. by Davut Izci (15927452)

Subjects:

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

“…<div><p>This paper aims to solve the scheduling optimization problem in the emergency management of long-distance natural gas pipelines, with the goal of minimizing the total scheduling time. To this end, the objective function of the minimum total scheduling time is established, and the relevant constraints are set. …”

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

“…Experimental results show that, compared with other baseline methods, the rMAPPO-based agent scheduling method can reduce robot waiting times more effectively, demonstrate greater adaptability in handling different riveting and welding tasks, and significantly enhance the manufacturing efficiency of stiffened H-beam.…”

Objective functions (i.e., RMSEs) and time of optimization for different population sizes of the used algorithms. by Yao Peng (1928524)

“…<p>Objective functions (i.e., RMSEs) and time of optimization for different population sizes of the used algorithms.…”

Running time comparison of different algorithms. by Shuang Guo (294074)

Subjects:

Performances of ImpAO, AO, SMA, MFO and ABC algorithms for minimization of different error-based cost functions. by Davut Izci (15927452)

Subjects:

Computation time (seconds) for Algorithm 2 by network type. by Alireza Rangrazjeddi (13360943)

Subjects:

<b>Opti2Phase</b>: Python scripts for two-stage focal reducer by Morgan Najera (21540776)

“…</p><p dir="ltr">The package includes:</p><ul><li>Scripts for first-order analysis, third-order modeling, optimization using a Physically Grounded Merit Function (PGMF), and RMS-based refinement.</li><li>A subfolder named <b>Images</b>, which stores the figures generated by six of the seven provided scripts.…”