【摘要】：移動電子商務的快速發(fā)展給物流快遞行業(yè)帶來了新的機遇和挑戰(zhàn)。在移動電子商務環(huán)境下,結合現(xiàn)有的全球定位系統(tǒng)和全球移動通訊系統(tǒng)等技術的發(fā)展,物流快遞企業(yè)能夠實時獲取顧客、取貨車輛和道路交通等信息。在移動電子商務環(huán)境下,物流快遞企業(yè)能夠對在線顧客的快遞服務請求做出快速響應并有效滿足顧客需求,從而提高物流快遞運作效率和服務質量,這也將會吸引更多的顧客使用移動終端發(fā)送快遞服務請求,同時促進物流快遞行業(yè)和移動電子商務的協(xié)調發(fā)展;能夠合理利用物流快遞企業(yè)的資源,有效滿足顧客需求。本文結合移動電子商務的特點,分析其對物流快遞取貨過程帶來的影響,即在執(zhí)行取貨任務的過程中,隨時有動態(tài)信息的產生,當有動態(tài)信息發(fā)生時,原優(yōu)化的取貨服務路線就會變得次優(yōu)或者不可行,因此需要利用一種算法能夠快速的合并動態(tài)信息,對服務路線進行動態(tài)優(yōu)化。本文通過變時長的滾動時域設置和引入虛擬顧客的方式,將服務路線動態(tài)優(yōu)化過程轉化為相應時間點的靜態(tài)車輛路徑問題。將整個取貨過程分為兩個階段:初始靜態(tài)階段和動態(tài)階段,并根據兩個階段的特點建立了相應的數學規(guī)劃模型。對于建立的數學規(guī)劃模型,本文采用兩階段算法求解。第一階段利用改進貪婪算法快速生成模型的初始解,第二階段通過改進模擬退火算法對生成的初始解進行優(yōu)化,得到系統(tǒng)最優(yōu)解。利用的改進貪婪算法屬于構建型算法,基于傳統(tǒng)貪婪算法的思想,分別在求解速度和求解質量兩個方面做了改進。該改進后的算法求解速度快,能夠在動態(tài)信息發(fā)生后將其與尚未被服務的顧客信息結合,優(yōu)化得到較滿意的取貨路線方案。改進模擬退火算法是在傳統(tǒng)模擬退火算法的基礎上,在鄰域操作方法、加入記憶裝置和設置終止準則三個方面進行了改進。將設計的改進模擬退火算法通過求解相同的算例得到的最優(yōu)解與禁忌搜索算法和改進后的啟發(fā)式算法相比,求解質量得到提高。通過兩種算法實現(xiàn)對于移動電子商務環(huán)境下物流快遞人員服務路線的動態(tài)優(yōu)化。
[Abstract]:The rapid development of mobile e-commerce brings new opportunities and challenges to the logistics express industry. In the environment of mobile electronic commerce, with the development of global positioning system (GPS) and global mobile communication system (GMS), logistics express enterprises can obtain information such as customers, pick-up vehicles and road traffic in real time. In the environment of mobile electronic commerce, logistics express enterprises can respond to the online customers' express service request quickly and meet the customer's demand effectively, so as to improve the efficiency and service quality of logistics express service. This will also attract more customers to use mobile terminals to send express service requests, and promote the coordinated development of logistics express industry and mobile electronic commerce, which can make rational use of the resources of logistics express enterprises, and effectively meet the needs of customers. Based on the characteristics of mobile electronic commerce, this paper analyzes the influence of mobile electronic commerce on the process of receiving goods by express delivery, that is, in the process of carrying out the task of picking up goods, dynamic information is generated at any time, and when there is dynamic information, The original optimized delivery service route will become suboptimal or unfeasible, so it is necessary to use an algorithm to quickly merge dynamic information and optimize the service route dynamically. In this paper, the dynamic optimization process of service route is transformed into the static vehicle routing problem at the corresponding time point by setting the rolling time domain with variable time and introducing the virtual customer. The whole process is divided into two stages: initial static stage and dynamic stage, and the corresponding mathematical programming model is established according to the characteristics of the two stages. For the established mathematical programming model, this paper uses two-stage algorithm to solve the problem. In the first stage, an improved greedy algorithm is used to quickly generate the initial solution of the model. In the second stage, the generated initial solution is optimized by an improved simulated annealing algorithm, and the optimal solution of the system is obtained. The improved greedy algorithm is a constructive algorithm. Based on the idea of the traditional greedy algorithm, this paper improves the speed and quality of the solution respectively. The improved algorithm can solve the problem quickly and can combine the dynamic information with the customer information which has not been served. The improved simulated annealing algorithm is based on the traditional simulated annealing algorithm. It is improved in three aspects: neighborhood operation method, adding memory device and setting termination criteria. Compared with the Tabu search algorithm and the improved heuristic algorithm, the quality of the improved simulated annealing algorithm is improved compared with the Tabu search algorithm and the improved heuristic algorithm. Two algorithms are used to realize the dynamic optimization of the service route of logistics couriers under the environment of mobile electronic commerce.
【學位授予單位】：山東科技大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：F252;TP18

【參考文獻】

相關期刊論文 前10條

1 裴小兵;賈定芳;;基于模擬退火算法的城市物流多目標配送車輛路徑優(yōu)化研究[J];數學的實踐與認識;2016年02期

2 陳誠;邱榮祖;;基于兩階段求解的動態(tài)車輛路徑問題研究[J];集美大學學報(自然科學版);2015年06期

3 穆東;王超;王勝春;周圣川;;基于并行模擬退火算法求解時間依賴型車輛路徑問題[J];計算機集成制造系統(tǒng);2015年06期

4 饒衛(wèi)振;金淳;劉鋒;楊磊;;一類動態(tài)車輛路徑問題模型和兩階段算法[J];交通運輸系統(tǒng)工程與信息;2015年01期

5 王超;穆東;;基于模擬退火算法求解VRPSPDTW問題[J];系統(tǒng)仿真學報;2014年11期

6 曹高立;胡蓉;錢斌;吳麗萍;;一種有效混合量子進化算法求解帶容量約束的車輛路徑優(yōu)化問題[J];計算機集成制造系統(tǒng);2015年04期

7 王軍;王美蓉;王怡洋;宋曉良;;基于貪婪算法的水上漂移目標救助物資協(xié)同調度方法[J];運籌與管理;2014年02期

8 饒衛(wèi)振;金淳;;求解大規(guī)模CVRP問題的快速貪婪算法[J];管理工程學報;2014年02期

9 王仁民;閉應洲;劉阿寧;李杰;;改進變鄰域搜索算法求解動態(tài)車輛路徑問題[J];計算機工程與應用;2014年02期

10 李遠遠;劉彥;劉光前;;車輛路徑問題優(yōu)化——基于改進節(jié)約算法[J];社會科學家;2013年11期

相關博士學位論文 前3條

1 饒衛(wèi)振;大規(guī)模動態(tài)車輛路徑問題優(yōu)化方法研究[D];大連理工大學;2012年

2 孫中悅;車輛路徑問題的仿真優(yōu)化方法研究[D];北京交通大學;2012年

3 王艷玲;取貨車輛動態(tài)調度問題研究[D];北京交通大學;2010年

相關碩士學位論文 前6條

1 陳波;時間窗約束下的快遞車輛動態(tài)調度問題研究[D];浙江工商大學;2014年

2 孫曉靜;基于動態(tài)規(guī)劃算法與貪婪算法的多掛靠港滾裝船配載優(yōu)化研究[D];大連海事大學;2013年

3 胡夏云;基于蟻群算法的動態(tài)車輛調度問題的研究[D];廣東工業(yè)大學;2013年

4 田宇;基于系統(tǒng)仿真模擬退火算法的VRPTW研究[D];河北工程大學;2011年

5 李楠;大規(guī)模實時動態(tài)車輛路徑問題研究[D];清華大學;2010年

6 辛振銘;一種改進的模擬退火算法在TSP問題中的研究與應用[D];東北師范大學;2010年

，

本文編號：2183615