| 受约束的过道布置问题建模及优化方法 |
| |
| 引用本文： | 刘俊琦,张则强,龚举华,张裕.受约束的过道布置问题建模及优化方法[J].西南交通大学学报,2022,57(6):1376-1385. |
| |
| 作者姓名： | 刘俊琦 张则强 龚举华 张裕 |
| |
| 作者单位： | 西南交通大学机械工程学院，四川 成都 610031 |
| |
| 基金项目： | 国家自然科学基金（51205328，51675450）；教育部人文社会科学研究青年基金（18YJC630255）；四川省科技计划（2022YFG0245） |
| |
| 摘 要： | 为了研究过道布置问题中设施关系对布局的影响，首先，考虑定位约束与排序约束，构建过道布置问题混合整数规划模型，并提出一种求解该问题的自适应混合克隆选择算法，在克隆操作之前新增符合受约束过道布置问题特性的2-opt操作，随后对所产生种群中最优个体进行禁忌搜索操作，对其他个体进行变异操作并设置自适应变异概率；然后，对模型进行精确求解以验证模型的正确性且求解结果为算法提供了理论依据；最后，应用所提算法分别对受约束过道布置问题与基本过道布置问题的42 ~ 49规模实例进行测试，并将求解结果与克隆选择算法、遗传算法、分散搜索算法、花授粉算法以及烟花算法进行对比，结果表明:混合克隆选择算法可以达到当前先进算法的求解效果且在算例sko-42-04与算例sko49-03上表现更优.
|
| 关 键 词： | 设施布局 受约束的过道布置问题 克隆选择算法 禁忌搜索操作 自适应变异 |
| 收稿时间： | 2020-12-01 |
Modeling and Optimization Method of Constrained Corridor Allocation Problem |
| |
| LIU Junqi,ZHANG Zeqiang,GONG Juhua,ZHANG Yu.Modeling and Optimization Method of Constrained Corridor Allocation Problem[J].Journal of Southwest Jiaotong University,2022,57(6):1376-1385. |
| |
| Authors: | LIU Junqi ZHANG Zeqiang GONG Juhua ZHANG Yu |
| |
| Affiliation: | School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China |
| |
| Abstract: | In order to study the influence of facility relationship on layout in corridor allocation problem, An integer programming model considering location and relationship constraints is constructed, and a hybrid clonal selection algorithm based on clonal selection algorithm is proposed to solve the problem. Before clonal operation, a new 2-opt operation based on problem characteristics is added. Then, tabu search operation is carried out for the optimal individuals in the generated population, mutation operation is carried out for other individuals and adaptive mutation probability is set. The model is accurately solved to verify the correctness of the model and the solution results provide a theoretical basis for the algorithm. Applying the proposed algorithm to test 42?49 scale examples of constrained corridor allocation problem and basic corridor allocation problem respectively. The results are compared with clonal selection algorithm, genetic Algorithm, Scatter Search, flower pollination algorithm and fireworks algorithm. The results show that the hybrid clone selection algorithm can achieve the solution effect of the current advanced algorithm and perform better in the examples sko-42-04 and sko-49-03. |
| |
| Keywords: | |
|
| 点击此处可从《西南交通大学学报》浏览原始摘要信息 |
|
点击此处可从《西南交通大学学报》下载全文 |
