本文選題：A連鎖企業(yè)　切入點：多時間窗　出處：《北京物資學院》2014年碩士論文　論文類型：學位論文

【摘要】：隨著國民經(jīng)濟的發(fā)展，我國的連鎖經(jīng)營規(guī)模不斷發(fā)展壯大，已成為第三產(chǎn)業(yè)的主旋律之一。目前，我國連鎖經(jīng)營企業(yè)的配送模式主要有四種，包括供應商直接配送模式、自營配送模式、第三方物流配送模式和共同配送模式。本文的研究對象A連鎖企業(yè)是一家餐飲連鎖企業(yè)，該企業(yè)采用自營配送模式。采取自營配送模式的連鎖企業(yè)的配送成本在物流成本中占有非常大的比重，，對其產(chǎn)品配送路徑的優(yōu)化有利于降低企業(yè)物流成本、提高企業(yè)競爭力。本文綜合闡述了影響企業(yè)配送路徑選擇的各項因素，并建立A連鎖企業(yè)配送路徑優(yōu)化問題的數(shù)學模型，設計求解模型的智能水滴算法，并結合企業(yè)的實際情況對優(yōu)化前后的配送路徑進行了對比分析，最終得出A連鎖企業(yè)的配送路徑方案。本文的主要內(nèi)容如下： 首先，以文獻研究為基礎，分析了國外國內(nèi)關于車輛路徑問題的研究現(xiàn)狀以及針對該問題的相關算法的研究現(xiàn)狀，并重點分析最新提出的智能水滴算法。然后，介紹了A連鎖企業(yè)的運營現(xiàn)狀，特別是物流配送現(xiàn)狀，提出目前該連鎖企業(yè)在物流配送環(huán)節(jié)存在的三大亟需解決的問題。 其次，針對A連鎖企業(yè)的配送路徑選擇問題，結合連鎖企業(yè)各門店對配送時間的不同要求，建立了以配送運營總成本最小為目標、帶時間窗和車容量限制的車輛配送路徑優(yōu)化問題數(shù)學模型。根據(jù)智能水滴算法的基本原理，設計了求解該模型的快速有效算法，并運用Matlab軟件編寫了該算法的實現(xiàn)程序。通過算例的模擬計算，驗證了該帶時間窗和車容量限制的車輛配送路徑優(yōu)化問題數(shù)學模型和智能水滴算法的有效性。 最后，運用Google Earth軟件，生成A連鎖企業(yè)各門店地理位置地標分布圖，并計算出各門店之間的球面距離。運用Clementine軟件，根據(jù)地理位置對門店進行K-Means聚類。進一步，針對K-Means聚類形成的11個聚類，分別運用智能水滴算法程序求解，得到優(yōu)化后的配送路徑。 本文的研究結論可為A連鎖企業(yè)進行車輛路線選擇、車輛調(diào)度決策等提供理論依據(jù)，具有一定的應用價值。
[Abstract]:With the development of national economy, the scale of chain operation in our country has been developing and expanding, and it has become one of the main melody of the tertiary industry. At present, there are mainly four distribution modes of chain management enterprises in our country, including the direct distribution mode of suppliers. The research object of this paper is A chain enterprise, which is a restaurant chain enterprise. The distribution cost of chain enterprises with self-owned distribution mode occupies a very large proportion in the logistics cost. The optimization of the product distribution path is helpful to reduce the logistics cost of the enterprise. In order to improve the competitiveness of enterprises, this paper comprehensively expounds the factors that affect the choice of distribution routes of enterprises, establishes the mathematical model of distribution path optimization problem of chain A enterprises, and designs an intelligent water droplet algorithm to solve the model. Combined with the actual situation of the enterprise, the distribution route before and after optimization is compared and analyzed, and finally the distribution route scheme of chain A enterprise is obtained. The main contents of this paper are as follows:. First of all, based on the literature research, this paper analyzes the current research situation of the vehicle routing problem abroad and domestic and the research status of the related algorithms for the problem, and focuses on the analysis of the latest proposed intelligent water drop algorithm. This paper introduces the present operation situation of chain A enterprise, especially the present situation of logistics distribution, and puts forward three problems that need to be solved in the logistics distribution link of the chain enterprise at present. Secondly, aiming at the problem of distribution path selection of A chain enterprise, combined with the different requirements of distribution time in each store of chain enterprise, the aim of this paper is to minimize the total cost of distribution operation. According to the basic principle of intelligent water drop algorithm, a fast and effective algorithm is designed to solve the problem of vehicle distribution path optimization with time windows and vehicle capacity constraints. The software Matlab is used to program the algorithm. The effectiveness of the mathematical model and the intelligent water drop algorithm for the vehicle distribution path optimization problem with time window and vehicle capacity limit is verified by the simulation and calculation of an example. Finally, using Google Earth software, the landmarks distribution map of each store location in chain A enterprise is generated, and the spherical distance between stores is calculated. By using Clementine software, K-Means clustering is carried out according to the geographical location. For the 11 clusters formed by K-Means clustering, the intelligent water drop algorithm was used to solve the problem, and the optimized distribution path was obtained. The conclusion of this paper can provide theoretical basis for A chain enterprise to choose vehicle route and make decision of vehicle scheduling, which has certain application value.
【學位授予單位】：北京物資學院
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：F721;F252

【參考文獻】

相關期刊論文 前10條

1 劉云忠,宣慧玉;車輛路徑問題的模型及算法研究綜述[J];管理工程學報;2005年01期

2 張建勇,李軍;模糊車輛路徑問題的一種混合遺傳算法[J];管理工程學報;2005年02期

3 亓霞;陳森發(fā);;基于改進小生境GA的有時間窗物流配送路徑優(yōu)化問題研究[J];管理工程學報;2006年01期

4 馮國莉;楊曉冬;;基于Hopfield神經(jīng)網(wǎng)絡車輛路徑的優(yōu)化研究[J];信息技術;2006年07期

5 周捷,翟羽健;基于神經(jīng)網(wǎng)絡的自主車輛導航路徑計算[J];機器人;1999年05期

6 洪聯(lián)系;董紹華;;MDVRPTW問題多階段迭代啟發(fā)式算法[J];計算機工程與應用;2007年26期

7 余潔;;淺議連鎖企業(yè)物流配送模式的選擇[J];中國集體經(jīng)濟(下半月);2007年12期

8 李興國;顧峰;;連鎖企業(yè)物流配送模式選擇策略研究[J];物流科技;2008年03期

9 王鐵君;鄔開俊;;多車場車輛路徑問題的改進粒子群算法[J];計算機工程與應用;2013年02期

10 王志剛;夏慧明;;求解車輛路徑問題的人工蜂群算法[J];計算機工程與科學;2014年06期

本文編號：1594779