检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆大学数学与统计学院,重庆400044 [2]重庆长安股份有限公司,重庆400021
出 处:《自动化学报》2011年第2期241-244,共4页Acta Automatica Sinica
基 金:国家自然科学基金(69674012);重庆市科技攻关项目(CSTC2009AC3037)资助~~
摘 要:集装箱的堆存状态与理想发箱顺序很难保持一致,翻箱操作是不可避免的.为降低堆场的翻箱率,提高作业效率,在获得集装箱的取箱顺序前提下,将每取一个集装箱所产生的可能状态视为一个状态结点,所需的翻箱次数加一个基数作为状态结点间的连接权,把翻箱优化问题转化为最短路径求解问题.脉冲耦合神经网络(Pulse-coupled neuralnetwork,PCNN)具有独特的自动波并行传播的特性,适用于求解大规模实时问题,能一次求出源点到其他所有目标点的最短路径,从而获得最优的翻箱方案.其所需要的计算量仅正比于最短路径的长度,与路径图的复杂程度及路径图中的通路总数无关.这为建立集装箱的智能控制系统奠定了坚实的理论基础.The stockpiling state of containers is usually not in the ideal order of the containers to be sent, so relocation of the containers is inevitable. In order to reduce the relocation fre- quency in the container yards, improve operational efficiency, on the condition that the order of container withdrawal is required, the paper regards every possible state that may be generated when a container is being withdrawn as a node, and takes the number of relocations plus a base as the connection weight of the node. Then, the optimization problem for container relocation is converted into the shortest-path solution problem. The paper brings forward a new approach to find the shortest path based on pulse-coupled neural network, which can be used to solve large-scale practical problem. We can easily work out the shortest path from a source to all other target points, therefore we have the best relocation program. The algorithm lays a solid theoretical basis for the container intelligent control system.
关 键 词:翻箱 最短路径 堆场 智能控制 脉冲耦合神经网络
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.27