运用改进野草算法求解钢管组拼问题

    Solution of Steel Pipe Splicing with Improved Invasive Weed Algorithm(IWA)

    • 摘要: 鉴于人工生成组拼方案效果不好且浪费人力和物力的问题,运用改进的野草算法求解钢管组拼问题。分析钢管组拼需求,建立其数学模型,并针对实际工程应用中野草算法与初始位置联系过于紧密,寻优过程过于集中,无法完成全局搜索等缺点,从初始位置和扩散计算两个方面进行改进,将钢管组拼问题简化为带约束的最小值求解问题。结果表明:提出的改进野草算法能有效优化钢管组拼。

       

      Abstract: Addressing the problem that manual generation of the splicing scheme has shortcomings like wasting manpower and material resources,the improved invasive weed algorithm (IWA) method is employed to solve the issue of steel pipe splicing.After analyzing the demand for steel pipe splicing,related mathematical model is set up.Furthermore considering the drawbacks staying with actual engineering application of the IWA method such as over close connection with the initial position, and over concentrated optimization process, which fails to realize the global research,the improvement is conducted from two aspects,i.e.,the initial position and the diffusion calculation so as to simplify the issue from steel pipe splicing into a issue of constrained minimal value solution.The actual application result shows that the said improved IWA method is capable of well optimizing the steel pipe splicing.

       

    /

    返回文章
    返回