本文選題：農(nóng)資物流 + 運(yùn)輸路線(xiàn)優(yōu)化��； 參考：《吉林大學(xué)》2014年碩士論文

【摘要】：經(jīng)濟(jì)的快速發(fā)展帶動(dòng)了各行各業(yè)的發(fā)展，物流業(yè)發(fā)展表現(xiàn)最為突出。作為第三利潤(rùn)源泉的物流業(yè)受到各大企業(yè)的關(guān)注。作為傳統(tǒng)的農(nóng)業(yè)大國(guó)，“三農(nóng)”問(wèn)題一直是我國(guó)關(guān)注的重點(diǎn)問(wèn)題。影響農(nóng)業(yè)發(fā)展的農(nóng)資物流也成為物流業(yè)中的重點(diǎn)。農(nóng)資物流的效率直接影響到農(nóng)民的收成，農(nóng)業(yè)的產(chǎn)量、農(nóng)村的穩(wěn)定。農(nóng)資流通體系的完善是實(shí)現(xiàn)農(nóng)業(yè)現(xiàn)代化的重要環(huán)節(jié)，有利于提高農(nóng)業(yè)經(jīng)濟(jì)效益。但目前我國(guó)的農(nóng)資流通方式和水平比較落后，不能滿(mǎn)足現(xiàn)代農(nóng)業(yè)生產(chǎn)和現(xiàn)代市場(chǎng)經(jīng)濟(jì)的要求，因而推進(jìn)農(nóng)資流通網(wǎng)絡(luò)建設(shè)，完善流通體系很有必要。我國(guó)物流技術(shù)專(zhuān)業(yè)化水平有很大的進(jìn)步，但與國(guó)外先進(jìn)的物流運(yùn)輸服務(wù)還有很大的差距。 物流路線(xiàn)選擇優(yōu)化問(wèn)題中運(yùn)輸車(chē)輛路線(xiàn)問(wèn)題是目前物流領(lǐng)域研究重點(diǎn)。如何選擇物流運(yùn)輸路線(xiàn)，優(yōu)化已有的運(yùn)輸路線(xiàn)，成為眾多學(xué)者研究的重點(diǎn)。越來(lái)越多的學(xué)者致力研究用于解決車(chē)輛路線(xiàn)問(wèn)題的各種智能算法，并在取得良好效果。 本文旨在針對(duì)A農(nóng)資公司化肥運(yùn)輸問(wèn)題選擇一條最優(yōu)路線(xiàn)，在遍歷所有運(yùn)輸結(jié)點(diǎn)的前提下，使運(yùn)輸路線(xiàn)最短，，滿(mǎn)載率最高。本文采用改進(jìn)的節(jié)約算法和改進(jìn)蟻群算法分別求解，并比較分析兩種算法得出的結(jié)果，最終得出改進(jìn)蟻群算法求解的結(jié)果不僅節(jié)約了里程和車(chē)輛數(shù)，還提高了車(chē)輛的滿(mǎn)載率。 首先,本文介紹了相關(guān)理論知識(shí)，主要有物流運(yùn)輸理論，農(nóng)資物流的概念、發(fā)展現(xiàn)狀和改善措施，以及車(chē)輛路線(xiàn)問(wèn)題的概念、構(gòu)成要素、數(shù)學(xué)模型等。 其次，本文分析了物流運(yùn)輸路線(xiàn)選擇優(yōu)化常用方法，主要有精確算法、啟發(fā)式算法、智能算法三類(lèi)，并詳細(xì)說(shuō)明了具體算法的基本原理、優(yōu)缺點(diǎn)及適應(yīng)范圍，重點(diǎn)介紹了節(jié)約算法和改進(jìn)的節(jié)約算法，蟻群算法和改進(jìn)的蟻群算法。 再次，以A農(nóng)資公司化肥運(yùn)輸為實(shí)例，分別基于改進(jìn)的節(jié)約算法和改進(jìn)蟻群算法進(jìn)行求解，并比較分析求解結(jié)果，得出改進(jìn)蟻群算法對(duì)于解決車(chē)輛路線(xiàn)優(yōu)化問(wèn)題更有優(yōu)勢(shì)。 最后，對(duì)全文進(jìn)行總結(jié)，分析本文存在的不足。車(chē)輛路線(xiàn)問(wèn)題的動(dòng)態(tài)性使得問(wèn)題更加復(fù)雜，但仍然有很高的研究?jī)r(jià)值。
[Abstract]:The rapid development of economy has driven the development of various industries, the logistics industry development performance is the most outstanding.As the third source of profit, the logistics industry is concerned by the major enterprises.As a traditional agricultural country, the issue of agriculture, rural areas and farmers has always been the focus of our attention.Agricultural material logistics, which affects the development of agriculture, has also become the focus of the logistics industry.The efficiency of agricultural material logistics has a direct impact on farmers' harvest, agricultural output and rural stability.The perfection of agricultural circulation system is an important link to realize agricultural modernization, which is helpful to improve agricultural economic benefit.However, at present, the mode and level of agricultural material circulation in our country are relatively backward, which can not meet the requirements of modern agricultural production and modern market economy, so it is necessary to promote the construction of agricultural material circulation network and perfect the circulation system.The specialization level of logistics technology in our country has made great progress, but there is still a big gap with foreign advanced logistics transportation service.In the optimization of logistics route selection, the transportation vehicle routing problem is the focus of logistics research.How to choose the logistics transportation route and optimize the existing transportation route has become the focus of many scholars.More and more scholars are studying various intelligent algorithms to solve vehicle routing problems, and good results have been obtained.The purpose of this paper is to select an optimal route for the transportation of fertilizer in A agricultural company. Under the premise of traversing all the transportation nodes, the transportation route is shortest and the full load rate is the highest.In this paper, the improved savings algorithm and the improved ant colony algorithm are used to solve the problem, and the results obtained by the two algorithms are compared and analyzed. Finally, the result of the improved ant colony algorithm not only saves the mileage and the number of vehicles, but also increases the full load rate of the vehicle.First of all, this paper introduces the relevant theoretical knowledge, including logistics theory, the concept of agricultural material logistics, development status and improvement measures, as well as the concept of vehicle routing problems, elements, mathematical models, and so on.Secondly, this paper analyzes the common methods of logistics route selection and optimization, including precise algorithm, heuristic algorithm and intelligent algorithm, and explains in detail the basic principle, advantages and disadvantages, and adaptive range of the specific algorithm.This paper mainly introduces the saving algorithm, the improved saving algorithm, the ant colony algorithm and the improved ant colony algorithm.Thirdly, based on the improved saving algorithm and the improved ant colony algorithm, the results of the improved ant colony algorithm are compared and analyzed, and the result shows that the improved ant colony algorithm has more advantages in solving the vehicle route optimization problem.Finally, the paper summarizes the full text and analyzes the shortcomings of this paper.The dynamic nature of the vehicle routing problem makes the problem more complex, but still has a high research value.
【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U492.22;F426.72

【參考文獻(xiàn)】

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

1 歐陽(yáng)斌;;陜北果業(yè)4S農(nóng)資連鎖概念店的選址與構(gòu)建[J];安徽農(nóng)業(yè)科學(xué);2011年08期

2 陳美軍;張志勝;史金飛;;基于自適應(yīng)多態(tài)蟻群算法的多約束車(chē)輛路徑問(wèn)題[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年01期

3 許巖;李勝琴;;基于物流配送路徑的優(yōu)化算法研究[J];電腦知識(shí)與技術(shù);2011年10期

4 吳東慶;劉任;郭世仁;;廣東省農(nóng)資營(yíng)銷(xiāo)信息服務(wù)平臺(tái)建設(shè)的研究[J];廣東農(nóng)業(yè)科學(xué);2012年16期

5 潘震東;唐加福;韓毅;;帶貨物權(quán)重的車(chē)輛路徑問(wèn)題及遺傳算法[J];管理科學(xué)學(xué)報(bào);2007年03期

6 吳慶洪,張紀(jì)會(huì),徐心和;具有變異特征的蟻群算法[J];計(jì)算機(jī)研究與發(fā)展;1999年10期

7 丁建立,陳增強(qiáng),袁著祉;遺傳算法與螞蟻算法的融合[J];計(jì)算機(jī)研究與發(fā)展;2003年09期

8 周屹;李海龍;王銳;;遺傳算法求解物流配送中帶時(shí)間窗的VRP問(wèn)題[J];吉林大學(xué)學(xué)報(bào)(理學(xué)版);2008年02期

9 趙寶江;金俊;李士勇;;一種求解函數(shù)優(yōu)化的自適應(yīng)蟻群算法[J];計(jì)算機(jī)工程與應(yīng)用;2007年04期

10 陳燁;帶雜交算子的蟻群算法[J];計(jì)算機(jī)工程;2001年12期

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

1 陳寶文;蟻群優(yōu)化算法在車(chē)輛路徑問(wèn)題中的應(yīng)用研究[D];哈爾濱工業(yè)大學(xué);2009年

本文編號(hào)：1740887