天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當(dāng)前位置:主頁 > 科技論文 > 路橋論文 >

多目標(biāo)應(yīng)急物流調(diào)度優(yōu)化研究

發(fā)布時(shí)間:2018-04-14 20:07

  本文選題:應(yīng)急物流 + 車輛調(diào)度。 參考:《浙江工商大學(xué)》2015年碩士論文


【摘要】:應(yīng)急物流是指發(fā)生突發(fā)應(yīng)急事件時(shí),對(duì)各類需求進(jìn)行緊急配送的一種特殊物流活動(dòng)。隨著社會(huì)經(jīng)濟(jì)的發(fā)展,人們處理突發(fā)應(yīng)急事件的方法發(fā)生變化,應(yīng)急物流也有了新的特點(diǎn)。應(yīng)急物流不僅要考慮如何減少配送成本還要保證配送的及時(shí)性,以降低突發(fā)應(yīng)急事件帶來的嚴(yán)重后果。應(yīng)急車輛調(diào)度問題是應(yīng)急物流優(yōu)化的關(guān)鍵,因此多目標(biāo)應(yīng)急物流調(diào)度優(yōu)化配置的研究具有重要實(shí)際意義。本文在國內(nèi)外研究基礎(chǔ)上,深入分析和研究了應(yīng)急物流調(diào)度優(yōu)化配置問題。主要的研究內(nèi)容包括:(1)論述應(yīng)急物流調(diào)度問題的背景和意義,分析應(yīng)急物流中車輛調(diào)度的特有屬性,構(gòu)建應(yīng)急物流調(diào)度優(yōu)化配置平臺(tái),并對(duì)該系統(tǒng)平臺(tái)的技術(shù)架構(gòu)、工作流程和功能模塊進(jìn)行詳細(xì)說明,實(shí)現(xiàn)對(duì)應(yīng)急物流調(diào)度的信息、案例和模型的全方面管理。(2)提出基于AHP和NN的案例檢索匹配方法。由于應(yīng)急物流調(diào)度問題非常復(fù)雜,往往需要參考舊案例的解決方法,再根據(jù)實(shí)際情況制定合理的決策方案。本文基于這個(gè)問題提出了案例檢索匹配方法,先采用AHP法求得案例屬性權(quán)重,再通過語義距離求屬性間相似度,然后采用NN求解問題案例與舊案例的綜合相似度,最后通過試驗(yàn)表明該方法對(duì)案例檢索匹配是有效的。(3)提出基于免疫蟻群多目標(biāo)算法的應(yīng)急車輛調(diào)度模型。根據(jù)應(yīng)急情況下車輛調(diào)度的特點(diǎn),建立以需求點(diǎn)滿意度最大、配送成本最少以及配送時(shí)間最短為目標(biāo)的車輛調(diào)度模型。最后,采用基于免疫蟻群的多目標(biāo)算法對(duì)模型進(jìn)行求解,通過實(shí)驗(yàn)表明該模型可以有效解決應(yīng)急車輛調(diào)度問題,并將文中算法與多目標(biāo)經(jīng)典算法NSGA-Ⅱ進(jìn)行實(shí)驗(yàn)對(duì)比,結(jié)果證明文中算法可以更加有效求得帕累托最優(yōu)解集。(4)設(shè)計(jì)實(shí)現(xiàn)了面向食品配送的應(yīng)急調(diào)度優(yōu)化配置平臺(tái)。該系統(tǒng)平臺(tái)將本論文中的案例檢索匹配方法和應(yīng)急車輛調(diào)度模型算法應(yīng)用到系統(tǒng)中,對(duì)百誠物流在杭州城區(qū)的實(shí)際配送點(diǎn),進(jìn)行應(yīng)急調(diào)度實(shí)證分析,為企業(yè)解決食品的應(yīng)急配送問題提供有力支持。
[Abstract]:Emergency logistics is a special logistics activity for emergency distribution of all kinds of needs.With the development of social economy, people's methods of dealing with emergencies have changed, and emergency logistics has new characteristics.Emergency logistics should not only consider how to reduce the cost of distribution, but also ensure the timeliness of distribution, in order to reduce the serious consequences of emergencies.Emergency vehicle scheduling is the key to the optimization of emergency logistics, so it is of great practical significance to study the optimal allocation of multi-objective emergency logistics.Based on the research at home and abroad, this paper deeply analyzes and studies the optimal allocation of emergency logistics scheduling.The main research contents include: (1) discussing the background and significance of the emergency logistics scheduling problem, analyzing the special attributes of vehicle scheduling in emergency logistics, constructing the optimal allocation platform of emergency logistics scheduling, and the technical framework of the system platform.The workflow and function module are explained in detail, and the case retrieval matching method based on AHP and NN is proposed to realize the full aspect management of information, case and model of emergency logistics scheduling.Because the problem of emergency logistics scheduling is very complex, it is often necessary to refer to the solution of the old cases, and then to make a reasonable decision plan according to the actual situation.Based on this problem, a case retrieval matching method is proposed in this paper. First, the case attribute weight is obtained by using AHP method, then the similarity between attributes is obtained by semantic distance, and then the comprehensive similarity between the problem case and the old case is solved by NN.Finally, experiments show that the method is effective for case search matching.) an emergency vehicle scheduling model based on immune ant colony multi-objective algorithm is proposed.According to the characteristics of vehicle scheduling in emergency situations, a vehicle scheduling model with the goals of maximum demand point satisfaction, minimum distribution cost and shortest delivery time is established.Finally, the multi-objective algorithm based on immune ant colony is used to solve the model. The experiments show that the model can effectively solve the emergency vehicle scheduling problem, and compare the algorithm with NSGA- 鈪,

本文編號(hào):1750820

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/1750820.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶25f76***提供,本站僅收錄摘要或目錄,作者需要?jiǎng)h除請(qǐng)E-mail郵箱bigeng88@qq.com