摘要
三峡永久船闸的编排问题是一个多目标规划问题。该文首先建立了求解这个问题的数学模型,然后提出了能够解决这个问题的算法——深度优先搜索()算法,这种算法很好地解决了闸室面积利用率和船只优先级别之间的矛盾,并根据实际情况对算法进行了一DFSDFS些改进,提高了运算效率。最后用实验数据说明此算法可用于三峡船闸的一般编排,而且效果不错。
The arranging of three-gorges permanent lock chamber is a multi-objective planning problem. In this paper, themathematical model of this problem is constructed and then the algorithm for the problem, DFS algorithm is provided. This algorithm solves the contradiction between area percent and ships priorities. Besides, for high efficiency, DFS Algorithm is improved. Last the usability of this algorithm is proved by test data with good result.
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第8期224-226,共3页
Computer Engineering
