A modified RAND method with application to the multi-buyer joint replenishment problem

被引：0
|
作者：
Zhang, Xing [1 ]
Huang, Di [1 ]
机构：
[1] School of Economics and Management, Beihang University, Beijing, 100191, China
来源：
Advances in Information Sciences and Service Sciences | 2012年 / 4卷 / 01期
关键词：
Heuristic methods - Sales;
D O I：
10.4156/aiss.vol4.issue1.6
中图分类号：
学科分类号：
摘要：
The joint replenishment problem (JRP) has been studied extensively during the last two decades. However, there is limited research on dealing with the multi-buyer joint replenishment problem (MJRP) with budget constraint. In this paper, we develop a heuristic based on a modified RAND method proposed in a previous work. The performance of this heuristic is evaluated by a lower bound derived from the associated Lagrangian dual problem. Computational experiments suggest that the proposed heuristic is very efficient.
引用
收藏
页码：46 / 53
相关论文
共 50 条
  • [1] Solving the multi-buyer joint replenishment problem with the RAND method
    Li, Q
    COMPUTERS & INDUSTRIAL ENGINEERING, 2004, 46 (04) : 755 - 762
  • [2] Solving the multi-buyer joint replenishment problem with the RAND method (vol 46, pg 755, 2004)
    Huang, Di
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (01) : 182 - 183
  • [3] 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
  • [4] Scheduling of multi-buyer joint replenishments
    Chan, CK
    Li, LYO
    Ng, CT
    Cheung, BKS
    Langevin, A
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 102 (01) : 132 - 142
  • [5] A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: Advantages of meta-heuristics
    Leung, T. W.
    Chan, Chi Kin
    Troutt, Marvin D.
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2008, 4 (01) : 53 - 66
  • [6] A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem
    Khouja, M
    Michalewicz, Z
    Satoskar, SS
    PRODUCTION PLANNING & CONTROL, 2000, 11 (06) : 556 - 564
  • [7] A comparison between scatter search and the RAND method for solving the joint replenishment problem
    Gutierrez A., Miguel A.
    de-los-Cobos, S.
    Goddard, J.
    MICAI 2006: FIFTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, : 287 - +
  • [8] A dynamic model for the single-vendor, multi-buyer problem
    Bylka, S
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1999, 59 (1-3) : 297 - 304
  • [9] An Efficient Heuristic for the Two-echelon Multi-vendor Multi-buyer Optimization Problem
    Najum, Ibrahim
    Nahas, Nabil
    2021 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM21), 2021, : 113 - 117
  • [10] Common replenishment cycle with mixed batch shipment policy for a single-vendor multi-buyer integrated system
    Chiu, Chui-Yu
    Lin, Yi
    Sheu, Dwan-Fang
    Ho, Wen-Tsung
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2014, 8 (02) : 168 - 192
12345