【正文】 單并且容易懂。但是由于時(shí)間有限，考慮到的的可能性不能很周全，問題處理的不是那么的盡善盡美，只能達(dá)到小型的物流配送的一個(gè)過程的優(yōu)化。課題中設(shè)計(jì)的功能也并不是那么的全面，規(guī)模更是不夠那么的強(qiáng)大。因此，本課題有有待進(jìn)一步深入的提高改進(jìn)，使得本課題的設(shè)計(jì)更加的趨于完善和功能完全。離散粒子群算法較免疫算法、生成樹算法和遺傳算法都具有比較明顯的優(yōu)勢，在實(shí)際應(yīng)用中能提高計(jì)算的時(shí)間，較好的選擇出較優(yōu)路徑，同時(shí)算大理解容易，實(shí)現(xiàn)速度快并具有較強(qiáng)的收斂性，被廣泛的應(yīng)用到其他的研究領(lǐng)域。參考文獻(xiàn)[1]　Kennedy J,EberhartR C . Particle swarm optim ization [G ]//Proc of IEEE Int Conf on York: IEEE, 1995: 19421948.[2] 高鷹,[J].計(jì)算機(jī)工程與應(yīng)用, 2004(6): 462.[3] . A. Wassan, . A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 2008,15: 368386.[4] , , , . Reducing traveled distance in the vehicle routing problem with time windows using a multistart simulated annealing. International Joint Conference on Neural Networks 2006, IJCNN 39。06, 2006: 30133020.[5] F. Alonso, M. J. Alvarez, J. . A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society, 2008,59: 963976.[6] P. P. Repoussis, Tarantilis, G Ioannou. A hybrid metaheuristic for a real life vehicle routing problem. Lecture Notes in Computer Science, Numerical Methods and Applications 6th International Conference, NMA 2006, (4310): 247254.[7] A. Goel, V Gruhn. A General Vehicle Routing Problem. European Journal of Operational Research, 2008, 191 (3): 650660.[8] , , . A discrete time dynamic fow model and a formulation and solution method for dynamic route choice [J]. Transportation Research Part B, 2005, 39(7): 593620.[9] , , , . A robust branchcutandprice algorithm for the heterogeneous fleet vehicle routing problem. Lecture Notes in Computer Science, v4525LNCS, Experimental Algorithms6th International Workshop, WEA 2007, Proceedings, 2007: 150160.[10] I. Gribkovskaia, G. Laporte, A. Shyshou. The single vehicle routing problem with deliveries and selective pickups. Computers and Operations Research, 2008,(35): 29082924. [11] P. , C. D. Tarantilis, . The open vehicle routing problem with time windows Journal of the Operational Research Society, 2007,58: 355367.[12] Zhu Qing, Qian. Limin. Li. Yingchun, Zhu Shanjun. An improved particle swarm optimization algorithm for vehicle routing problem with time windows. 2006 IEEE Congress on Evolutionary Computation, CEC 2006: 13861390. [13] N. A. Wassan. A reactive tabu search for the vehicle routing problem. Journal of the Operational Research Society, 2006,57: 111116. [14] . J. Renaud, F. Boctor, . A perturbation metaheuristic for the vehicle routing problem with private fleet and mon carriers. Journal of the Operational Research Society, 2008,59: 776787. [15] , , . Hybrid adaptive predictive control for the multivehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering. COMPUTERS amp。 OPERATIONS RESEARCH, 2008,35: 34123438.[16] , , . Competitive analysis of a dispatch policy for a dynamic multiperiod routing problem. OPERATIONS RESEARCH LETTERS. 2007,35: 71372.[17] 龍磊,陳秋雙,華彥寧,14(3):549557. [18] 王素欣,高利,崔小光, 2008,34(1):02104. [19] 陳萍,黃厚寬,31(4):565573.[20] 彭春林,梁春華,20(9):22662270. [21] 丁秋雷,胡祥培,李永先,求解有時(shí)間窗的車輛路徑問題的混合蟻群算法系統(tǒng)工程理論與實(shí)踐. 2007,10:9810.[22] Clerc M． Discrete particle swarm optimization － illustrated by the traveling salesman problem［EB/OL］． 2000 － 02 － 29． :/ / clerc． maurice． free． fr /pso /pso_tsp /．[23] 郭文忠,陳國龍．求解TSP 問題的模糊自適應(yīng)粒子群算法[J］． 計(jì)算機(jī)科學(xué),2006,33( 6) : 161 － 162．[24] Chen En － xiu,Li Jian － qing，Liu Xi － yu． In search of the essential binary discrete particle swarm［J］． Applied Soft Computing Journal,2011,11( 3) : 3 260 － 3 269．[25] 賀毅朝,王熙照,寇應(yīng)展． 一種具有混合編碼的二進(jìn)制差分演化算法［J］． 計(jì)算機(jī)研究與發(fā)展,2007，44( 9) : 1476－1484．636第5 期郭文忠,等: 離散粒子群優(yōu)化算法研究綜述.[26] Ren Zi － hui,Wang Jian． A discrete particle swarm optimization for solving multiple knapsack problems［C］/ / 5th International Conference on Natural Computation． Tianjin: ［s． n．］,2009: 166－170．[27] Sun Tsung － ying,Hsieh Sheng － ta,Wang Hsiang － min，et al． Floorplanning based on particle swarm optimization［C］/ /2006 IEEE Computer Society Annual Symposium on VLSI． Karlsruhe: ［s． n．］,2006:7－11．[28] Chen Guo － long，Guo Wen － zhong，Chen Yu － zhong． A PSO － based intelligent decision algorithm for VLSI floorplanning［J］． Soft Computing，2010，14( 12):1329－1337．[29] Dong Chen,Wang Gao － feng，Chen Zhen － yi，et al． A VLSI routing algorithm based on improved DPSO［C］/ / IEEE International Conference on Intelligent Computing and Intelligent Systems． Shainghai:［s．n．］,2009: 802－805．[30] 劉耿耿,王小溪,陳國龍等． 求解VLSI 布線問題的離散粒子群優(yōu)化算法［J］． 計(jì)算機(jī)科學(xué),2010，37( 10):197－201．[31] Salmen A,Ahmad I,AIMadani B. Particle swarm optimization for task assignment problem[J]. Microprocessors and Mierosystenm,2002,26:363371.[32] 李寧,鄒彤,[J].系統(tǒng)工程學(xué)報(bào),2004,41（23）：4346.[33] 李軍,郭耀煌. 物流配送車輛優(yōu)化調(diào)度理論與方法[M].北京：中國物流出版社,2001.謝辭在我的畢業(yè)論文完成之際，我想在這里向指導(dǎo)和幫助我的各位老師和同學(xué)們致以衷心的感謝。是你們在我的學(xué)習(xí)和生活中，給了巨大的關(guān)心和幫助。我要衷心的感謝我的導(dǎo)師伍大清老師，在她的悉心指導(dǎo)和不斷的思維引導(dǎo)下，我的設(shè)計(jì)和論文終于得以完成，設(shè)計(jì)中每一部分和論文的每一字都滲透著她的辛勤汗水和心血!沒有她的熱心指導(dǎo)和嚴(yán)格要求，我不會(huì)有今天的蛻變成長!我的每一點(diǎn)進(jìn)步都離不開伍老師的諄諄教導(dǎo)!伍老師嚴(yán)謹(jǐn)治學(xué)、精益求精的工作作風(fēng)、平易近人、誨人不倦的態(tài)度，所有的一切對我產(chǎn)生了巨大的影響，使我受益終身!我也要感謝其他關(guān)心和幫助我的師長，同學(xué)，朋友，在這里向一直支持我的你們表達(dá)深深的謝意! 同時(shí)，也感謝參加評審答辯的各位老師!第 34 頁 共 41 頁