高级检索

  • ISSN 1006-3080
  • CN 31-1691/TQ

一类面向仓库车辆路径优化的改进禁忌搜索算法及其应用

吴胜昔 刘威 卢文建 顾幸生

吴胜昔, 刘威, 卢文建, 顾幸生. 一类面向仓库车辆路径优化的改进禁忌搜索算法及其应用[J]. 华东理工大学学报(自然科学版), 2018, (4): 581-587. doi: 10.14135/j.cnki.1006-3080.20171130001
引用本文: 吴胜昔, 刘威, 卢文建, 顾幸生. 一类面向仓库车辆路径优化的改进禁忌搜索算法及其应用[J]. 华东理工大学学报(自然科学版), 2018, (4): 581-587. doi: 10.14135/j.cnki.1006-3080.20171130001
WU Sheng-xi, LIU Wei, LU Wen-jian, GU Xing-sheng. A Kind of Improved Tabu Search for Warehouse Vehicle Routing Optimization and Its Application[J]. Journal of East China University of Science and Technology, 2018, (4): 581-587. doi: 10.14135/j.cnki.1006-3080.20171130001
Citation: WU Sheng-xi, LIU Wei, LU Wen-jian, GU Xing-sheng. A Kind of Improved Tabu Search for Warehouse Vehicle Routing Optimization and Its Application[J]. Journal of East China University of Science and Technology, 2018, (4): 581-587. doi: 10.14135/j.cnki.1006-3080.20171130001

一类面向仓库车辆路径优化的改进禁忌搜索算法及其应用

doi: 10.14135/j.cnki.1006-3080.20171130001
基金项目: 

国家自然科学基金(61573144);上海市重点学科建设项目(B504)

A Kind of Improved Tabu Search for Warehouse Vehicle Routing Optimization and Its Application

  • 摘要: 在立体仓库中常需考虑车辆路径规划问题,传统的禁忌搜索算法在解决该类问题时,最终解的质量依赖于初始解。针对此问题并结合实际立体仓库,本文提出了改进的禁忌搜索算法。该算法的初始解部分由模拟退火算法生成,有效地克服了禁忌搜索算法对初值的依赖;规定禁忌搜索算法的特赦准则为模拟退火算法关联,在限定始末库位条件下,尽可能地寻找更短车辆路径,提高禁忌搜索算法的搜索能力。将改进的禁忌搜索算法与标准禁忌搜索算法进行仿真对比,改进算法在平均最短路径和稳定性上都有较大提升。将本文算法应用于立体仓库调度过程,在实际应用中效果良好,具备可行性。

     

  • [1] MORA M C, ARMESTO L, TORNERO J. Management and transport automation in warehouse based on auto-guided vehicles[J]. IFAC Proceedings Volumes, 2006, 39(15):671-676.
    [2] 张仰森, 刘安宇.智能化立体仓库入库货位分配的综合优化算法[J]. 计算机科学, 2010, 37(12):175-177, 189.
    [3] JIA H M, LI Y, DONG Y B, et al. An improved tabu search approach to vehicle routing problem[J]. Procedia:Social and Behavioral Sciences, 2013, 96:1208-1217.
    [4] 汤彬, 王学武, 薛立卡, 等. 基于禁忌搜索的混合算法在驾驶压力识别中的研究[J]. 华东理工大学学报(自然科学版), 2017, 43(3):417-424.
    [5] NGUYEN P K, CRAINIC T G, TOULOUSE M. A tabu search for time-dependent multi-zone multitrip vehicle routing problem with time windows[J]. European Journal of Operational Research, 2013, 231(1):43-56.
    [6] PONSICH A, COELLO C A. A hybrid differential evolution:Tabu search algorithm for the solution of job-shop scheduling problems[J]. Applied soft Computing Journal, 2013, 13(1):462-474.
    [7] JIA S, HU Z H. Path-relinking tabu search for the multi-objective flexible job shop scheduling problem[J]. Computers & Operations Research, 2014, 47(9):11-26.
    [8] GLOVER F. Futrue paths for integer programming and links on artificial intelligence[J]. Computers & Operations Research, 1986, 13(5):533-549.
    [9] GLOVER F. Tabu search:Part I[J]. ORSA Journal on Computing, 1989, 1(3):190-206.
    [10] GLOVER F. Tabu search:Part Ⅱ[J]. ORSA Journal on Computing, 1990, 2(1):4-32.
    [11] 姜兰兰,王峰.基于Metropolis模拟退火算法实现[J]. 中国科技信息, 2007(13):266-267.
    [12] LIM Y F, HONG P Y, RAMLI R, et al. An improved tabu search for solving symmetric traveling salesman problems[C]//IEEE Colloquium on Humanities, Science and Engineering. USA:IEEE, 2012:851-854.
    [13] 康立山, 谢云, 尤矢勇. 非数值并行算法——模拟退火算法[M]. 北京:科学出版社, 1998.
    [14] 张超勇, 邵新宇.作业车间调度理论与算法[M].武汉:华中科技大学出版社, 2014.
  • 加载中
图(1)
计量
  • 文章访问数:  1247
  • HTML全文浏览量:  252
  • PDF下载量:  335
  • 被引次数: 0
出版历程
  • 收稿日期:  2017-12-05
  • 刊出日期:  2018-08-28

目录

    /

    返回文章
    返回