一种能力外包且费用时变批量问题的启发式算法  

A Heuristic Algorithm for Multi-Product Capacitated Lot Sizing with Subcontracting and Time-varying Transportation Costs

作　　者：鲁奎[1] 杨昌辉 戴道明 

机构地区：[1]中国科学技术大学管理学院,安徽合肥230026 [2]合肥二业大学管理学院,安徽合肥230009

出　　处：《中国管理科学》2008年第1期80-85,共6页Chinese Journal of Management Science

基　　金：国家自然科学基金重点项目(70631003)

摘　　要：当企业自身能力不能满足需求时考虑外包,可以有效提高企业的竞争力。一种带能力外包的多产品动态经济批量问题得以提出,并设定外包能力使用价格较高且费用时变。建立混合整数规划模型,通过约束松弛与模型分解,设计出一个基于拉格朗日松弛理论的启发式算法进行模型求解。大量随机实验表明,无论解的质量还是求解时间都表现较好。Subcontracting capacity to third parties has become a prevalent practice for improving an enterprise＇s competitive power and agility. In the problem, each order placed in a period is immediately shipped by some containers in the period and the total freight cost is proportional to the number of containers used. If the number of enterprisers containers is insufficient, then the enterprise needs to contract additional transportation capacity on the spot market, where the price of single container is higher and time-varying. The simultaneous determination of the lot sizes and the transportation policy that minimizes the total costs, including ordering cost, inventory holding cost and freight cost, is dealt with. As the problem is NP-hard, a lagrangian-based heuristic algorithm is proposed to compute lower and upper bounds, of which the comprehensive computational experiments show the compelling performance in terms of quality and speed.

关 键 词：外包 批量 拉格朗日松弛 运输成本 启发式算法 

分 类 号：O221.7[理学—运筹学与控制论]