引江济淮工程（河南段）涉及河道、闸泵、管道和调蓄水库，约束条件复杂，常规的优化调度算法难以搜索可行解，求解效率低。选用受水区缺水率平均值最小、泵站总抽水量最小和受水区缺水率标准差最小作为目标函数，从供水保障、供水成本和公平性角度构建多目标水量优化调度模型。基于可行搜索思路，结合逆序演算和顺序演算过程对约束条件进行处理，引入决策系数，通过映射关系使搜索空间保持在可行域中，结合多目标非支配排序遗传算法（non-dominated sorting genetic algorithms，NSGA-II）进行求解，得到Pareto最优解集，并采用熵权法进行方案优选。结果表明，基于可行搜索的NSGA-II算法能够有效求解复杂调度系统的多目标优化问题，综合考虑多个目标的最优方案相对单目标方案更加合理，结果可为引江济淮工程（河南段）运行管理提供决策支撑。

The multi-objective water optimal dispatching problem is the current research hotspot in the field of water resources. The Henan section of the Yangtze-to-Huaihe River Water Diversion Project involves a variety of water conveyance structures such as river channels, pipelines, gate pumps, and storage reservoirs, making the water supply scheduling system complex. Water scheduling for water diversion projects often needs to consider multiple scheduling objectives such as water supply assurance, energy consumption, and fairness. These objectives generally have competing relationships, making the problem relatively difficult to solve. Therefore, research on multi-objective optimization scheduling of water quantity for complex water diversion projects is particularly important.Current research adopts intelligent optimization algorithms to solve complex water scheduling models. These algorithms optimize the values of decision variables to achieve the optimal objective function under given constraints. In the process of water optimal dispatching models, handling constraints has always been a challenging problem for intelligent algorithms. Conventional intelligent algorithms perform random searches in the decision variable space within given upper and lower bounds. However, for complex scheduling systems, with numerous types of constraints and decision variables, and strong correlations among them, the feasible space is relatively small compared to the entire search space. This requires algorithms to increase iteration numbers to expand the search, resulting in longer computation time, poor convergence, and even the inability to find feasible solutions. To address this problem, a feasible search approach-based multi-objective optimization method is proposed to solve the multi-objective water optimization scheduling problem for the Henan section of the Yangtze-to-Huaihe River Water Diversion Project. The minimizing water shortage rate, total pumping volume of pump stations, and standard deviation of water shortage rate in the water destination regions are selected as objective functions, aiming to construct a multi-objective water volume optimization scheduling model from the perspectives of water supply security, energy consumption, and fairness. Based on the feasible search approach, combined with the process of reverse calculation and forward calculation, the constraints were addressed by involving the decision coefficients and maintaining the search space within the feasible domain through mapping relationships. The multi-objective non-dominated sorting genetic algorithm (NSGA-II) was utilized for the model solution, generating the Pareto optimal solution set. The entropy weight method was employed for scheme selection. A comparison was made between the scheme with the minimum water shortage rate and the scheme with the highest evaluation score based on the entropy-based weight method. Although the average water shortage rate of the optimal scheme based on the entropy-based weight method was relatively higher than that of the scheme with the minimum water shortage rate, the total pumping volume and the standard deviation of the water shortage rate were reduced. The total pumping volume decreased by approximately 2 million m3, and the standard deviation decreased by approximately 50.2%, respectively. Considering multiple objectives comprehensively, the optimal scheme with a higher balance of water shortage spatial distribution and lower energy consumption based on the entropy weight method was chosen as the optimal scheduling scheme. The results show that the NSGA-II algorithm based on the feasible search can effectively solve the multi-objective optimization problem of complex scheduling systems. The optimal schemes considering multiple objectives are more reasonable than single-objective schemes, providing decision support for the operation and management of the Henan section.