本文關(guān)鍵詞： 開(kāi)放式車輛路徑問(wèn)題 多車場(chǎng) 時(shí)間窗 干擾管理 差分進(jìn)化算法　出處：《東華大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：車輛路徑問(wèn)題是物流配送最核心的部分,其融合了管理科學(xué)、運(yùn)籌學(xué)和系統(tǒng)工程等學(xué)科的理論知識(shí)。車輛路徑問(wèn)題是一個(gè)NP-hard問(wèn)題,企業(yè)如何生成滿足所有客戶的需求的路線,同時(shí)又需要實(shí)現(xiàn)配送成本最低,成為企業(yè)亟待解決的問(wèn)題。隨著電子商務(wù)的快速發(fā)展,配送模式潛移默化的改變著,開(kāi)放式車輛路徑問(wèn)題逐漸成為研究的焦點(diǎn)。并且由于物流配送環(huán)境的日益復(fù)雜,在實(shí)際的物流配送活動(dòng)中會(huì)發(fā)生很多干擾事件,比如:由于道路交通問(wèn)題造成的行駛時(shí)間延遲、顧客要求改變時(shí)間窗、顧客需求量改變、車輛拋錨等。這些干擾事件的發(fā)生勢(shì)必會(huì)造成對(duì)原計(jì)劃的改變,影響正常的配送活動(dòng),那么企業(yè)如何快速、合理的處理這些干擾事件的發(fā)生對(duì)企業(yè)造成的影響,成為現(xiàn)代物流企業(yè)的另外一個(gè)急需解決的難題。目前解決這類干擾性的事件的方法主要有re-scheduling和scheduling等方法,這類方法往往只考慮的是配送的成本,不考慮客戶和配送業(yè)務(wù)員的利益,這導(dǎo)致得到的方案往往是客戶滿意度低和配送業(yè)務(wù)員情緒大的方案,嚴(yán)重影響了公司的利益。而干擾管理方法,是目前解決干擾事件最好的方法,其系統(tǒng)全面的考慮物流配送過(guò)程中每個(gè)主體的利益,以生成對(duì)系統(tǒng)擾動(dòng)最小的方案為目標(biāo),而不是單純的考慮配送成本。本文主要研究工作如下:(1)在帶軟時(shí)間窗的多車場(chǎng)開(kāi)放式車輛路徑問(wèn)題的基礎(chǔ),以顧客時(shí)間窗改變?yōu)楦蓴_事件,采用改進(jìn)的前景理論方法來(lái)衡量擾動(dòng)量,建立了基于顧客時(shí)間窗改變的多車場(chǎng)開(kāi)放式路徑問(wèn)題的多目標(biāo)干擾管理模型。(2)根據(jù)帶軟時(shí)間窗的多車場(chǎng)開(kāi)放式車輛路徑問(wèn)題和顧客時(shí)間窗改變的多車場(chǎng)車輛路徑問(wèn)題的干擾管理模型的特點(diǎn),研究了一種新改進(jìn)的離散差分進(jìn)化算法,并通過(guò)MATLAB編程實(shí)現(xiàn)。(3)通過(guò)標(biāo)準(zhǔn)測(cè)試數(shù)據(jù)進(jìn)行MATLAB仿真實(shí)驗(yàn),實(shí)驗(yàn)結(jié)果表明了新改進(jìn)的差分進(jìn)化算法在求解顧客時(shí)間窗改變的干擾管理模型問(wèn)題上的有效性和驗(yàn)證模型的可行性。
[Abstract]:The vehicle routing problem (VRP) is the core part of logistics distribution, which integrates the theoretical knowledge of management science, operational research and systems engineering. The vehicle routing problem is a NP-hard problem, how to generate a route to meet the needs of all customers. At the same time, it is necessary to realize the lowest cost of distribution, which has become an urgent problem for enterprises. With the rapid development of electronic commerce, the mode of distribution is changing subtly. The open vehicle routing problem has gradually become the focus of research, and because of the increasingly complex logistics distribution environment, there will be a lot of interference events in the actual logistics distribution activities, such as: due to road traffic problems caused by the travel time delay, Customers demand to change the time window, customer demand changes, vehicles break down, etc. The occurrence of these interference events will inevitably cause changes to the original plan and affect normal distribution activities, so how can enterprises quickly, How to deal with the impact of these interference events on enterprises has become another urgent problem for modern logistics enterprises. At present, the main methods to solve these kinds of interference events are re-scheduling and scheduling, etc. Such methods tend to consider only the cost of distribution, not the interests of customers and distribution agents, which often result in solutions with low customer satisfaction and high mood among distribution agents. The method of interference management is the best way to solve the interference event at present. Its system considers the interests of each main body in the process of logistics distribution, with the aim of generating the scheme with minimal disturbance to the system. The main research work of this paper is as follows: 1) in the open vehicle routing problem with soft time window, the customer time window is changed as the interference event. The improved foreground theory is used to measure the disturbance, The multi-objective interference management model of multi-depot open path problem based on the change of customer time window is established. 2) according to the multi-yard open vehicle path problem with soft time window and the change of customer time window, the multi-yard vehicle path is established. The characteristics of the interference management model of the problem, A new and improved discrete differential evolution algorithm is studied, and the MATLAB simulation experiment is carried out through standard test data by MATLAB programming. The experimental results show that the improved differential evolution algorithm is effective in solving the interference management model of customer time window change and the feasibility of the model is verified.
【學(xué)位授予單位】：東華大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：U116.2;F252

【相似文獻(xiàn)】

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

1 王云平;;車輛路徑問(wèn)題的形式化及其知識(shí)表示方法研究[J];遼寧省交通高等�？茖W(xué)校學(xué)報(bào);2006年04期

2 王江晴;康立山;;動(dòng)態(tài)車輛路徑問(wèn)題仿真器的設(shè)計(jì)與實(shí)現(xiàn)[J];核電子學(xué)與探測(cè)技術(shù);2007年05期

3 曹二保;賴明勇;張漢江;;模糊需求車輛路徑問(wèn)題研究[J];系統(tǒng)工程;2007年11期

4 唐連生;梁劍;;突發(fā)事件下的車輛路徑問(wèn)題研究綜述[J];鐵道運(yùn)輸與經(jīng)濟(jì);2008年12期

5 唐偉勤;張隱;張敏;;大規(guī)模突發(fā)事件應(yīng)急物資調(diào)度中的車輛路徑問(wèn)題[J];物流技術(shù);2008年12期

6 劉紅梅;陳楊;;車輛路徑問(wèn)題的形式化方法研究[J];科技資訊;2008年05期

7 唐加福;孔媛;潘震東;董穎;;基于劃分的蟻群算法求解貨物權(quán)重車輛路徑問(wèn)題[J];控制理論與應(yīng)用;2008年04期

8 熊志華;邵春福;姚智勝;;車輛路徑問(wèn)題的可靠性研究[J];物流技術(shù);2008年08期

9 徐俊杰;;利用微正則退火算法求解車輛路徑問(wèn)題[J];安慶師范學(xué)院學(xué)報(bào)(自然科學(xué)版);2009年02期

10 寧曉利;;車輛路徑問(wèn)題的組合優(yōu)化算法[J];物流技術(shù);2009年06期

相關(guān)會(huì)議論文 前10條

1 符卓;陳斯衛(wèi);;車輛路徑問(wèn)題的研究現(xiàn)狀與發(fā)展趨勢(shì)[A];中國(guó)運(yùn)籌學(xué)會(huì)第七屆學(xué)術(shù)交流會(huì)論文集（下卷）[C];2004年

2 楊世堅(jiān);陳韜;;隨機(jī)車輛路徑問(wèn)題研究綜述[A];中國(guó)系統(tǒng)工程學(xué)會(huì)決策科學(xué)專業(yè)委員會(huì)第六屆學(xué)術(shù)年會(huì)論文集[C];2005年

3 李桂平;陳楠;;多中心車輛路徑問(wèn)題的解決思路[A];中國(guó)地理信息系統(tǒng)協(xié)會(huì)第四次會(huì)員代表大會(huì)暨第十一屆年會(huì)論文集[C];2007年

4 李大衛(wèi);王夢(mèng)光;;廣義車輛路徑問(wèn)題——模型及算法[A];1997中國(guó)控制與決策學(xué)術(shù)年會(huì)論文集[C];1997年

5 符卓;聶靖;;開(kāi)放式車輛路徑問(wèn)題及其若干研究進(jìn)展[A];中國(guó)運(yùn)籌學(xué)會(huì)第八屆學(xué)術(shù)交流會(huì)論文集[C];2006年

6 陳寶文;宋申民;陳興林;單志眾;;應(yīng)用于車輛路徑問(wèn)題的多蟻群算法[A];第25屆中國(guó)控制會(huì)議論文集（下冊(cè)）[C];2006年

7 戎麗霞;;模糊需求條件下的多車場(chǎng)車輛路徑問(wèn)題[A];第三屆中國(guó)智能計(jì)算大會(huì)論文集[C];2009年

8 張鳳姣;張興芳;;基于不確定理論的車輛路徑問(wèn)題[A];第九屆中國(guó)不確定系統(tǒng)年會(huì)、第五屆中國(guó)智能計(jì)算大會(huì)、第十三屆中國(guó)青年信息與管理學(xué)者大會(huì)論文集[C];2011年

9 肖雁;符卓;李育安;;帶軟時(shí)間窗的車輛路徑問(wèn)題及其應(yīng)用前景探討[A];中國(guó)運(yùn)籌學(xué)會(huì)第六屆學(xué)術(shù)交流會(huì)論文集（下卷）[C];2000年

10 許鑫;范文慧;馮雅U，

本文編號(hào)：1537965