首页> 外文期刊>Applied Mathematical Modelling >Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: Two calibrated meta-heuristic algorithms
【24h】

Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: Two calibrated meta-heuristic algorithms

机译:具有折扣现金流和通货膨胀的多项目多期间库存控制系统的优化:两种校准的元启发式算法

获取原文
获取原文并翻译 | 示例

摘要

A mixed binary integer mathematical programming model is developed in this paper for ordering items in multi-item multi-period inventory control systems, in which unit and incremental quantity discounts as well as interest and inflation factors are considered. Although the demand rates are assumed deterministic, they may vary in different periods. The situation considered for the problem at hand is similar to a seasonal inventory control model in which orders and sales happen in a given season. To make the model more realistic, three types of constraints including storage space, budget, and order quantity are simultaneously considered. The goal is to find optimal order quantities of the products so that the net present value of total system cost over a finite planning horizon is minimized. Since the model is NP-hard, a genetic algorithm (GA) is presented to solve the proposed mathematical problem. Further, since no benchmarks can be found in the literature to assess the performance of the proposed algorithm, a branch and bound and a simulated annealing (SA) algorithm are employed to solve the problem as well. In addition, to make the algorithms more effective, the Taguchi method is utilized to tune different parameters of GA and SA algorithms. At the end, some numerical examples are generated to analyze and to statistically and graphically compare the performances of the proposed solving algorithms.
机译:本文开发了一种混合二进制整数数学规划模型,用于在多项目多周期库存控制系统中订购物料,其中考虑了单位和增量数量折扣以及利息和通胀因素。尽管假设需求率是确定的,但它们可能在不同时期内有所不同。针对当前问题考虑的情况类似于季节性库存控制模型,在该模型中,订单和销售在给定的季节内发生。为了使模型更实际,同时考虑了三种类型的约束,包括存储空间,预算和订单数量。目的是找到最佳的产品订购量,以便在有限的计划范围内将总系统成本的净现值减至最小。由于该模型是NP难模型,因此提出了一种遗传算法(GA)来解决所提出的数学问题。此外,由于在文献中找不到基准来评估所提出算法的性能,因此也采用分支定界和模拟退火(SA)算法来解决该问题。另外,为了使算法更有效,利用Taguchi方法来调整GA和SA算法的不同参数。最后,生成了一些数值示例,以分析,统计和图形比较所提出的求解算法的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号