Integrated scheduling of zone picking and vehicle routing problem with time windows in the front warehouse mode

被引:20
作者
Chen, Wei [1 ]
Zhang, Yulin [1 ]
Zhou, Yongyi [1 ]
机构
[1] Southeast Univ, Sch Econ & Management, Nanjing 211189, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Front warehouse; Integrated scheduling; Zone picking; Vehicle routing problem; Two-stage iterated search algorithm; ORDER PICKING; MULTIPLE PICKERS; DELIVERY; HYBRID; DECISIONS; BATCH;
D O I
10.1016/j.cie.2021.107823
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper examines the optimal scheduling of order picking and delivery. We present a mixed-integer model for managing integrated scheduling of zone picking and vehicle routing problem with time windows (ISZPVRPTW) in the FWM and consider the real-world factors impactive in planning order fulfillment process, such as the fulfillment deadline, convey time between the picking zones, setup time and the variable driving speed. The decisions on order batching, picking sequencing, and vehicle routing are made together. A Two-stage Iterated Search (TIS) algorithm is developed to minimize operation costs and overdue penalty costs. With extensive numerical experiments, we demonstrate the effectiveness and efficiency of the proposed approach by comparing the results produced by TIS with that of the Traditional Sequential Scheduling (TSS) approach. The results show that the TIS algorithm outperforms the traditional approach in different evaluation indicators, and the time allocation as well as the caution intensity is significant for the fulfillment expense.
引用
收藏
页数:14
相关论文
共 54 条
  • [1] [Anonymous], 2012, WAREHOUSING GLOBAL S
  • [2] [Anonymous], 1985, ALLELES LOCI TRAVELI
  • [3] Multi-period Vehicle Routing Problem with Due dates
    Archetti, Claudia
    Jabali, Ola
    Speranza, M. Grazia
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 61 : 122 - 134
  • [4] Tabu search with path relinking for an integrated production-distribution problem
    Armentano, V. A.
    Shiguemoto, A. L.
    Lokketangen, A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (08) : 1199 - 1209
  • [5] Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
    Baldacci, Roberto
    Mingozzi, Aristide
    Roberti, Roberto
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) : 1 - 6
  • [6] BigData-Research, 2019, 2019 H3 CHIN INST DE
  • [7] The vehicle routing problem: State of the art classification and review
    Braekers, Kris
    Ramaekers, Katrien
    Van Nieuwenhuyse, Inneke
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 300 - 313
  • [8] An efficient and general approach for the joint order batching and picker routing problem
    Briant, Olivier
    Cambazard, Hadrien
    Cattaruzza, Diego
    Catusse, Nicolas
    Ladier, Anne-Laure
    Ogier, Maxime
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285 (02) : 497 - 512
  • [9] Order batching operations: an overview of classification, solution techniques, and future research
    Cergibozan, Cagla
    Tasan, A. Serdar
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2019, 30 (01) : 335 - 349
  • [10] Production scheduling and vehicle routing with time windows for perishable food products
    Chen, Huey-Kuo
    Hsueh, Che-Fu
    Chang, Mei-Shiang
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) : 2311 - 2319