A new iterative heuristic to solve the joint replenishment problem using a spreadsheet technique

被引:33
|
作者
Nilsson, Andreas [1 ]
Segerstedt, Anders
van der Sluis, Erik
机构
[1] Lulea Univ Technol, Div Ind Logist, S-97187 Lulea, Sweden
[2] Univ Amsterdam, Fac Econ & Econometr, NL-1018 WB Amsterdam, Netherlands
关键词
inventory; joint replenishment; heuristics;
D O I
10.1016/j.ijpe.2006.12.022
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a heuristic method is presented which gives a novel approach to solve joint replenishment problems (JRP) with strict cycle policies. The heuristic solves the JRP in an iterative procedure and is based on a spreadsheet technique. The principle of the recursion procedure is to find a balance between the replenishment and inventory holding costs for the different items by adjusting the replenishment frequencies. The heuristic is also tested according to an extensive test template and shows pleasing results. It also performs well in comparison with many other heuristics. (C) 2007 Published by Elsevier B.V.
引用
收藏
页码:399 / 405
页数:7
相关论文
共 50 条
  • [31] 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
  • [32] A differential evolution algorithm for joint replenishment problem using direct grouping and its application
    Wang, Lin
    He, Jing
    Zeng, Yu-Rong
    EXPERT SYSTEMS, 2012, 29 (05) : 429 - 441
  • [33] Constraint multiproduct joint-replenishment inventory control problem using uncertain programming
    Taleizadeh, Ata Allah
    Niaki, Seyed Taghi Akhavan
    Nikousokhan, Ramin
    APPLIED SOFT COMPUTING, 2011, 11 (08) : 5143 - 5154
  • [34] A NEW ITERATIVE SCHEME USING INERTIAL TECHNIQUE FOR THE SPLIT FEASIBILITY PROBLEM WITH APPLICATION TO COMPRESSED SENSING
    Kesornprom, Suparat
    Cholamjiak, Prasit
    THAI JOURNAL OF MATHEMATICS, 2020, 18 (01): : 315 - 332
  • [35] Using an iterative procedure of maximum likelihood estimations to solve the newsvendor problem with censored demand
    Clausen, Johan Bjerre Bach
    Larsen, Christian
    Omega (United Kingdom), 2025, 133
  • [36] Intelligent algorithms for a new joint replenishment and synthetical delivery problem in a warehouse centralized supply chain
    Cui, Ligang
    Wang, Lin
    Deng, Jie
    Zhang, Jinlong
    KNOWLEDGE-BASED SYSTEMS, 2015, 90 : 185 - 198
  • [37] A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem
    D. Arzelier
    C. Louembet
    A. Rondepierre
    M. Kara-Zaitri
    Journal of Optimization Theory and Applications, 2013, 159 : 210 - 230
  • [38] A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem
    Arzelier, D.
    Louembet, C.
    Rondepierre, A.
    Kara-Zaitri, M.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2013, 159 (01) : 210 - 230
  • [39] New Laplace variational iterative technique to solve two-dimensional Schro?dinger equations
    Singh, Gurpreet
    Singh, Inderdeep
    MATERIALS TODAY-PROCEEDINGS, 2022, 62 : 3995 - 4000
  • [40] A new heuristic algorithm to solve Circle Packing problem inspired by nanoscale electromagnetic fields and gravitational effects
    Martinez-Rios, Felix
    Antonio Marmolejo-Saucedo, Jose
    Murillo-Suarez, Alfonso
    2018 NANOTECHNOLOGY FOR INSTRUMENTATION AND MEASUREMENT (NANOFIM), 2018,