期刊文献+

多端口出入式自动化存取系统作业集成优化 被引量:2

Integrated optimization of operations in multiple-I/O points automated storage and retrieval system
下载PDF
导出
摘要 为了提高具有双板作业运作特点的多端口出入式自动化存取系统(AS/RS)整体作业效率,在统筹考虑货位分配和指令序列排序对作业时间影响的基础上,提出以最小化指令序列完工时间为优化目标的集成优化模型。引入交换和插入思想构建货位分配和指令排序的搜索邻域,并分析2种邻域构建方法对指令序列完工时间的影响。最后,设计二阶段禁忌搜索算法对问题进行求解,利用货位分配和指令排序2个阶段禁忌搜索过程的反馈获得模型最优解,其求解过程体现货位分配和指令排序2个优化方面在邻域搜索过程中互相影响、互相嵌套的复杂关系。研究结果表明:二阶段禁忌搜索算法在不同的货位规模和指令序列规模下均能获得满意解,具有较好的鲁棒性和计算效率;相比"先到先服务"和"最近邻"调度规则,本文优化方法能够有效缩短指令序列完工时间。 To improve the overall efficiency of multiple-I/O points automated storage and retrieval system(AS/RS) with double cargo transport characteristic, an integrated optimization model was established to minimize the completion time of command sequence on the basis of considering the influence of storage location assignment and command sequence sorting on the operation time comprehensively. The insert method and exchange method were introduced to construct search neighborhoods of storage location assignment and command sequence sorting, and the influence of the two neighborhood construction methods on the completion time of command sequence was analyzed. Finally, a two-phase tabu search algorithm was presented to solve this problem, and the optimal solution of the model was obtained by the feedback between the two stage tabu search processes of storage location assignment and command sequence sorting. The solving process embodies the mutual influences and mutual nesting relationships in the neighborhood searching process of the two optimal aspects, namely storage location assignment and command sequence sorting. The results show that the two-phase tabu search algorithm proposed in this paper can obtain satisfactory solutions under the condition of different command sequence scales and different storage location scales, and it has strong robustness and high efficiency. Compared with the First-Come-First-Served scheduling rule and Nearest-Neighbor scheduling rule, the presented optimization method can shorten the completion time of command sequence effectively.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2016年第6期1930-1939,共10页 Journal of Central South University:Science and Technology
基金 国家自然科学基金资助项目(61563029) 国家科技支撑计划资助项目(2012BAH20F05) 兰州交通大学青年基金资助项目(2011012)~~
关键词 自动化存取系统 多端口出入式 集成优化 货位分配 指令序列排序 双板作业 automated storage and retrieval system multiple-I/O points integrated optimization storage location assignment command sequence sorting double cargo transport
  • 相关文献

参考文献15

  • 1MUPPANI V R, ADIL G K. A branch and bound algorithm forclass based storage location assignment[J].European Journal ofOperational Research, 2008, 189(2): 492-507.
  • 2KOVACS A. Optimizing the storage assignment in a warehouseserved by milkrun logistics[J]. International Journal ofProduction Economics, 2011, 133(1): 312-318.
  • 3柳赛男,柯映林,李江雄,吕震.基于调度策略的自动化仓库系统优化问题研究[J].计算机集成制造系统,2006,12(9):1438-1443. 被引量:61
  • 4MUPPANI V R, ADIL G K. A branch and bound algorithm forclass based storage location assignment[J]. European Journal ofOperational Research, 2008, 189(2): 492-507.
  • 5ENE S, OZTURK N. Storage location assignment and orderpicking optimization in the automotive industry [J]. InternationalJournal of Advanced Manufacturing Technology, 2012,60(5/6/7/8): 787-797.
  • 6GAGLIARDI J P, RENAUD J, RUIZ A. On storage assignmentpolicies for unit-load automated storage and retrieval systems [J].International Journal of Production Research, 2012, 50(3):879-892.
  • 7李英德,鲁建厦.基于相关性的周期性货位优化的模型与算法[J].机械工程学报,2011,47(20):75-80. 被引量:8
  • 8许晓伟,梁英宏,吴耀华.面向仓储物流的建模及控制系统设计方法[J].计算机集成制造系统,2009,15(12):2335-2342. 被引量:5
  • 9杨朋,缪立新,秦磊.多载具自动化存取系统作业调度优化[J].计算机集成制造系统,2013,19(7):1626-1632. 被引量:8
  • 10POPOVIC D, VIDOVIC M, BJELIC N. Application of geneticalgorithms for sequencing of AS/RS with a triple-shuttle modulein class-based storage[J]. Flexible Services and ManufacturingJournal, 2014,26(3): 432-453.

二级参考文献76

  • 1陈璐,奚立峰,蔡建国,Nathalie Bostel,Pierre Dejax.一种求解带有阻塞限制的混合流水车间的禁忌搜索算法[J].上海交通大学学报,2006,40(5):856-859. 被引量:11
  • 2张晓萍,刘文煌,颜永年.CIMS物流系统的关键技术[J].计算机集成制造系统-CIMS,1997,3(1):22-24. 被引量:8
  • 3Gupta J. Two stage hybrid flow-shop scheduling problem[J]. Journal of the Operational Research Society, 1988, 39: 359-364.
  • 4Du J, Leung J. Minimizing total tardiness on one machine is NP-Hard [J].Mathematics of Operation Re-search, 1990, 15:483-495.
  • 5Koulamas C. The total tardiness problem: Review and extensions [J]. Operations Research, 1994, 42 (6) : 1025-1041.
  • 6Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics [J].European Journal of Operational Research, 2005, 165 : 479-494.
  • 7Taillard E. Benchmarks for basic scheduling problems[J]. European Journal of Operational Research, 1993, 64 : 278-285.
  • 8Roneoni D, Henriques L. Some heuristic algorithms for total tardiness minimization in a flowshop with blocking [J].Omega, 2009, 37: 272-281.
  • 9Haouari M, M' Hallah R. Heuristic algorithms for the two-stage hybrid flowshop problem [J]. Operations Research Letters, 1997, 21 : 43-53.
  • 10Negenman E G. Local search algorithms for the multiprocessor flow shop scheduling problem [J].European Journal of Operational Research, 2001, 128: 147-158.

共引文献83

同被引文献11

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部