【摘要】：物流配送是物流活動(dòng)中直接與消費(fèi)者相關(guān)聯(lián)的環(huán)節(jié),在物流的各項(xiàng)成本中,配送的成本占了相當(dāng)高的比例。因此,配送線路安排得是否合理直接影響著承運(yùn)者的成木支出。在滿足用戶多樣化需求的前提下,如何有效地利用現(xiàn)有資源進(jìn)行車輛調(diào)度以減少企業(yè)的運(yùn)行成本,給企業(yè)帶來(lái)更大的利潤(rùn),是物流行業(yè)發(fā)展的目標(biāo),也是研究者關(guān)注的重點(diǎn)問(wèn)題。 現(xiàn)階段,我國(guó)多數(shù)物流企業(yè)對(duì)配送車輛進(jìn)行調(diào)度時(shí)主要依據(jù)經(jīng)驗(yàn),容易導(dǎo)致車輛使用效率低下等一系列問(wèn)題�；谙伻核惴ㄑ芯砍鞘信渌蛙囕v路徑優(yōu)化問(wèn)題有很強(qiáng)的實(shí)用性,文中運(yùn)用蟻群算法解決哈爾濱龍運(yùn)物流園區(qū)路徑優(yōu)化的實(shí)際問(wèn)題,并對(duì)蟻群算法在算法流程和狀態(tài)轉(zhuǎn)移概率兩方面進(jìn)行改進(jìn),將傳統(tǒng)蟻群算法的尋求最短路為優(yōu)化目標(biāo)改進(jìn)為符合實(shí)際城市路網(wǎng)狀況及運(yùn)營(yíng)需要的優(yōu)化。構(gòu)建動(dòng)態(tài)路阻函數(shù)使蟻群算法考慮實(shí)際路網(wǎng)動(dòng)態(tài)交通條件的影響,其優(yōu)化目標(biāo)可在滿足貨運(yùn)車輛完成客戶所要求產(chǎn)品需求的前提下,使得所有車輛的行駛路線最合理。 論文綜合運(yùn)用理論分析與實(shí)證研究相結(jié)合的方法,完成車輛配送路徑查詢系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn),通過(guò)系統(tǒng)的搜索直接得出符合模型目標(biāo)的具體配送路徑的走向,為駕駛員出行提供直觀的規(guī)劃方案,作為具有實(shí)用價(jià)值的物流管理服務(wù)系統(tǒng)的組成部分,為用戶提供更有效路徑選擇的指示和導(dǎo)航。
[Abstract]:Logistics distribution is a link directly related to consumers in logistics activities. The cost of distribution accounts for a high proportion of the costs of logistics. Therefore, whether the distribution route arrangement is reasonable or not directly affects the carrier's wooden expenditure. On the premise of meeting the diversified needs of users, how to effectively use the existing resources for vehicle scheduling to reduce the operating costs of enterprises and bring greater profits to enterprises is the goal of the development of logistics industry. It is also the key problem that the researcher pays close attention to. At present, most logistics enterprises in our country mainly based on experience when scheduling distribution vehicles, which can easily lead to a series of problems such as low efficiency of vehicle use and so on. It is very practical to study the route optimization problem of urban distribution vehicle based on ant colony algorithm. In this paper, we use ant colony algorithm to solve the practical problem of route optimization in Harbin Longyun logistics park. Ant colony algorithm is improved in the two aspects of algorithm flow and state transition probability. The optimization goal of traditional ant colony algorithm is to optimize the shortest path to meet the actual urban road network conditions and operational needs. The dynamic road resistance function is constructed to make the ant colony algorithm consider the influence of the dynamic traffic conditions of the actual road network. The optimization goal can meet the requirements of the freight vehicles to meet the customer's requirements and make all the vehicles the most reasonable route. This paper uses the method of theoretical analysis and empirical research to complete the design and implementation of the vehicle distribution path query system. Through the system search, we can get the direction of the specific distribution path that accords with the model objectives. As an integral part of the practical logistics management service system, it provides users with more effective route selection guidance and navigation.
【學(xué)位授予單位】：東北林業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP18;U492.22

【參考文獻(xiàn)】

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

1 阮于洲,蔣捷,韓剛,陳軍;基于層次分析法的路段屬性求權(quán)方法[J];地理信息世界;2004年02期

2 程世東,關(guān)宏志,劉小明;城市物流配送模式研究[J];道路交通與安全;2004年03期

3 王暉;陳麗;陳墾;薛漫清;梁慶;;多指標(biāo)綜合評(píng)價(jià)方法及權(quán)重系數(shù)的選擇[J];廣東藥學(xué)院學(xué)報(bào);2007年05期

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

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

6 潘登;鄭應(yīng)平;陸小芳;;避免車輛路徑擁塞的動(dòng)態(tài)蟻群算法[J];計(jì)算機(jī)工程;2008年05期

7 鄭遠(yuǎn);杜豫川;孫立軍;;美國(guó)聯(lián)邦公路局路阻函數(shù)探討[J];交通與運(yùn)輸(學(xué)術(shù)版);2007年01期

8 張紀(jì)會(huì),高齊圣,徐心和;自適應(yīng)蟻群算法[J];控制理論與應(yīng)用;2000年01期

9 王正彬,杜文;考慮線路安排的物流配送方案模型及其算法研究[J];物流技術(shù);2003年12期

10 張濤,張sソ，

本文編號(hào)：2260915