An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration

被引:9
|
作者
Yao, Ming-Jong [1 ]
Lin, Jen-Yen [2 ]
Lin, Yu-Liang [1 ,3 ]
Fang, Shu-Cherng [3 ]
机构
[1] Natl Chiao Tung Univ, Dept Transportat & Logist Management, Hsinchu 30010, Taiwan
[2] Natl Chiayi Univ, Dept Appl Math, Chiayi 60004, Taiwan
[3] North Carolina State Univ, Edward P Fitts Dept Ind & Syst Engn, Raleigh, NC 27695 USA
关键词
Joint replenishment; Districting problem; Genetic algorithm; DELIVERY; PROBABILITIES; FORMULATION; CROSSOVER; MUTATION;
D O I
10.1016/j.tre.2020.101896
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper studies a multi-customer joint replenishment problem with districting consideration (MJRPDC) which is of particular importance to a company that outsources its transportation and delivery operations to a third-party logistics (3PL) service provider. To solve the problem, we first propose an innovative search algorithm for solving the traditional multi-customer joint replenishment problem in a given zone. Then we design a GA-based framework to handle the corresponding districting problem based on the performance of each district evaluated by using the proposed search algorithm. The proposed methodologies are demonstrated by using an example of solving MJRPDC for a bank.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] A hybrid Genetic Algorithm approach to minimize the total joint cost of a single-vendor multi-customer integrated scheduling problem
    Grunder, Olivier
    Hammoudan, Zakaria
    Beroule, Benoit
    Barakat, Oussama
    TRANSPORTATION PLANNING AND TECHNOLOGY, 2019, 42 (06) : 625 - 642
  • [2] Solving the multi-buyer joint replenishment problem with a modified genetic algorithm
    Chan, CK
    Cheung, BKS
    Langevin, A
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (03) : 291 - 299
  • [3] SOLVING JOINT REPLENISHMENT PROBLEM WITH DETERIORATING ITEMS USING GENETIC ALGORITHM
    Li, Chengyan
    Xu, Xiaofei
    Zhan, Dechen
    JOURNAL OF ADVANCED MANUFACTURING SYSTEMS, 2009, 8 (01) : 47 - 56
  • [4] Solving the joint replenishment problem with warehouse-space restrictions using a genetic algorithm
    Ming-Jong Yao
    GLOBALIZATION CHALLENGE AND MANAGEMENT TRANSFORMATION, VOLS I - III, 2007, : 302 - 307
  • [5] SOLVING THE JOINT REPLENISHMENT PROBLEM WITH WAREHOUSE-SPACE RESTRICTIONS USING A GENETIC ALGORITHM
    Yao, Ming-Jong
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2007, 24 (02) : 128 - 141
  • [6] A new optimal algorithm for the joint replenishment problem
    Viswanathan, S
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (07) : 936 - 944
  • [7] Differential Evolution Algorithm for Constraint Joint Replenishment Problem
    Li, C. Y.
    Gao, J.
    Zhang, T. W.
    Wang, X. T.
    2014 8TH INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING (FGCN), 2014, : 64 - 67
  • [8] An Algorithm for the Joint Replenishment Problem with Multiple Resource Constraints
    Xu, Hui
    Jin, Shi-liang
    Hong, Yue
    2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 6394 - 6397
  • [9] A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items
    Ongkunaruk, P.
    Wahab, M. I. M.
    Chen, Y.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 175 : 142 - 152
  • [10] Analytical study of the multi-item joint replenishment problem
    Huang, Shuo
    Chen, Jian
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2007, 27 (12): : 90 - 95