發(fā)布時間：2018-05-10 18:05

  本文選題：肉食品公司 + 冷鮮肉��； 參考：《北京交通大學》2015年碩士論文

【摘要】：隨著社會經(jīng)濟的發(fā)展和人們生活水平的提高,公眾對于冷鮮食品的需求也越來越大。冷鮮肉作為近幾年較為流行肉食消費形式,相較于熱鮮肉、冷凍肉,無論在口感和營養(yǎng)價值上都更有優(yōu)勢,但由于其易腐的特性,對配送的水平也提出更高的要求。如何能在保證配送成本最小的前提下提高冷鮮肉的配送質(zhì)量和效率、縮短在途時間是當前研究的重要內(nèi)容。對于本文的研究對象M肉食品加工企業(yè)而言,采取自營冷鏈配送會產(chǎn)生大額成本的投入,在建設(shè)配送網(wǎng)絡(luò)的同時也出現(xiàn)很多與發(fā)展不太協(xié)調(diào)的問題,尤其在冷鮮肉配送方面,沒有做到有計劃的合理配置資源,造成資源浪費和配送成本的虛高。因此,對于M公司來說如何能根據(jù)公司目前配送系統(tǒng)現(xiàn)狀和考慮冷鮮肉配送特點基礎(chǔ)上,建立適用于M公司的冷鮮肉配送路徑優(yōu)化模型是目前M公司配送系統(tǒng)面臨的問題,對于M公司具有重要的現(xiàn)實意義。 本文結(jié)合國內(nèi)外車輛路徑問題的相關(guān)研究成果,對M公司冷鮮肉配送路徑優(yōu)化進行研究。首先,對冷鮮肉配送路徑問題的相關(guān)理論進行分析和闡述,介紹了冷鮮肉及冷鏈物流和車輛路徑問題的基本理論。其次,對M公司冷鮮肉配送系統(tǒng)進行分析,針對M公司冷鮮肉配送路徑規(guī)劃不合理的問題,考慮到M公司配送作業(yè)情況和冷鮮肉配送特點,建立了考慮制冷成本的單車場非滿載帶軟時間窗約束的冷鮮肉配送路徑優(yōu)化模型,該模型以總配送成本最小化為目標,以配送車輛的載重量、客戶需求量及時間窗要求作為約束條件。再次,通過比較常用的節(jié)約法和遺傳算法,確定遺傳算法更適用于本問題的求解。最后,利用MATLAB工具對基于改進的遺傳算法的M公司濟南地區(qū)的冷鮮肉配送路線進行實例分析與求解,得到最優(yōu)路線方案。通過優(yōu)化前后路線選擇方案的各方面對比,發(fā)現(xiàn)優(yōu)化后的路線選擇方案在配送成本、配送距離、配送時間及車輛裝載率等方面都得到明顯的效果提升,一定程度上能提高M公司的經(jīng)濟效益水平。
[Abstract]:With the development of social economy and the improvement of people's living standard, the public demand for cold fresh food is increasing. Cold fresh meat is a popular consumption form of meat in recent years. Compared with hot fresh meat and frozen meat, cold fresh meat has more advantages in taste and nutritional value. However, due to its perishable characteristics, it also puts forward higher requirements for distribution level. How to improve the delivery quality and efficiency of cold fresh meat and shorten the time on the way is an important content of current research. For the M meat processing enterprise, adopting self-operated cold chain distribution will produce a large amount of cost investment, and there are many problems that are not in harmony with the development of the distribution network, especially in the distribution of cold fresh meat. The failure to allocate resources in a planned and reasonable way causes waste of resources and high cost of distribution. Therefore, for M Company, how to establish an optimal model of cold meat distribution path for M Company based on the current distribution system and the characteristics of cold meat distribution is a problem that M Company is faced with at present. For M Company has important practical significance. This paper studies the route optimization of cold fresh meat distribution in M Company based on the related research results of vehicle routing problem at home and abroad. Firstly, the related theory of cold fresh meat distribution routing problem is analyzed and expounded, and the basic theory of cold fresh meat and cold chain logistics and vehicle routing problem is introduced. Secondly, the cold fresh meat distribution system of M company is analyzed. Aiming at the unreasonable route planning of M company cold fresh meat distribution, considering the distribution operation situation and cold fresh meat distribution characteristics of M company, In this paper, an optimization model of cold meat distribution path with soft time window constraint on non-full load of single cycle yard with refrigeration cost is established. The model aims at minimizing the total delivery cost and taking the load of distribution vehicle as the goal. Customer requirements and time window requirements as constraints. Thirdly, by comparing the commonly used savings method and genetic algorithm, it is determined that genetic algorithm is more suitable for solving this problem. Finally, an example of cold meat distribution route in Jinan area of M Company based on improved genetic algorithm is analyzed and solved by MATLAB tool, and the optimal route scheme is obtained. Through the comparison of route selection scheme before and after optimization, it is found that the optimized route selection scheme has obvious effect in distribution cost, distribution distance, distribution time and vehicle loading rate, etc. To a certain extent, M company can improve the level of economic benefits.
【學位授予單位】：北京交通大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：F326.6

【參考文獻】

中國期刊全文數(shù)據(jù)庫 前10條

1 崔宏志;龔加安;;帶時間窗車輛路徑問題的改進節(jié)約算法[J];純粹數(shù)學與應(yīng)用數(shù)學;2011年05期

2 劉誠;陳治亞;封全喜;;帶軟時間窗物流配送車輛路徑問題的并行遺傳算法[J];系統(tǒng)工程;2005年10期

3 潘t，

本文編號：1870326