本文選題：半開放式車輛路徑問題　切入點(diǎn)：蟻群算法　出處：《大連海事大學(xué)》2014年碩士論文

【摘要】：隨著全球經(jīng)濟(jì)的飛速發(fā)展以及現(xiàn)代科學(xué)技術(shù)的進(jìn)步,物流產(chǎn)業(yè)作為國民經(jīng)濟(jì)發(fā)展中的基礎(chǔ)性產(chǎn)業(yè),正在全球范圍內(nèi)迅速擴(kuò)張,已逐步成為影響國民經(jīng)濟(jì)發(fā)展的支撐性產(chǎn)業(yè),具有十分重要的經(jīng)濟(jì)戰(zhàn)略地位。物流配送作為物流系統(tǒng)中最為重要的組成部分,是實(shí)現(xiàn)現(xiàn)代化物流的關(guān)鍵。隨著電子商務(wù)和物聯(lián)網(wǎng)技術(shù)的快速發(fā)展,物流配送模式開始向區(qū)域化、多批次、小批量的方向發(fā)展,傳統(tǒng)的分區(qū)配送模式已經(jīng)無法滿足現(xiàn)代物流的需求。 針對新形勢下的物流配送需求,本文引入半開放式車輛路徑問題,在基于多配送中心信息和資源共享的基礎(chǔ)上,建立了跨區(qū)域聯(lián)合運(yùn)輸?shù)男滦臀锪髋渌湍Ｊ�。使物流配送企業(yè)不再局限于某一固定的區(qū)域,從而提高了車輛的利用率,降低運(yùn)輸成本。同時,考慮到現(xiàn)實(shí)的運(yùn)輸情況,文章所構(gòu)建模型考慮了車輛數(shù)以及工作時間限制的約束,能夠有效的制定各配送中心的車輛調(diào)度方案及租車決策,論文研究還從客戶的角度出發(fā),在目標(biāo)函數(shù)中引入基于軟時間窗的懲罰函數(shù),滿足了客戶對服務(wù)時間和配送質(zhì)量的雙重要求。有效的增強(qiáng)物流企業(yè)的市場競爭力,因此具有較強(qiáng)的理論意義和實(shí)際價值。 文章首先在簡述了車輛路徑問題的概念及研究歷程的基礎(chǔ)上,詳細(xì)分析了標(biāo)準(zhǔn)車輛路徑問題及其擴(kuò)展問題,對常用的基本求解算法進(jìn)行了簡要介紹。 其次針對我國現(xiàn)階段物流配送研究的不足,引入帶時間窗的半開放式多配送中心車輛路徑問題作為解決方案�；谘芯繂栴}的特征采用整體法的求解思路,選取蟻群算法對其進(jìn)行求解 第三,建立了帶時間窗的半開放式多配送中心車輛路徑問題數(shù)學(xué)模型,簡述蟻群算法原理,分析了算法中所涉及的關(guān)鍵參數(shù),針對所構(gòu)建的數(shù)學(xué)模型設(shè)計(jì)了相應(yīng)的蟻群算法。 最后,運(yùn)用所構(gòu)建的數(shù)學(xué)模型和設(shè)計(jì)的蟻群算法對不同客戶點(diǎn)規(guī)模的算例進(jìn)行求解,通過與分解法求解思路所得的結(jié)果進(jìn)行對比分析,驗(yàn)證了本文所提出模型和算法的有效性,為決策者提供一定的理論支持。
[Abstract]:With the rapid development of global economy and the progress of modern science and technology, logistics industry, as a basic industry in the development of national economy, is expanding rapidly all over the world and has gradually become a supporting industry that affects the development of national economy. Logistics distribution, as the most important part of logistics system, is the key to realize modern logistics. With the rapid development of electronic commerce and Internet of things technology, The logistics distribution mode began to develop towards regionalization, multi-batches and small batches, and the traditional regional distribution mode could not meet the needs of modern logistics. Aiming at the demand of logistics distribution under the new situation, this paper introduces the semi-open vehicle routing problem, which is based on the multi-distribution center information and resource sharing. This paper establishes a new logistics distribution mode of trans-regional joint transportation, which makes the logistics distribution enterprise no longer confined to a fixed area, thereby increasing the utilization rate of vehicles and reducing the transportation cost. At the same time, considering the actual transportation situation, Considering the constraints of the number of vehicles and the working time limit, the model can effectively formulate the vehicle scheduling scheme and rental decision of each distribution center. The paper also studies from the customer's point of view. The penalty function based on soft time window is introduced into the objective function, which meets the double requirements of customer service time and distribution quality, and effectively enhances the market competitiveness of logistics enterprises, so it has strong theoretical significance and practical value. On the basis of brief introduction of the concept and research course of the vehicle routing problem, this paper analyzes the standard vehicle routing problem and its expansion problem in detail, and introduces the basic algorithms for solving the problem in brief. Secondly, aiming at the deficiency of logistics distribution research in our country, the vehicle routing problem of semi-open multi-distribution center with time window is introduced as the solution. Based on the characteristics of the research problem, the whole method is used to solve the problem. Ant colony algorithm is selected to solve the problem. Thirdly, the mathematical model of vehicle routing problem in semi-open multi-distribution center with time window is established, the principle of ant colony algorithm is briefly described, the key parameters involved in the algorithm are analyzed, and the corresponding ant colony algorithm is designed for the mathematical model constructed. Finally, the mathematical model and ant colony algorithm are used to solve the problems of different customer size, and the results are compared with those obtained by decomposition method. The validity of the proposed model and algorithm is verified, and theoretical support is provided for decision makers.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：U492.22

【參考文獻(xiàn)】

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

1 楊宇棟;朗茂祥;胡思繼;;有時間窗車輛路徑問題的模型及其改進(jìn)模擬退火算法研究[J];管理工程學(xué)報;2006年03期

2 魏俊華,王安麟,童毅;基于需求劃分的帶軟時間窗的路徑優(yōu)化方法[J];公路交通科技;2005年10期

3 葛顯龍;王旭;鄧?yán)?;基于聯(lián)合配送的開放式動態(tài)車輛路徑問題及算法研究[J];管理工程學(xué)報;2013年03期

4 熊浩;;多車型車輛共享的MDVRP問題及其遺傳算法[J];華中師范大學(xué)學(xué)報(自然科學(xué)版);2010年01期

5 鐘石泉;杜綱;賀國光;;有時間窗的開放式車輛路徑問題及其遺傳算法[J];計(jì)算機(jī)工程與應(yīng)用;2006年34期

6 李敏;郭強(qiáng);劉紅麗;;多車場多配送中心的物流配送問題研究[J];計(jì)算機(jī)工程與應(yīng)用;2007年08期

7 李三彬;柴玉梅;王黎明;;需求可拆分的開放式車輛路徑問題研究[J];計(jì)算機(jī)工程;2011年06期

8 王君;李波;;帶模糊預(yù)約時間的車輛路徑問題的多目標(biāo)禁忌搜索算法[J];計(jì)算機(jī)集成制造系統(tǒng);2011年04期

9 陳婷;葉建中;;粒子群算法的MDVRP仿真研究[J];計(jì)算機(jī)仿真;2010年07期

10 張立峰;趙方庚;孫江生;石曉燕;;戰(zhàn)時備件配送的MDVRP問題及其遺傳算法求解[J];計(jì)算機(jī)應(yīng)用與軟件;2010年02期

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

1 劉波;蟻群算法改進(jìn)及應(yīng)用研究[D];燕山大學(xué);2010年

，

本文編號：1662366