本文選題：車輛路徑 + 冷鏈物流　； 參考：《東北大學(xué)》2014年碩士論文

【摘要】：在社會(huì)和經(jīng)濟(jì)高速發(fā)展的今天,人們的生活質(zhì)量和對(duì)于物質(zhì)生活的要求也越來(lái)越高。隨著速凍食品、果蔬和海鮮等易腐產(chǎn)品的需求量日益增加,冷鏈產(chǎn)品的質(zhì)量以及食品安全也越來(lái)越受到人們的重視,能夠保證易腐品品質(zhì)、減少易腐品損耗的冷鏈物流業(yè)迅速興起。冷鏈產(chǎn)品所具有的鮮活性、易腐性、易損耗性等特點(diǎn),決定了冷鏈物流在制定配送路線上面臨嚴(yán)峻的考驗(yàn)。本文在綜述國(guó)內(nèi)外相關(guān)研究的基礎(chǔ)上,結(jié)合冷鏈物流的特點(diǎn),解決帶時(shí)間窗的冷鏈物流車輛路徑問(wèn)題。首先,綜述了車輛路徑問(wèn)題以及冷鏈物流的相關(guān)研究文獻(xiàn),指出當(dāng)前的研究趨勢(shì)。其次,對(duì)帶時(shí)間窗約束的車輛路徑問(wèn)題進(jìn)行概述,闡述該類問(wèn)題的一般描述與基本模型,總結(jié)目前求解車輛路徑模型的幾類算法,主要包括精確算法、啟發(fā)式算法和智能優(yōu)化算法等,并重點(diǎn)介紹遺傳算法的概念、特點(diǎn)、步驟以及可以較好的求解多目標(biāo)優(yōu)化問(wèn)題的帶精英策略的非支配排序遺傳算法算法。再次,針對(duì)冷鏈物流的特性,建立冷鏈物流多目標(biāo)車輛路徑模型,該模型是一個(gè)以總的配送成本最小和配送服務(wù)準(zhǔn)時(shí)度最高為兩個(gè)目標(biāo),考慮車輛容量、軟時(shí)間窗、模糊行駛時(shí)間等多個(gè)約束限制的多目標(biāo)優(yōu)化模型,并采用帶精英策略的非支配排序遺傳算法對(duì)模型進(jìn)行求解。最后以山西太原美特好超市小店區(qū)物流中心的生鮮蔬果配送作為實(shí)際算例,為該配送中心設(shè)計(jì)更加經(jīng)濟(jì)高效的冷鏈產(chǎn)品配送路線,證明模型和算法的合理性與有效性。本文建立的冷鏈物流多目標(biāo)VRPTW模型和針對(duì)模型選取的NSGA-Ⅱ算法能夠應(yīng)用到實(shí)際的冷鏈物流配送路徑制定工作中,對(duì)其他類似的冷鏈配送中心具有一定的借鑒意義。
[Abstract]:With the rapid development of society and economy, the quality of life and the requirement of material life are higher and higher.With the increasing demand for perishable products such as frozen food, fruits, vegetables and seafood, the quality of cold chain products and food safety are paid more and more attention to, which can ensure the quality of perishable products.The cold-chain logistics industry, which reduces perishable wear and tear, is booming.The cold chain products have the characteristics of fresh activity, perishability, easily wear and tear, which determines the cold chain logistics is facing a severe test in the formulation of distribution route.Based on the review of domestic and foreign researches and the characteristics of cold chain logistics, this paper solves the vehicle routing problem of cold chain logistics with time window.Firstly, vehicle routing problem and cold chain logistics are reviewed, and the current research trend is pointed out.Secondly, the vehicle routing problem with time window constraint is summarized, the general description and basic model of this kind of problem are expounded, and several kinds of algorithms to solve the vehicle routing model are summarized, including the accurate algorithm.Heuristic algorithm and intelligent optimization algorithm are introduced, and the concept, characteristics and steps of genetic algorithm are introduced, as well as the non-dominated sorting genetic algorithm with elitist strategy for solving multi-objective optimization problems.Thirdly, aiming at the characteristics of cold chain logistics, a multi-objective vehicle routing model of cold chain logistics is established, which takes the minimum total distribution cost and the highest punctuality of distribution service as the two objectives, considering vehicle capacity and soft time window.The multi-objective optimization model with fuzzy travel time and other constraints is solved by using the non-dominated sorting genetic algorithm with elitist strategy.Finally, taking the fresh fruits and vegetables distribution in the logistics center of Taiyuan Meitao-hao supermarket as a practical example, a more economical and efficient delivery route of cold-chain products is designed for the distribution center, which proves the rationality and validity of the model and algorithm.The multi-objective VRPTW model of cold chain logistics and the NSGA- 鈪，

本文編號(hào)：1763049