發(fā)布時(shí)間：2018-10-20 07:32

【摘要】：在當(dāng)代經(jīng)濟(jì)快速發(fā)展和科學(xué)技術(shù)迅速進(jìn)步的推動(dòng)下,物流業(yè)作為國(guó)民經(jīng)濟(jì)重要的服務(wù)性支柱產(chǎn)業(yè),正在世界各地迅速發(fā)展。運(yùn)用科學(xué)的方法對(duì)運(yùn)輸運(yùn)作過(guò)程加以指導(dǎo)和優(yōu)化可以有效的降低物流配送成本進(jìn)而降低總物流成本,是提高企業(yè)競(jìng)爭(zhēng)力的重要手段。本文在對(duì)車輛路徑問(wèn)題的相關(guān)基礎(chǔ)模型、衍生模型進(jìn)行探討總結(jié),以及對(duì)解決該類問(wèn)題的各類算法進(jìn)行全面綜述的基礎(chǔ)上,對(duì)中國(guó)物流運(yùn)輸運(yùn)作的現(xiàn)實(shí)情況進(jìn)行了深入調(diào)查。由于中國(guó)高速公路系統(tǒng)融資建設(shè)的特殊性,國(guó)內(nèi)高速公路收費(fèi)的計(jì)價(jià)收費(fèi)方式與國(guó)外發(fā)達(dá)國(guó)家有所不同,傳統(tǒng)的車輛路徑問(wèn)題模型已經(jīng)不能滿足我國(guó)物流規(guī)劃的實(shí)際需求�；趯�(duì)中國(guó)實(shí)際物流運(yùn)輸中成本計(jì)算方法的研究,并考慮到我國(guó)高速公路系統(tǒng)計(jì)價(jià)收費(fèi)方式的特殊性,提出了以降低中國(guó)實(shí)際運(yùn)輸中車輛運(yùn)輸成本為目標(biāo)的具有時(shí)間窗約束的累積性車輛路徑問(wèn)題。該問(wèn)題的目標(biāo)成本同時(shí)與運(yùn)輸路徑上的行駛距離和流量有關(guān),符合中國(guó)實(shí)際的物流運(yùn)輸運(yùn)作現(xiàn)狀。鑒于新問(wèn)題成本衡量方式的復(fù)雜性,本文設(shè)計(jì)了新型的禁忌搜索算法結(jié)構(gòu)對(duì)其進(jìn)行有效求解:(1)算法中嵌入路徑間交叉搜索、可行解路徑內(nèi)鄰域搜索和不可行路徑內(nèi)鄰域搜索三種鄰域搜索方法,形成一套系統(tǒng)的搜索方案,并允許同時(shí)在可行和不可行解空間內(nèi)進(jìn)行鄰域搜索,擴(kuò)大搜索的范圍;(2)提出基于預(yù)處理和迭代思想的鄰域解運(yùn)輸成本的低復(fù)雜度計(jì)算方法;同時(shí)采用Nagata提出的時(shí)間窗違反計(jì)算方法對(duì)解的時(shí)間窗約束違反進(jìn)行評(píng)估,大大降低了計(jì)算時(shí)間。在對(duì)算法涉及的相關(guān)參數(shù)進(jìn)行試驗(yàn)的基礎(chǔ)上,本文進(jìn)行了大量的算例實(shí)驗(yàn)。對(duì)新型問(wèn)題的數(shù)值試驗(yàn)不僅證明了所采用的Nagata時(shí)間窗違反計(jì)算方法相對(duì)傳統(tǒng)方法的時(shí)間節(jié)約性和有效性;同時(shí)由于該問(wèn)題可以覆蓋多類已被研究過(guò)的車輛路徑問(wèn)題,對(duì)相關(guān)問(wèn)題的實(shí)際問(wèn)題的計(jì)算不僅驗(yàn)證了模型的全面覆蓋性和正確性,更體現(xiàn)了本文算法的高效性和時(shí)間節(jié)約性。本文的研究旨在為中國(guó)實(shí)際的物流運(yùn)輸運(yùn)作提供相關(guān)決策支持,同時(shí)希望相關(guān)研究方法能夠運(yùn)用到實(shí)際中,充實(shí)車輛路徑問(wèn)題的相關(guān)理論體系,為將來(lái)相關(guān)鄰域研究提供一個(gè)新的方向。
[Abstract]:With the rapid development of modern economy and the rapid progress of science and technology, logistics industry, as an important service pillar industry of national economy, is developing rapidly all over the world. Using scientific methods to guide and optimize the transportation operation process can effectively reduce the cost of logistics distribution and then reduce the total logistics cost, which is an important means to improve the competitiveness of enterprises. On the basis of discussing and summarizing the basic model and derivative model of vehicle routing problem, and summarizing all kinds of algorithms to solve this kind of problem, this paper makes a thorough investigation on the actual situation of logistics and transportation operation in China. Due to the particularity of the financing construction of expressway system in China, the pricing and charging methods of domestic expressway charges are different from those of developed countries. The traditional vehicle routing problem model can no longer meet the actual demand of logistics planning in China. Based on the study of the cost calculation method in the actual logistics transportation in China, and considering the particularity of the pricing and charging method of the expressway system in China, An accumulative vehicle routing problem with time window constraints is proposed, which aims at reducing the transportation cost of vehicles in actual transportation in China. The target cost of this problem is also related to the distance and flow on the transportation route, which is in line with the current situation of logistics and transportation operation in China. In view of the complexity of the new cost measurement method, this paper designs a new Tabu search algorithm structure to solve it effectively: (1) intersecting search between embedded paths in the algorithm; There are three neighborhood search methods in the feasible solution path and the infeasible path neighborhood search method, which form a set of systematic search schemes, and allow the neighborhood search in the feasible and infeasible solution space at the same time. (2) low complexity computation method of neighborhood solution transportation cost based on preprocessing and iteration is proposed, and the time window violation calculation method proposed by Nagata is used to evaluate the time window constraint violation of the solution. The calculation time is greatly reduced. On the basis of experiments on the related parameters of the algorithm, a large number of numerical examples are carried out in this paper. The numerical test of the new problem not only proves the time saving and effectiveness of the Nagata time window violation calculation method compared with the traditional method, but also covers many kinds of vehicle routing problems that have been studied. The calculation of the practical problems not only verifies the overall coverage and correctness of the model, but also reflects the efficiency and time saving of the algorithm in this paper. The purpose of this paper is to provide relevant decision support for the actual logistics and transportation operation in China, and hope that the relevant research methods can be applied to practice and enrich the relevant theoretical system of the vehicle routing problem. It provides a new direction for the future study of related neighborhood.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：F259.2;F252

【參考文獻(xiàn)】

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

1 祝崇雋,劉民,吳澄,吳曉冰;針對(duì)模糊需求的VRP的兩種2-OPT算法[J];電子學(xué)報(bào);2001年08期

2 李寧,鄒彤,孫德寶;帶時(shí)間窗車輛路徑問(wèn)題的粒子群算法[J];系統(tǒng)工程理論與實(shí)踐;2004年04期

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

1 董燕菊;時(shí)間約束下的物流配送路線優(yōu)化研究[D];首都經(jīng)濟(jì)貿(mào)易大學(xué);2011年

，

本文編號(hào)：2282475