基于改进蚁群算法的双向物流路径优化-JournalofNortheastern.PDFVIP

第33 卷第9期 东 北 大 学 学 报 ( 自 然 科 学 版 ) V ol33, N o 9 2 0 1 2 年 9 月 Journal of N ort heastern U niversity( N atural Science) Sep 2 0 1 2 徐久强, 邢佩龙, 孔秋实, 刘大鹏 ( , 110819) : , , , , , , , : ; ; ; ; : T P 391 : A : 1005- 3026 ( 2012) 09- 124 0- 05 Logistics Routing Optimization Based on Improved Ant Colony Algorithm X U J iu-qiang , X IN G Pei-long , K ON G Qiu-shi, LI U D a-p eng ( School of Inf orm ation Science Engineering, Northeaster n U niv ersity, Shenyang 110819, China Corresponding author : XU J iu- qiang, E- m ail: xujiu qiang @ ise neu edu cn) Abstract: Due to comput at ion complexit y, low er accuracy and premat ure converg ence of t he conventional algorit hm , the ant colony algorit hm w as improved t o solve t he rout ing problem of logistics In order to eliminate t he problems t hat ant colony algorit hm is easy t o be stagnant and it s convergence is slow , t he algorit hm w as improved inclu ding the follow ing points such as t he tran sfer st rategies of t he ant s, t he pheromone update method and t he integ rat ion of genet ic algorit hm T o solve t he path optimizat ion of simult aneous delivery and pickup, t he heurist ic funct ion w as added and t he transfer st rat eg ies w ere designed, w hich m ade the algorit hm conduct a search by considering a combinat ion of factors reasonably, and could find the next rig ht point more comprehensively and more accurately, t hen, a bet t er p at h could be got ten Key words: logist ics rout ing opt imizat ion ; ant colony alg orit hm; heuristic f unction; transfer st rat egy ; vehicle routing w it h simultaneous delive