检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:易光涛 刘建胜[1] YI Guangtao;LIU Jiansheng(School of Advanced Manufacturing,Nanchang University,Nanchang 330031,China)
出 处:《南昌大学学报(工科版)》2024年第2期239-246,共8页Journal of Nanchang University(Engineering & Technology)
基 金:国家自然科学基金资助项目(51565036)。
摘 要:针对鱼骨布局多目标路径规划问题,建立了以多车协同拣货总移动距离最短和负载不平衡最小的两目标路径规划模型;通过距离检测的方法在帕累托前沿面上寻找knee点,并将该knee点作为偏好信息带入r支配中,引导算法快速搜索到偏好区域,形成更好的帕累托解集,提出一种基于knee点的r支配多目标遗传算法;引入自适应交叉和变异算子,依次提高算法全局搜索能力,加速种群收敛速度,同时防止陷入局部最优,基于标准测试函数测试算法的性能,最后通过实验数据验证了该算法在鱼骨型仓库布局拣选路径优化问题上的有效性。Aiming at the multi-objective path planning problem of fishbone layout,a two-objective path planning model with the shortest total moving distance and the smallest load unbalance with multi-vehicle cooperative picking was established;The knee point on the Pareto Front was found by the method of distance detection,and the knee point was brought into the r-dominance as the preference information,the algorithm was guided to quickly search for the preference area and a better Pareto set was formed,a r-dominance genetic algorithm based on knee point was proposed;The adaptive crossover and mutation operators were introduced to sequentially improve the global search ability of the algorithm,accelerate the population convergence speed,and prevent falling into local optimum,the performance of the algorithm was tested based on the standard test function,finally,the effectiveness of the algorithm in the optimization problem of fishbone warehouse layout and picking path was verified by experimental data.
分 类 号:TH181[机械工程—机械制造及自动化] TB491[一般工业技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.220.204.192