解批量问题的模拟退火算法  

Simulated Annealing Heuristic for Lot Sizing Problem

作　　者：韩丽敏[1] 王飞[1] 冯允成[1] 

机构地区：[1]北京航空航天大学管理学院

出　　处：《北京航空航天大学学报》1999年第5期588-591,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家自然科学基金

摘　　要：多品种、有能力约束的批量问题是多品种批量生产中生产计划的关键性问题．这一问题就是要确定：在每一期生产多少产品以使得所用费用最少且满足已知的每一期的需求量．本文设计了一种模拟退火算法的实现形式，通过大量的算例分析表明。The multi item capacitated lot sizing problem consists of determining the magnitude and the timing of some operations of durable results for several items in a finite number of processing periods so as to satisfy a known demand in each period. An approximation algorithm is described, which is based on simulated annealing algorithm. The method incorporates a primal partitioning scheme?? #with a network flow subproblem?? #to obtain good feasible solutions.

关 键 词：批量 启发式 网络流 模拟退火算法 生产计划 

分 类 号：F224.3[经济管理—国民经济] O22[理学—运筹学与控制论]