考虑运输通道的双层k-平行行排序问题建模与优化
DOI:
CSTR:
作者:
作者单位:

1.四川省宜宾市翠屏区西南交通大学宜宾研究院;2.西南交通大学机械工程学院;3.jidan@my.swjtu.edu.cn;4.mhj7140092@163.com;5.西南交通大学学生创新实践中心

作者简介:

通讯作者:

中图分类号:

TH181;TH165

基金项目:

国家自然科学基金项目(52375268, 52342505, 72401239); 教育部人文社会科学研究规划基金项目(23YJA630139); 河北省自然科学基金(E2024105031); 四川省科技计划资助(2025ZNSFSC0425, 2024NSFSC1048)。


Modeling and Optimization of a Double-floor k-Parallel Row Ordering Problem with Transportation Aisles
Author:
Affiliation:

Fund Project:

This research was partially supported by the National Natural Science Foundation of China (No.52375268, 52342505, 72401239), the Foundation for Humanities, Social Sciences of Ministry of Education of China (No. 23YJA630139), the Natural Science Foundation of Hebei Province of China (No. E2024105031) and the Sichuan Science and Technology Program (No. 2025ZNSFSC0425, 2024NSFSC1048).

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    随着制造车间向多层化、高密度方向发展,传统单层平行行排序难以处理跨层物流中由电梯和纵向通道引入的复杂约束。针对该问题,本文提出考虑运输通道的双层k-平行行排序问题。首先,构建设施、电梯与纵向通道协同布局结构,基于真实可行路径建立物流距离度量,并以最小化设施间加权搬运距离为目标,建立混合整数线性规划模型,实现行分配、行内排序、电梯进出门选择及通道干涉规避的联合优化。其次,针对中、大规模实例求解效率低的问题,提出增量评估—引导式局部搜索模因算法,将物流强度信息嵌入随机可变邻域下降过程,并设计行级增量适应度评估策略,以提升搜索效率和解质量。数值实验表明,该算法在小规模算例中可获得与精确求解一致的最优解,并在中大规模算例中优于传统遗传算法。某起重设备制造企业实例显示,优化后物流搬运成本降低22.42%,验证了所提方法的工程应用价值。

    Abstract:

    With the development of manufacturing workshops toward double-floor and high-density configurations, traditional single-floor parallel row ordering methods are inadequate for addressing the complex constraints introduced by elevators and longitudinal transportation aisles in inter-floor material handling. To address this issue, a double-floor k-parallel row ordering problem with transportation aisles is proposed. First, a collaborative layout structure integrating facilities, elevators, and longitudinal transportation aisles is established. A material handling distance metric based on physically feasible transportation paths is developed, and a mixed-integer linear programming (MILP) model is formulated to minimize the weighted material handling distance between facilities by jointly optimizing row assignment, intra-row ordering, elevator entrance and exit selection, and aisle interference avoidance. Then, to improve the solution efficiency for medium- and large-scale instances, an incremental evaluation-guided local search memetic algorithm is proposed. The algorithm incorporates material flow information into a randomized variable neighborhood descent procedure to guide neighborhood exploration and employs a row-level incremental fitness evaluation strategy to eliminate redundant computations, thereby improving both search efficiency and solution quality. Computational results demonstrate that the proposed algorithm obtains the same optimal solutions as the exact method for small-scale instances and outperforms the conventional genetic algorithm for medium- and large-scale instances. A case study of a crane manufacturing enterprise shows that the optimized layout reduces the material handling cost by 22.42%, demonstrating the effectiveness and practical applicability of the proposed method.

    参考文献
    相似文献
    引证文献
引用本文
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2026-03-12
  • 最后修改日期:2026-07-22
  • 录用日期:2026-07-24
  • 在线发布日期:
  • 出版日期:
文章二维码