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

基于遗传算法的产品分配方案研究
引用本文:陈菊新,徐建闽,辛武平. 基于遗传算法的产品分配方案研究[J]. 华南理工大学学报(自然科学版), 2001, 29(2): 90-93
作者姓名:陈菊新  徐建闽  辛武平
作者单位:华南理工大学交通学院,
基金项目:国家自然科学基金资助项目! (6 99740 16 )
摘    要:建立了产品分配的时变模型 ,并将其分为两层子问题 .下层子问题为基本的运输问题 ,按一般的线性方程求解 ;上层子问题则求系统的最小成本 ,采用遗传算法进行求解 .同时 ,还进行了大量的计算机实验 ,并在实验过程中将遗传算法与实现产品分配时常用的算法进行了比较 .结果表明 :采用本研究所建模型 ,并利用遗传算法进行求解 ,可以取得相当好的效果 ,具有实现简单、收敛时间短等优点 .

关 键 词:遗传算法  产品分配  中转站
文章编号:1000-565X(2001)02-0090-04
修稿时间:2000-05-26

Transshipment-Related Products Assignment Problem Based on Genetic Algorithm
Chen Ju_xin Xu Jian_min Xin Wu_ping. Transshipment-Related Products Assignment Problem Based on Genetic Algorithm[J]. Journal of South China University of Technology(Natural Science Edition), 2001, 29(2): 90-93
Authors:Chen Ju_xin Xu Jian_min Xin Wu_ping
Abstract:A time_variant model of a transshipmint_related products assignment problem is stablished in this paper. The problem is formulated as a bilevel programming problem. The lower_level subprogram is the basic transshipment problem,which can be solved by common linear programming routines. The upper_level subprogram is to make the system cost lowest, which can be solved by a genetic algorithm. A lot of computational experiments are carried out and during the experiments, the comparison between genetic algorithm and common routine is presented. It is shown that the proposed model has the advantages of simplicity and short convergence time by using genetic algorithm.
Keywords:genetic algorithm  product transshipment  transportation location
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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