摘要
船闸编排问题可以看秤一个二维装箱问题。该文基于贪婪算法思想，研究如何把船闸编排的二维装箱问题降到一维求解。建立了相关的数学模型，并设计出计算机程序，在Visualc＋＋平台运行，得到了较优的组合结果，证明该方法可以有效地提高闸室面积利用率。
The arranging of lock chamber is a two-dimensional packing problem. Based on greedy algorithm, this paper studies on how to reduce two-dimensional packing problem to one-dimension, the mathematical model is constructed and then ：algorithm for the problem. Last, running in Visual C＋＋ platform, optimum combination results is obtained and indicates the method can improve utilization of chamber area efficiently.
作者
刘雯丽
LIU Wen-li （Department of Traffic and Transportation, South-West Jiaotong University, Chengdu 610031, China）
出处
《电脑知识与技术》
2011年第4期2417-2418,共2页
Computer Knowledge and Technology
关键词
船闸编排问题
装箱模型
贪婪算法
the arranging of lock chamber
packing model
greedy algorithm
