摘要
针对原有装船顺序整数规划求解算法所求得的最优解精度较低的问题,设计遗传算法的装船顺序整数规划求解算法。根据遗传算法演变规则设定整体算法求解流程;依照流程中的硬约束条件要求采用船舶重心与装船翻箱率结合的形式,设计装船规则;根据装船规则内容,采用翻箱率与船舶重心目标函数组成整数规划模型并进行求解。至此,遗传算的装船顺序问题整数规划求解算法完成。构建对比试验,与原有算法相比,此算法最优适度曲线与准确计算结果相近,原有方法与计算结果误差较大。因而,此算法求解精度更高,此算法更有效。
To solve the problem of low accuracy of the original integer programming algorithm,the genetic algorithm is designed.According to the evolution rules of genetic algorithm,the whole algorithm solving process is set.According to the requirements of the hard constraint conditions in the process,the design of shipping rules is in the form of combining the ship’s center of gravity with the rate of stashing.According to the content of shipping rules,the integer programming model is composed of the turning rate and the ship’s center of gravity objective function and solved.So far,the genetic algorithm of shipping order problem integer programming algorithm is completed.Compared with the original algorithm,the optimal moderate curve of this algorithm is similar to the accurate calculation result,and the error between the original method and the calculation result is large.Therefore,the algorithm is more accurate and effective.
作者
张兰云
顾晓青
ZHANG Lan-yun;GU Xiao-qing(Beijing Jiaotong University Haibin College,Huanghua 061199,China;Hebei University of Water Resources and Electric Engineering,Cangzhou 061001,China)
出处
《舰船科学技术》
北大核心
2019年第22期208-210,共3页
Ship Science and Technology
基金
2019年度沧州市社会科学发展研究课题资助项目(2019171)
河北省高等学校科学研究资助项目(Z2019032).
关键词
遗传算法
最优求解
装船顺序
整数规划
genetic algorithm
optimal solution
order of shipment
integer programming
作者简介
张兰云(1981-),女,硕士,讲师,研究方向为运筹与优化及数学建模。
