检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孔令夷[1]
出 处:《商业研究》2013年第9期62-69,共8页Commercial Research
基 金:国家自然科学基金项目;项目编号:71102149;国家社会科学基金项目;项目编号:11CJY064;工信部通信软科学研究项目;项目编号:2013R01-2;教育部人文社会科学研究项目;项目编号:12YJC790084;陕西省教育厅专项科研计划资助项目;项目编号:12JK0056;西安邮电大学青年教师科研基金项目;项目编号:ZL2011-22
摘 要:本文面向敏捷供需链动态调度时段优选方案设计,构建以最低总成本为目标的动态调度模型;基于传统遗传算法的常见缺陷以及启发式算法的局限性,提出面向敏捷供需链时段资源动态调度全局寻优的改进混沌遗传算法。首先设计分节式编码,再利用随机法与贪心法产生更优良初始种群,提高染色体可行性及遗传效果;选用优先保留交叉以及贪心机制下的目标导向变异,确保优良基因继承,改善遗传操作;实施局部邻域搜索以及混沌搜索以加快收敛;提出最优解判别法。最后,实例验证算法有效性,不但取得全局最优解,而且子体更加收敛,离散度更低。From the perspective of enterprise agility improvement, bottleneck time period resource scheduling was key to agile supply chain. Facing optimization design of dynamic time period scheduling for agile supply chain, a dynamic scheduling model was constructed with the lowest total cost target. Based on common defects of traditional genetic algo- rithm and limitations of heuristic algorithm, an improved chaos genetic algorithm was proposed for time period dynamic scheduling global optimization. Firstly, sectional type code was designed, then stochastic method and greedy method were used to produce better initial population, with high chromosome feasibility and excellent genetic effect. Further- more, priority reservation crossover and goal orientation mutation were chosen to ensure good genes inherited and improve genetic operation. Then, implementation of local neighborhood search and chaos search can speed up convergence. Opti- mal solution criterion was also put forward. Finally, validity of the algorithm was demonstrated by an example. Not only global optimal solution was obtained, but also higher daughter convergence and lower divergence were achieved.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.51