检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学材料科学与工程学院,山东济南250061
出 处:《山东大学学报(工学版)》2008年第3期14-17,共4页Journal of Shandong University(Engineering Science)
基 金:自然科学基金项目(50775131);山东省自然科学基金项目(Y2007F55)
摘 要:讨论了相同规格货物的装载问题,给出一种模型简单、计算量小的优化算法,将三维装载问题转化为一维和二维相结合的装箱问题,降低了问题的复杂性.首先针对给定的集装箱空间,计算出沿高度方向的水平层的最优分布,即一维下料问题;再通过优化计算,求出水平层内货物的最优排列,将问题转化为二维裁剪问题.通过与文献报道算例的比较,表明该算法通过简单的计算过程就能达到预定的优化目的.An optimum algorithm with simple models and calculational methods that only applies to container loading homogeneous cargoes was provided. It can transfer three-dimensional loading into one-dimensional and two-dimensional loading to reduce the complexity of the problem. For the given space, the optimum distribution of the horizontal layers was first calculated along the height direction of the container, which can be regarded as a one-dimensional cutting problem. Then the best arrangement of boxes in each horizontal layer was given by optimization calculating, which can be regarded as a two-dimensional cutting problem. By comparison with the existing experiments, this algorithm can achieve the expected purpose of optimizing the loading process by a simple calculation.
分 类 号:TP391.72[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28