本文選題：戰(zhàn)時(shí) + 物流配送��； 參考：《國(guó)防科學(xué)技術(shù)大學(xué)》2015年碩士論文

【摘要】：隆美爾曾說過,“戰(zhàn)斗在第一槍打響之前是由軍需官?zèng)Q定的。”阿富汗戰(zhàn)爭(zhēng)、海灣戰(zhàn)爭(zhēng)、伊拉克戰(zhàn)爭(zhēng)、利比亞戰(zhàn)爭(zhēng)等一系列戰(zhàn)爭(zhēng)實(shí)踐表明,隨著戰(zhàn)爭(zhēng)信息化程度的不斷加深,其對(duì)后勤補(bǔ)給的依賴也更加明顯。物流配送是保障物資交付作戰(zhàn)部隊(duì)的最后一環(huán),也是最為重要、最為困難、最為危險(xiǎn)的一環(huán)。本文基于軍事物流的需求背景開展戰(zhàn)時(shí)物流配送車輛路徑優(yōu)化問題研究,主要的工作和成果如下:1.在介紹了我國(guó)物流業(yè)總體發(fā)展情況的基礎(chǔ)上,分析車輛路徑問題的理論價(jià)值和現(xiàn)實(shí)意義。以美軍實(shí)際作戰(zhàn)行動(dòng)為例闡述了軍事物流在后勤保障中的重要作用,從而進(jìn)一步論述了戰(zhàn)時(shí)車輛路徑優(yōu)化問題的重要性。對(duì)車輛路徑問題的國(guó)內(nèi)外研究現(xiàn)狀進(jìn)行了綜述。2.從我軍軍事物流發(fā)展現(xiàn)狀、戰(zhàn)時(shí)物流配送的特點(diǎn)入手,對(duì)戰(zhàn)時(shí)物流配送車輛路徑優(yōu)化問題的主要影響因素展開分析。3.在對(duì)車輛路徑問題基本模型和常用算法進(jìn)行簡(jiǎn)要分析的基礎(chǔ)上,將蟻群算法中信息素更新方式進(jìn)行了改進(jìn)。通過與文獻(xiàn)中算例結(jié)果的對(duì)比分析,表明本文改進(jìn)算法一方面提高了計(jì)算效率,另一方面能夠獲得更優(yōu)解。此外,采用Solomon標(biāo)準(zhǔn)測(cè)試數(shù)據(jù)中的C1、C2類數(shù)據(jù)進(jìn)行了檢驗(yàn),在C1類9組數(shù)據(jù)中,本文算法得出的7條優(yōu)化路線達(dá)到了用啟發(fā)式算法得出的最知名解(Best Known Solutions Identified by Heuristics),其余2組數(shù)據(jù)的優(yōu)化結(jié)果也非常接近該最知名解,在C2類8組數(shù)據(jù)中,本文算法得出的8條優(yōu)化路線全部達(dá)到了用啟發(fā)式算法得出的最知名解,進(jìn)一步證明了本文改進(jìn)算法的有效性。4.在建立了帶硬時(shí)間窗的蟻群算法模型的基礎(chǔ)上,針對(duì)戰(zhàn)時(shí)物流配送過程中敵方火力打擊對(duì)運(yùn)輸線路的影響、對(duì)運(yùn)輸物資造成的損失等因素改進(jìn)了算法模型。將算法應(yīng)用于考慮路面毀傷、物資損耗的戰(zhàn)時(shí)物流配送問題,得出了靜態(tài)最優(yōu)路線,并通過仿真計(jì)算檢驗(yàn)了線路的合理性。又進(jìn)一步貼近戰(zhàn)場(chǎng)實(shí)際,將作戰(zhàn)單元對(duì)物資的需求變化、戰(zhàn)場(chǎng)路況變化納入模型之中,通過對(duì)算法的適當(dāng)調(diào)整,使得模型能夠解決動(dòng)態(tài)問題,計(jì)算出了最優(yōu)路線,并通過仿真實(shí)驗(yàn)檢驗(yàn)了算法的合理性和有效性。
[Abstract]:Rommel once said, "the battle was decided by the quartermaster before the first shot was fired."A series of war practices such as Afghanistan, Gulf, Iraq and Libya show that with the deepening of war informatization, its dependence on logistics supplies is more obvious.Logistics distribution is the last link to ensure the delivery of materials to combat troops, is also the most important, the most difficult, the most dangerous link.Based on the demand background of military logistics, this paper studies the vehicle routing optimization in wartime logistics distribution. The main work and results are as follows: 1.Based on the introduction of the general development of the logistics industry in China, the theoretical value and practical significance of the vehicle routing problem are analyzed.Taking the actual operations of the US military as an example, this paper expounds the important role of military logistics in logistics support, and further discusses the importance of vehicle routing optimization in wartime.The research status of vehicle routing problem at home and abroad is summarized.Based on the current situation of military logistics development and the characteristics of wartime logistics distribution, this paper analyzes the main influencing factors of vehicle routing optimization in wartime logistics distribution.Based on the analysis of the basic model and common algorithms of vehicle routing problem, the pheromone updating method in ant colony algorithm is improved.By comparing with the results of the numerical examples in the literature, it is shown that the improved algorithm can improve the computational efficiency and obtain a better solution on the other hand.In addition, the C _ 1C _ 2 data from Solomon standard test data are used to test, and in C _ 1 class 9 groups of data,The seven optimization routes obtained by this algorithm reach the best Known Solutions Identified by heuristic algorithm, and the optimization results of the other two groups of data are very close to the best known solution, in the C2 class of 8 groups of data.All of the 8 optimized routes obtained by this algorithm reach the best known solution obtained by heuristic algorithm, which further proves the effectiveness of the improved algorithm in this paper. 4.Based on the ant colony algorithm model with hard time window, the algorithm model is improved in view of the influence of enemy firepower attack on transportation route and the loss of transportation materials in wartime logistics distribution process.The algorithm is applied to the wartime logistics distribution problem considering road damage and material loss, and the static optimal route is obtained, and the rationality of the route is verified by simulation calculation.Further closer to the reality of the battlefield, the requirements of combat units for material changes, battlefield changes in road conditions into the model, through appropriate adjustment of the algorithm, the model can solve dynamic problems and calculate the optimal route.The rationality and validity of the algorithm are verified by simulation experiments.
【學(xué)位授予單位】：國(guó)防科學(xué)技術(shù)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：E144;U116.2

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 寧濤;陳榮;郭晨;馮瑞芳;;一種基于云計(jì)算環(huán)境的動(dòng)態(tài)車輛路徑問題解決策略[J];交通運(yùn)輸工程與信息學(xué)報(bào);2015年03期

2 王大東;劉競(jìng)遙;王洪君;;遺傳算法求解清運(yùn)車輛路徑優(yōu)化問題[J];吉林師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年03期

3 楊慶;陳強(qiáng);李珍珍;;帶時(shí)間窗車輛路徑問題的混沌粒子群優(yōu)化算法[J];計(jì)算機(jī)技術(shù)與發(fā)展;2015年08期

4 周慧;周良;丁秋林;;多目標(biāo)動(dòng)態(tài)車輛路徑問題建模及優(yōu)化[J];計(jì)算機(jī)科學(xué);2015年06期

5 尹珂;湯文兵;郭城;;求解帶時(shí)間窗車輛路徑問題的混合蟻群優(yōu)化算法[J];計(jì)算機(jī)與數(shù)字工程;2015年04期

6 劉萬峰;李霞;;車輛路徑問題的快速多鄰域迭代局部搜索算法[J];深圳大學(xué)學(xué)報(bào)(理工版);2015年02期

7 趙燕偉;李文;張景玲;任設(shè)東;;多車型同時(shí)取送貨問題的低碳路徑研究[J];浙江工業(yè)大學(xué)學(xué)報(bào);2015年01期

8 饒衛(wèi)振;金淳;劉鋒;楊磊;;一類動(dòng)態(tài)車輛路徑問題模型和兩階段算法[J];交通運(yùn)輸系統(tǒng)工程與信息;2015年01期

9 董蕊;劉冉;江志斌;任盼;;具有時(shí)間窗約束累積性車輛路徑問題的禁忌搜索優(yōu)化算法[J];工業(yè)工程與管理;2015年01期

10 黃震;羅中良;黃時(shí)慰;;一種帶時(shí)間窗車輛路徑問題的混合蟻群算法[J];中山大學(xué)學(xué)報(bào)(自然科學(xué)版);2015年01期

相關(guān)博士學(xué)位論文 前1條

1 陸琳;不確定信息車輛路徑問題及其算法研究[D];南京航空航天大學(xué);2007年

相關(guān)碩士學(xué)位論文 前6條

1 史春燕;帶車輛時(shí)間窗的多車場(chǎng)車輛路徑問題研究[D];重慶工商大學(xué);2015年

2 方遠(yuǎn);家電連鎖業(yè)終端物流配送中的車輛路徑問題研究[D];浙江理工大學(xué);2015年

3 黃鋮;農(nóng)產(chǎn)品冷鏈物流配送開放式車輛路徑研究[D];重慶工商大學(xué);2014年

4 宋緒文;基于函數(shù)逼近的物流車輛路徑規(guī)劃方法及應(yīng)用研究[D];蘇州大學(xué);2014年

5 石華t@;改進(jìn)的蟻群算法在實(shí)際VRP中的應(yīng)用研究[D];山東大學(xué);2012年

6 周和平;軍事物流配送路徑優(yōu)化問題研究[D];合肥工業(yè)大學(xué);2009年

，

本文編號(hào)：1747906