检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄辉[1] 江超 任璇 周祥 HUANG Hui;JIANG Chao;REN Xuan;ZHOU Xiang(School of Management,Northwestern Polytechnical University,Xi′an 710129,China)
出 处:《机械科学与技术》2021年第6期900-907,共8页Mechanical Science and Technology for Aerospace Engineering
基 金:中央高校基本科研业务费专项资金项目(3102019BZ03)。
摘 要:第二类多目标双边装配线问题由于其复杂性,目前研究文献较少。为解决这一问题,在建立二维数学模型的基础上,提出改进和声搜索算法和非支配排序遗传算法相结合的一种混合算法,通过即兴创作过程进行全局搜索,变邻域搜索结构(插入和重组)进行局部搜索。对于E型作业,通过左右工位最早可开始时间进行动态对比选择最早的工位,尽量减少等待时间。采用NSGA-2的非支配排序和拥挤度计算,从而解决多目标的优化问题。最后选取实例进行求解分析,得出其最优的生产节拍和平滑系数以及作业在各工位的分布情况,从而验证了算法的有效性。Due to its complexity,there are few literatures about multi-objective two-sided assembly line problem of type-2.To solve this problem,based on the two-dimensional mathematical model,an improved combination of the harmony search algorithm and the non-dominated sorting genetic algorithm was proposed,which performed a global search through the improvisation process and a local search through variable neighborhood search structure(insertion and recombination).For E-type work,the earliest start time of the left and right work stations could be used for dynamic comparison to select the earliest work station,and the waiting time was minimized.The non-dominated sorting and congestion degree calculation of NSGA-2 was used to solve the multi-objective optimization problem.Finally,an example was selected to solve,and the optimal production cycle and smoothness coefficient and the distribution of the tasks at each station are obtained,which verifies the effectiveness of the hybrid algorithm.
关 键 词:双边装配线 第二类平衡问题 多目标优化 和声搜索 NSGA-2 变邻域搜索
分 类 号:TH16[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.185.164