| Algorithm 1: GJO-Based Hyperparameter Optimization of PI-RNN |
| Input: Training dataset train Validation dataset val Search space H Population size P Maximum iterations T Output: Optimal hyperparameter set H* Initialize P Golden Jackal positions within search space H Evaluate the fitness of each jackal using validation loss for to T do Identify the best jackal position best Identify the second-best jackal position second for i = 1 to P do Update the position of jackal i Keep updated parameters within their predefined bounds Construct the PI-RNN using the updated parameters Train the PI-RNN using train Calculate data, physics, and constraint losses Evaluate the combined fitness using val end for Update best according to the minimum fitness value end for Return H* = best |