本文選題：快餐外賣　切入點(diǎn)：配送路徑優(yōu)化　出處：《北京交通大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：從2010年網(wǎng)絡(luò)外賣訂餐出現(xiàn)以來,快餐外賣在餐飲業(yè)中的比重逐步增大,成為餐飲業(yè)新生發(fā)展力量。在經(jīng)歷過萌芽期、發(fā)展期、擴(kuò)張期的市場(chǎng)競(jìng)爭之后,目前快餐外賣正在進(jìn)入相對(duì)穩(wěn)定的成熟期,企業(yè)之間的競(jìng)爭已經(jīng)轉(zhuǎn)移向了提高服務(wù)水平和降低配送成本,更多的企業(yè)開始關(guān)注于配送服務(wù)的優(yōu)化。合理的配送路徑、完善的配送系統(tǒng)、靈活的應(yīng)急預(yù)案等都是提高配送服務(wù)質(zhì)量和降低配送成本的重要因素。本文就配送路徑的相關(guān)問題展開研究,可以為快餐外賣行業(yè)的發(fā)展提供參考。本文基于餐飲企業(yè)自營外賣配送服務(wù)和第三方專業(yè)外賣平臺(tái)提供外賣配送服務(wù)兩種場(chǎng)景建立模型,重點(diǎn)考慮城市中路況復(fù)雜的實(shí)際情況,針對(duì)正常路況和擁堵路況,分別研究設(shè)計(jì)了不同的配送路徑方案,并通過四個(gè)算例實(shí)驗(yàn),證明了四個(gè)模型的合理性和可行性。首先,本文介紹了快餐外賣的相關(guān)背景知識(shí),對(duì)研究的范圍進(jìn)行界定,確定了所研究的問題實(shí)質(zhì)屬于一類帶有時(shí)間窗和需求量約束的VRP問題。其次,研究了餐飲公司自營快餐外賣配送的業(yè)務(wù)場(chǎng)景中的配送路徑方案,分為正常路況和擁堵路況兩種情況進(jìn)行分析,分別建立數(shù)學(xué)模型,使用模糊時(shí)間窗描述客戶的滿意度,設(shè)定客戶滿意度最高、成本最小和總里程最小為優(yōu)化目標(biāo),在擁堵路況中,使用了時(shí)變路網(wǎng)來對(duì)路況進(jìn)行描述;然后使用了與問題相適應(yīng)的編碼方式并運(yùn)用遺傳算法對(duì)問題進(jìn)行求解;最終通過兩個(gè)建立在真實(shí)路網(wǎng)中的算例,使用Matlab編寫算法程序求解模型,驗(yàn)證了模型的合理性和算法的有效性。再次,研究了第三方專業(yè)快餐外賣配送平臺(tái)進(jìn)行配送服務(wù)的場(chǎng)景中的路徑方案,仍然分為正常路況和擁堵路況兩種情況,建立兩種情況下的數(shù)學(xué)模型,在前一場(chǎng)景中問題的基礎(chǔ)上,將只進(jìn)行送餐服務(wù)的配送過程擴(kuò)充為在配送過程中既要取餐又要送餐的過程,增加符合本場(chǎng)景的約束條件,并將利潤最大、客戶滿意度最高和總里程最小作為優(yōu)化目標(biāo)函數(shù);然后使用相適應(yīng)的編碼方式,運(yùn)用禁忌搜索算法進(jìn)行求解;最終通過兩個(gè)算例,經(jīng)過求解驗(yàn)證了模型和算法合理有效。最后,對(duì)論文的主要工作及結(jié)論進(jìn)行了總結(jié),分析文章中所存在的不足,對(duì)今后的研究進(jìn)行了展望。
[Abstract]:Since the emergence of online take-out in 2010, the proportion of fast food take-out in the catering industry has gradually increased, becoming a new development force in the catering industry. At present, fast food take-out is entering a relatively stable mature period. Competition among enterprises has shifted to improving service level and reducing distribution costs. More enterprises begin to pay attention to the optimization of distribution services. Perfect distribution system, flexible emergency plan and so on are the important factors to improve the quality of distribution service and reduce the cost of distribution. It can provide reference for the development of fast food take-out industry. Based on the two scenarios of self-service delivery service of catering enterprise and delivery service provided by third party professional take-out platform, this paper establishes a model, focusing on the complex road situation in the city. According to the normal and congested traffic conditions, different distribution route schemes are studied and designed, and the rationality and feasibility of the four models are proved by four examples. Firstly, this paper introduces the relevant background knowledge of fast food take-out. The scope of the study is defined, and the problem is determined to belong to a class of VRP problem with time window and demand constraints. Secondly, the distribution path scheme in the business scenario of self-service take-out delivery of fast food company is studied. It is divided into normal traffic condition and congested road condition to analyze, establish mathematical model separately, use fuzzy time window to describe customer satisfaction, set the highest customer satisfaction, minimum cost and minimum total mileage as the optimization goal. In congested traffic, the time-varying road network is used to describe the road condition; then the coding method suitable to the problem is used and the genetic algorithm is used to solve the problem. Matlab is used to write algorithm program to solve the model, which verifies the rationality of the model and the validity of the algorithm. Thirdly, the path scheme in the scene of the delivery service of the third-party professional fast food delivery platform is studied. Still divided into normal traffic conditions and congested traffic conditions, build two mathematical models, based on the problems in the previous scenario, The delivery process of only serving meals is extended to the process of both taking and delivering meals in the course of distribution, which increases the constraint conditions in accordance with this scenario, and takes the maximum profit, the highest customer satisfaction and the minimum total mileage as the optimization objective function. Finally, through two examples, the model and algorithm are proved to be reasonable and effective. Finally, the main work and conclusions of the paper are summarized. The deficiency of the paper is analyzed, and the future research is prospected.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：F724.6;F719.3;F252

【參考文獻(xiàn)】

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

1 郭月;張涵;;校園外賣配送體系研究[J];中國市場(chǎng);2016年20期

2 周艷聰;孫曉晨;余偉翔;;基于改進(jìn)遺傳算法的物流配送路徑優(yōu)化研究[J];計(jì)算機(jī)工程與科學(xué);2012年10期

3 范志強(qiáng);樂美龍;;面向隨機(jī)環(huán)境的帶軟時(shí)間窗多式聯(lián)運(yùn)路徑優(yōu)化[J];工業(yè)工程與管理;2011年05期

4 朱偉;徐克林;O@占華;周娜;;單車輛物流配送決策模型及其遺傳算法[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年06期

5 潘麗陽;;帶軟時(shí)間窗車輛路徑問題改進(jìn)遺傳算法[J];物流技術(shù);2010年09期

6 余s，

本文編號(hào)：1620742