Please wait a minute...
浙江大学学报(工学版)
J4  2009, Vol. 43 Issue (5): 801-806    DOI: 10.3785/j.issn.1008-973X.2009.05.003
自动化技术、计算机技术     
多约束条件下自动配棉的混合遗传算法
林兰芬,欧冠男,陆俊虎
（浙江大学 人工智能研究所,浙江 杭州 310027）
Hybrid genetic algorithm for multi-constrained automatic cotton blending
LIN Lan-fen, OU Guan-nan, LU Jun-hu
(Institute of Artificial Intelligent, Zhejiang University, Hangzhou 310027, China)
 全文: PDF(650 KB)   HTML
摘要：

现有自动配棉方法求解的问题规模不大或者不易找到最优解,为此建立了一个多约束条件下自动配棉问题的数学模型.基于基本遗传算法,采用罚函数法处理多个约束条件,通过对种群进化程度进行监控并适时地增大选择压力，形成求解自动配棉问题的基于自适应罚函数法的混合遗传算法（MGA1）.进一步提出了求解自动配棉问题的基于模拟退火算法和隔代相传策略的混合遗传算法（MGA2）.以企业实际棉批库存与质量数据为例进行实验验证,结果表明,对于中小规模的配棉问题,MGA2具备较好的寻找最优解和较优解的能力,并且其解表现出多样性的特点；而对于大规模的配棉问题,MGA1保持良好的收敛性,能够找到比MGA2更好的最优解和较优解.
Abstract:

The existing methods for automatic cotton blending cannot handle large-size problems or  find the best solutions easily. A mathematic model for multi-constrained automatic cotton blending was set up.  A hybrid genetic algorithm (MGA1) based on the adaptive penalty function  was proposed, which used the penalty function to handle multi-constraints, and  improved the rate of population revolution by monitoring the extent of population revolution and increasing the selection pressure properly. Furthermore,another hybrid genetic algorithm (MGA2) based on the simulated annealing algorithm and the atavistic strategy  was proposed. Experiments were carried out to verify the proposed algorithms using the actual raw cotton stock and quality data from an enterprise. For the automatic cotton blending problem with middle and small size, MGA2 is better to find the optimum and diversiform solutions. For the automatic cotton blending problem with larger size, MGA1 can keep better astringency. And the solutions found by MGA1 are better than those of MGA2. Using MGA1 and MGA2 synthetically can satisfy different demands of cotton enterprises．
出版日期: 2009-11-18
:  TP391.75  
基金资助:

浙江省科技计划资助项目（2006C11236）.
作者简介: 林兰芬（1969-），女，浙江温州人，教授，主要从事本体论、CAX、先进产品建模、网络化制造等研究.
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　

引用本文:

林兰芬, 欧冠男, 等. 多约束条件下自动配棉的混合遗传算法[J]. J4, 2009, 43(5): 801-806.

LIN Lan-Fen, OU Guan-Nan, et al. Hybrid genetic algorithm for multi-constrained automatic cotton blending. J4, 2009, 43(5): 801-806.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2009.05.003    或    http://www.zjujournals.com/eng/CN/Y2009/V43/I5/801

［1］ 王云,刘让同,王立斌. 计算机配棉技术及其管理系统的发展［J］.棉纺技术,2001,29(10): 602604.
WANG Yun, LIU Rang-tong, WANG Li-bin. Review of computer distribution technique and its management system ［J］.Cotton Textile Technology, 2001, 29(10): 602604.
［2］ 丁志荣,钮红辛. 组合方案法的计算机配棉原理及应用
[J].纺织学报, 2002, 23(5): 395396.
DING Zhi-rong, NIU Hong-xin. Computer-based distributing material principle and application of combination schemes ［J］. Journal of Textile Research, 2002, 23(5): 395396.
［3］ 孙薇,吕蓬.目标规划在原棉混配最优决策中的应用\
[J\].中国管理科学, 2002, 10(Special): 7678.
SUN Wei, LV Peng. Application of goal pragramming method in the decision of mixed proportion of cotton ［J］. Chinese Journal of Management Science, 2002,10(Special): 7678.
［4］ VALLS V, BALLESTIN F, QUINTANILLA S. A hybrid genetic algorithm for the resource-constrained project scheduling problem ［J］. European Journal of Operational Research,  2008, 185(2): 495508.
［5］ KASHAN A H, KARIMI B, JENABI M. A hybrid genetic heuristic for scheduling parallel batch processing, machines with arbitrary job sizes ［J］. Computers and Operations  Research, 2008, 35(4): 10841098.
［6］ LEE Z J, SU S F, CHUANG C C, et al. Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment ［J］. Applied Soft Computing, 2008, 8(1):  5578.
［7］ 欧冠男. 多约束条件下计算机自动配棉技术的研究［D］. 杭州：浙江大学,2007．
OU Guan-nan. Research on the technology of multi-constrained computer automatic cotton-blending ［D］.Hangzhou: Zhejiang University, 2007．
No related articles found!