检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张艳伟[1] 程沙沙 张新艳[2] ZHANG Yanwei;CHENG Shasha;ZHANG Xinyan
机构地区:[1]武汉理工大学物流工程学院,湖北武汉430063 [2]同济大学机械与能源工程学院,上海201804
出 处:《武汉理工大学学报(信息与管理工程版)》2021年第6期533-539,547,共8页Journal of Wuhan University of Technology:Information & Management Engineering
摘 要:针对区段式车间设备布局与搬运路径协同优化建模涉及的参数变量复杂、约束多等问题,研究车间系统协同优化建模与求解方法。分析区段式车间系统特征和工艺流程,提出考虑装卸点位置的重载和空载搬运距离计算方法;采用多点离散分布描述产品需求的不确定性,以AGV重载和空载运行总成本最小为目标,建立设备布局与AGV路径规划协同优化模型;结合适应度函数线性尺度变换、精英锦标赛选择等策略,设计基于双链染色体编码的增强精英保留遗传算法。实例研究表明,提出的协同优化模型和求解算法能有效解决区段式车间系统布局规划问题。In order to solve the problems of complex parameter variables and constraints involved in the collaborative optimization modeling of equipment layout and handling path planning in segmented flow topology(SFT)workshop system,the modeling and solving method of workshop system collaborative optimization was studied.Analyzing the system characteristics and process flow of SFT workshop system,and the calculation method of heavy load and no-load handling distance considering the position of loading and unloading points was proposed.The multi-point discrete distribution was adopted to describe the uncertainty of product demand in the dynamic environment.A collaborative optimization model of workshop equipment layout and AGVs path planning under uncertain requirements was established,with the objective of minimizing the total cost of heavy-load and no-load trip cost of AGVs.Combining the strategies of linear scaling of fitness function and selection of elite tournaments,a strengthen elitist genetic algorithm(SEGA)based on double stranded chromosome coding was designed.Case study shows that the proposed collaborative optimization model and algorithm can solve the workshop layout planning problem effectively.
关 键 词:车间设备布局 协同优化 改进遗传算法 区段式系统 AGV空载成本 不确定需求
分 类 号:TP319[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222