论文信息 - A modified RAND algorithm for multi-buyer joint replenishment problem with resource constraints

A modified RAND algorithm for multi-buyer joint replenishment problem with resource constraints

This paper focuses on the multi-buyer jointed replenishment problem with resource constraints. The paper first establishes the general mathematical model for this jointed replenishment problem, and then modified the existing heuristic algorithm—RAND algorithm—to solve the problem, by the Lagrange Multiplier. At last, the paper also tests the feasibility of the new modified algorithm via numeric experiments and compares the efficiency of Lingo and the new algorithm.

[1] E. Arkin,et al. Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .

[2] S. K. Goyal. Analysis of Joint Replenishment Inventory Systems with Resource Restriction , 1975 .

[3] Bernard K.-S. Cheung,et al. Solving the Multi-Buyer Joint Replenishment Problem with a Modified Genetic Algorithm , 1999 .

[4] E. Silver. A Simple Method of Determining Order Quantities in Joint Replenishments Under Deterministic Demand , 1976 .

[5] Meir J. Rosenblatt,et al. An Improvement of Silver's Algorithm for the Joint Replenishment Problem , 1983 .

[6] S. Goyal. Determination of Optimum Packaging Frequency of Items Jointly Replenished , 1974 .

[7] Qing Li. Solving the multi-buyer joint replenishment problem with the RAND method , 2004, Comput. Ind. Eng..

[8] B. C. Cha,et al. The joint replenishment problem with resource restriction , 2006, Eur. J. Oper. Res..

[9] Suresh Goyal,et al. A review of the joint replenishment problem literature: 1989-2005 , 2008, Eur. J. Oper. Res..