Exact algorithms for integrated facility location and production planning problems
Exact algorithms for integrated facility location and production planning problems
复制标题
DOI：
10.1002/nav.20458
复制
发表时间：
2011-08
期刊：
影响因子：
--
通讯作者：
Thomas C. Sharkey;J. Geunes;H. Edwin Romeijn;Z. Shen
中科院分区：
文献类型：
--
作者：
Thomas C. Sharkey;J. Geunes;H. Edwin Romeijn;Z. Shen
我们考虑一类具有时间维度的设施选址问题，该问题要求在有限的周期内为每个客户分配一个供应设施。通过生产和库存决策，每个工厂必须在每个时期以最低成本满足所有指定的客户需求。我们为这类问题和几个重要的变体提供了精确的分支和价格算法。相应的定价问题表现为一类有趣的生产计划和订单选择问题。这个问题类要求选择一组利润最大化的订单，定义为所选订单的收入减去完成所选订单所产生的生产计划相关成本。我们为这类定价问题提供了多项式时间动态规划算法，并对其进行了推广。计算测试表明，我们的分支和价格算法优于使用商业软件包的各种方法。这些测试还强调了将位置与生产和库存决策相结合可能节省的大量成本，并证明了该问题对与需求流相关的预测错误相当不敏感。©2011 Wiley期刊公司海军科研后勤，2011
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011