基于混合蚁群算法的动态设施规划系统研究  

Dynamic Facility Layout Problem Systems Based on Hybrid Ant Colony Optimization Algorithm

作　　者：李辉[1] 黄国文[1] 齐二石[1] 

机构地区：[1]天津大学管理与经济学部,天津300072

出　　处：《管理工程学报》2014年第1期110-118,共9页Journal of Industrial Engineering and Engineering Management

基　　金：国家自然科学基金面上资助项目(70671072)

摘　　要：设施规划问题主要研究生产设备的布局规划,从而减小厂区内的物料搬运成本。一个有效的设施规划有利于生产过程中整体运作效率的提高。随着市场竞争的日趋激烈,市场环境处于不断的变化之中。制造企业需不断对设施布局进行重新规划来适应不断变化的市场环境对产品需求量的影响,并达到降低成本的目的。这一问题便需要用动态设施规划(DFLP)的方法来解决。本文提出了一种改进的混和蚁群算法(HACO)来解决带有财务预算约束的动态设施规划问题,并将此方法与其他一些典型的启发式算法进行了对比分析。结果表明,本文提出的HACO算法是求解带有财务预算约束的DFLP问题的一种有效的方法。Facility layout studies mainly address problems related to manufacturing facility layout in order to reduce the material handling costs in the plant.An effective facility layout method can improve the overall operational efficiency during the manufacturing process.With the increasingly fierce competition in the market,manufacturing enterprises must continuously redesign their facility layout in order to adapt to the changing production demand and reduce the cost.The Dynamic facility layout problem （DFLP） could be an effective solution to solve these layout problems.The total cost of DFLP is comprised of the total material handling cost between facilities and the redesign cost of manufacturing systems during each time.Therefore,the objective function of DFLP is usually defined as the minimization of the sum of the total material handling cost between facilities and the redesign cost of manufacturing system during each time.This paper considers the impact of financial budget on DFLP.In some stages,due to the constraints of financial budget redesigning cannot be actually implemented even if it is beneficial to the manufacturing system.This paper proposes an improved hybrid ant colony optimization （HACO） model to solve DFLP with budget constraints.Ant colony optimization algorithm （ACO） is a new kind of heuristic algorithms developed in the past few years.In recent years,ACO is used to solve a series of NP-hard problems such as processing plant schedule problem,graph coloring problem,quadratic assignment problem,and vehicle routing problem.The fundamental idea of ACO is based on the behavior of natural ants that succeed in finding the shortest path from their nest to food sources via pheromone trails.The core content of ACO consists of the following three parts：selection,update and coordination mechanisms.Selection mechanism is that the more the pheromone on one path,the more probable the path will be selected.Update mechanism is that the pheromone concentration on one path will increase along with the

关 键 词：动态设施规划 混合蚁群算法 财务预算约束 

分 类 号：F273[经济管理—企业管理]