拉格朗日松弛
供应链
联营
数学优化
供应链网络
启发式
提前期
计算机科学
整数规划
放松(心理学)
设施选址问题
网络规划与设计
供应链管理
运筹学
数学
运营管理
工程类
业务
心理学
社会心理学
人工智能
营销
计算机网络
作者
Sukun Park,Tae‐Eog Lee,Chang Sup Sung
标识
DOI:10.1016/j.tre.2009.12.004
摘要
This paper considers a single-sourcing network design problem for a three-level supply chain consisting of suppliers, distribution centers (DC’s) and retailers, where risk-pooling strategy and DC-to-supplier dependent lead times are considered. The objective is to determine the number and locations of suppliers and DC’s, the assignment of each location-fixed DC to a supplier and that of each retailer to a DC, which minimizes the system-wide location, transportation, and inventory costs. The problem is formulated as a nonlinear integer programming model, for which a two-phase heuristic solution algorithm is derived based on the Lagrangian relaxation approach. Numerical experiments show that the proposed heuristic is effective and also efficient.
科研通智能强力驱动
Strongly Powered by AbleSci AI