首页 | 本学科首页   官方微博 | 高级检索  
     

含再制造的受限批量问题求解的蚁群算法
引用本文:马艳,黄玲,苏守宝. 含再制造的受限批量问题求解的蚁群算法[J]. 计算机应用与软件, 2011, 28(2)
作者姓名:马艳  黄玲  苏守宝
作者单位:1. 皖西学院信息工程系,安徽,六安,237012
2. 解放军电子工程学院,安徽,合肥,230037
基金项目:安徽省自然科学基金项目(090416249); 安徽省人文社科项目(2006sk008)
摘    要:
研究企业制造/再制造的混合生产场景,建立含再制造的库存能力受限的混合批量模型;根据问题模型的特性设计启发式蚁群算法进行求解;通过对提出的算法进行仿真实验,以验证所提算法的有效性和效率,并对参数值的选择问题做了一些探讨。

关 键 词:受限批量问题  蚁群算法  再制造  

ANT COLONIES ALGORITHM FOR SOLVING CAPACITATED LOT-SIZING PROBLEM WITH REMANUFACTURING
Ma Yan,Huang ling,Su Shoubao. ANT COLONIES ALGORITHM FOR SOLVING CAPACITATED LOT-SIZING PROBLEM WITH REMANUFACTURING[J]. Computer Applications and Software, 2011, 28(2)
Authors:Ma Yan  Huang ling  Su Shoubao
Affiliation:Ma Yan1 Huang ling2 Su Shoubao1 1(Department of Information Engineering,West Anhui University,Lu'an 237012,Anhui,China) 2(PLA Electronic Engineering Institute,Hefei 230037,China)
Abstract:
In this paper,the scene of mixed manufacturing/remanufacturing is studied,and the mixed lot-sizing model with remanufacturing and capacitated inventory capacity is built.According to the characteristic of problematical model,a heuristic ant colonies algorithm is designed to find the solution.Simulation experiment on the proposed algorithm is carried out for attesting the validity and efficiency of the algorithm,and the parameter value selection issues are discussed as well.
Keywords:Capacitated lot-sizing problem Ant colonies algorithm Remanufacturing  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号