主管：中国科学院
主办：中国优选法统筹法与经济数学研究会
　　　中国科学院科技战略咨询研究院
中国管理科学

中国管理科学 ›› 2008, Vol. 16 ›› Issue (1): 80-85.

• 论文 • 上一篇    下一篇

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

鲁奎1, 杨昌辉2, 戴道明2   

  1. 1. 中国科学技术大学管理学院 安徽合肥230026;
    2. 合肥工业大学管理学院 安徽合肥230009
  • 收稿日期:2007-04-27 修回日期:2007-12-03 出版日期:2008-02-28 发布日期:2008-02-28
  • 作者简介:鲁奎(1976- ),男(汉族),安徽人,中国科技大学管理学院博士研究生,研究方向:供应链管理、生产计划与调度、生产计划与调度.
  • 基金资助:

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

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

LU Kui1, YANG Chang-hui2, Dai Dao-ming2   

  1. 1.School of Management, University of Science and Technology of China, Hefei 230026, China;
    2. School of Management, Hefei University of Technology, Hefei 23009, China
  • Received:2007-04-27 Revised:2007-12-03 Online:2008-02-28 Published:2008-02-28

PDF (PC)

1546

被引次数

27

摘要： 当企业自身能力不能满足需求时考虑外包,可以有效提高企业的竞争力。一种带能力外包的多产品动态经济批量问题得以提出,并设定外包能力使用价格较高且费用时变。建立混合整数规划模型,通过约束松弛与模型分解,设计出一个基于拉格朗日松弛理论的启发式算法进行模型求解。大量随机实验表明,无论解的质量还是求解时间都表现较好。

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

Abstract: 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 enterprise's 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.

Key words: subco ntracting, lot sizing, lagrangian relaxation, transportation costs, heuristic algorithm

中图分类号: