【摘要】：傳統(tǒng)靜態(tài)路徑研究多是根據(jù)路徑長(zhǎng)度來(lái)進(jìn)行規(guī)劃研究,沒(méi)有考慮路網(wǎng)的時(shí)變性。隨著消費(fèi)觀念的改變,顧客對(duì)配送服務(wù)提出了更高的要求,最主要的是對(duì)配送服務(wù)提出了時(shí)間窗的要求。過(guò)早配送會(huì)造成人力資源的閑置,產(chǎn)生等待成本,延后配送達(dá)不到顧客要求,產(chǎn)生延誤成本,這就給配送服務(wù)商們提出了更大的挑戰(zhàn)。城市工商業(yè)的分布導(dǎo)致各個(gè)路段(以及不同方向)在各個(gè)時(shí)段的通行能力各不相同,配送服務(wù)商們要綜合考慮路網(wǎng)的通行能力、時(shí)間成本、距離成本和服務(wù)時(shí)間窗。本文將通行時(shí)間依據(jù)路網(wǎng)擁擠程度分成不同時(shí)段,將服務(wù)每個(gè)客戶(hù)的途中擁擠狀況作為一個(gè)重要因素,在制定服務(wù)方案時(shí)盡可能規(guī)避交通擁擠,使得配送總成本最低。本文的主要工作有:1、針對(duì)城市交通中交通流的動(dòng)態(tài)特性,考慮了旅行時(shí)間的動(dòng)態(tài)變化,定義本文動(dòng)態(tài)車(chē)輛路徑問(wèn)題,探討動(dòng)態(tài)車(chē)輛路徑問(wèn)題的求解方法,考慮車(chē)型以及時(shí)間窗,分別建立動(dòng)態(tài)路網(wǎng)下車(chē)輛路徑模型,并給出模型的求解思路;2、已有車(chē)輛路徑問(wèn)題的研究大多考慮的是兩點(diǎn)間靜態(tài)空間距離,本文考慮了配送途中的動(dòng)態(tài)擁擠,距離最短路未必是最優(yōu)路徑,以成本最優(yōu)為目標(biāo)建立模型,采用精英主義原則優(yōu)化種群的策略,設(shè)計(jì)了模型的求解算法,通過(guò)算例設(shè)計(jì),給出了最優(yōu)配送方案,驗(yàn)證了算法的可行性和有效性。
[Abstract]:The traditional static path research is based on the path length, and does not take into account the time-varying road network. With the change of consumption concept, customers put forward higher requirements for distribution services, the most important is to put forward the time window requirements for distribution services. Premature distribution will lead to idle human resources, resulting in waiting costs, delay delivery can not meet customer requirements, resulting in delay costs, which gives distribution service providers a greater challenge. The distribution of urban industry and commerce leads to different traffic capacity of different sections (and different directions). Distribution service providers should consider the road network capacity, time cost, distance cost and service time window. In this paper, the traffic time is divided into different periods according to the congestion degree of the road network. The congestion condition of each customer is taken as an important factor to avoid the traffic congestion as far as possible when making the service plan, so that the total cost of distribution is the lowest. The main work of this paper is: 1. In view of the dynamic characteristics of traffic flow in urban traffic, the dynamic change of travel time is considered, the dynamic vehicle routing problem is defined, the solution method of dynamic vehicle routing problem is discussed, and the vehicle type and time window are considered. The vehicle routing model under the dynamic road network is established, and the solution of the model is given. The existing vehicle routing problems mostly consider the static space distance between the two points. In this paper, the dynamic congestion on the way of distribution is considered. The shortest distance path is not necessarily the optimal path. The model is established with the goal of cost optimization, and the strategy of population optimization based on elitist principle is adopted. The algorithm of solving the model is designed, and the optimal distribution scheme is given through the example design. The feasibility and effectiveness of the algorithm are verified.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：U491

【相似文獻(xiàn)】

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

本文編號(hào)：2231858