“…Even when many data are available, the computational algorithms for stochastic or fuzzy optimization models, such as nonlinear programming (NP) or modern heuristic global searches, may face complex or nonlinear problems [19,20]. For example, traditional NP algorithms, including both gradient and non-gradient based ones, were limited to local optima upon solving the aforementioned SOM framework [11,21]. Although heuristic global search algorithms, including genetic algorithms, evolutionary algorithms and simulated annealing, are capable of surpassing the local optima limitations, their applications in the optimization of TMDL allocation are still restricted by their extremely high computational cost [18,22].…”