《引入随机子群蚁算法》由会员分享，可在线阅读，更多相关《引入随机子群蚁算法（6页珍藏版）》请在金锄头文库上搜索。
1、1 45 ?1 1 2009 c 2 ?=?g,? Journal of Lanzhou University (Natural Sciences)Vol. 45 No. 1 Feb. 2009?: 0455-2059(2009)01-0120-06?fff+? JSP?u, fl, ?fl, g+?(Hfi?U? gz?, Hfi210016)?: ?IO+?u?y?“?, 3?k?:?+.3zL?+?V?|, *?)?|?m; 3.?mN?flK(JSP)?1?, LT?=U?y?, ?U?fl?.?c: +z?; ?f+; ?mN?flK; |?za?: TP18; TP301zI: A
2、Simulation and study on JSP by using the ant colony optimizationalgorithm with a random subgroupHU Zhong-hua, ZHAO Min, YAO Min, SA Peng-fei(College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)Abstract: To solve the problem that any standard c
3、olony algorithm often gets stuck into premature stag-nation after the iteration process, an improved algorithm was presented in this paper, which can enlargethe searching space of results by adopting a scouting subgroup, search the route at a certain probability,restrain premature stagnation and spe
4、ed up constringency by the omnibus pheromones updating strategy.The strategy used the iteration-best-ant of scouting subgroup and remaining subgroup and global-ant atthe same time to make use of both the current and past results. Three typical job-shop schedule problem(JSP) samples were practiced an
5、d the results showed that this algorithm can avoid pre-maturity and advanceconstringency.Key words: ACO; scouting subgroup; job-shop schedule problem; combinatorial optimizationCc5, +N?Uz?5?t5, =k?c?, d?S ?uP. l?!:8S UV?Je?!:, ?T!:L?v?9?m?m, =Tbegin(i, j), ?k!:?J. 2 ?N?L?mFig. 2 Machine operation ti
6、me during job schedule3IIIOOO+?)JSPflflflKKK?mg+?o?, tij(i, j =1, ,n)L!:j ?m, ij(N)LS?NC g?3!:i?j ?&E?. S?,?&E?, ?ij(0) = h(h?). k (k = 1, 2, , mg)3$L, ?&E?=?, Pkij(N) L1N ?k l!:i=?!:j ?V,?O?“X(1)“8-10:Pkij(N) =ij(N)ij(N)PrAkij(N)is(N),j, s Ak,0,?.(1)?: AkLk e?J?!:. ?S+?, f?, 2005, 33(6): 991-994.8 w, ? ?, ?( S_. ? )Job ShopflK?.?z?J. I?, 2007,18(20): 2449-2455.9?, &, M#i. uHopfield ?m)?N?J. gz?, 2002,28(05): 838-844.10?, ?, =. uD?mN?zJ. &E?, 2002, 31(3): 216-218.11?, ?, x. u?d?m?N?J. ?, 2005, 41(3):25-31.125$?, ?, o?_. uAgent?Job ShopN?J. I?, 2004, 15(10): 873-877.
