本文選題：集團(tuán)客戶　切入點(diǎn)：城市蔬菜配送　出處：《上海交通大學(xué)》2014年碩士論文

【摘要】：城市蔬菜配送的集團(tuán)客戶主要包括醫(yī)院食堂、學(xué)校食堂、企事業(yè)單位的食堂以及連鎖餐飲等。近年來(lái)，隨著居民生活水平的提升和生活方式的改變，在外就餐的次數(shù)明顯增多，連鎖餐飲企業(yè)成為蔬菜消費(fèi)的一個(gè)重要終端。此外，醫(yī)院、學(xué)校、養(yǎng)老院和企事業(yè)單位的集體食堂也承擔(dān)著部分居民的一日三餐。因此集團(tuán)客戶是城市蔬菜配送的一個(gè)重要終端。城市蔬菜配送是城市配送的重要組成部分，而城市配送是近年來(lái)的研究熱點(diǎn)。因此以這類集團(tuán)客戶為配送終端的城市蔬菜配送問(wèn)題的研究也變得意義重大。本文主要研究面向集團(tuán)客戶的城市蔬菜配送的關(guān)鍵問(wèn)題，即車輛路徑問(wèn)題（VRP）。 本文首先闡述了車輛路徑問(wèn)題的理論基礎(chǔ)和研究現(xiàn)狀，然后介紹了上海市蔬菜供應(yīng)鏈和上海市面向集團(tuán)客戶的蔬菜配送的現(xiàn)狀，并分析這類蔬菜配送的特點(diǎn)和其中存在的問(wèn)題，進(jìn)而針對(duì)其中關(guān)鍵的科學(xué)問(wèn)題進(jìn)行求解，即車輛路徑問(wèn)題（VRP）。由于面向集團(tuán)客戶的城市蔬菜配送具有客戶需求時(shí)間窗集中以及客戶分布相對(duì)比較集中的特征，，這類VRP問(wèn)題需要綜合考慮客戶需求時(shí)間窗和道路限行時(shí)間窗的約束。本文通過(guò)建立數(shù)學(xué)模型，設(shè)計(jì)遺傳算法求解面向集團(tuán)客戶的城市蔬菜配送VRP問(wèn)題，并通過(guò)案例分析證明本文算法求解有道路限行的VRP問(wèn)題的有效性，同時(shí)通過(guò)對(duì)不同實(shí)驗(yàn)結(jié)果的分析，證明了該算法在蔬菜配送企業(yè)運(yùn)營(yíng)過(guò)程中可以對(duì)企業(yè)的日常運(yùn)營(yíng)、車隊(duì)規(guī)劃和服務(wù)定價(jià)起到輔助決策的作用，提高城市蔬菜配送效率。在理論研究方面，本文對(duì)VRP問(wèn)題的求解類別做了重要補(bǔ)充。
[Abstract]:Urban vegetable distribution group customers include hospital canteens, school canteens, enterprises and institutions of canteens and chain catering and so on.In recent years, with the improvement of residents' living standard and the change of life style, the number of meals out has increased obviously. Chain catering enterprises have become an important terminal of vegetable consumption.In addition, hospitals, schools, nursing homes and corporate canteens also provide three meals a day for some residents.Therefore, group customers are an important terminal of urban vegetable distribution.Urban vegetable distribution is an important part of urban distribution, and urban distribution is a research hotspot in recent years.Therefore, it is significant to study the urban vegetable distribution problem with this kind of group customers as the distribution terminal.This paper mainly studies the key problem of urban vegetable distribution for group customers, that is, vehicle routing problem.This paper first describes the theoretical basis and research status of vehicle routing problem, then introduces the current situation of vegetable supply chain in Shanghai and vegetable distribution for group customers in Shanghai, and analyzes the characteristics and existing problems of this kind of vegetable distribution.Then the key scientific problems are solved, that is, the vehicle routing problem (VRP).Because the urban vegetable distribution for group customers has the characteristics of customer demand time window set and customer distribution relatively centralized, this kind of VRP problem needs to consider the constraints of customer demand time window and road restriction time window.In this paper, a genetic algorithm is designed to solve the VRP problem of urban vegetable distribution for group customers by establishing a mathematical model. The case study shows that the algorithm is effective in solving the VRP problem with road restrictions.At the same time, through the analysis of different experimental results, it is proved that the algorithm can play an auxiliary role in the daily operation, fleet planning and service pricing in vegetable distribution enterprises, and improve the efficiency of urban vegetable distribution.In the theoretical research, this paper makes an important supplement to the VRP problem.
【學(xué)位授予單位】：上海交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U492.22;F326.6

【參考文獻(xiàn)】

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

1 余才偉;;農(nóng)超對(duì)接合作模式探討[J];商業(yè)經(jīng)濟(jì);2011年10期

2 孟輝;蔡田剛;姜忠鶴;;基于改進(jìn)遺傳算法的帶硬時(shí)間窗車輛路徑問(wèn)題研究[J];機(jī)械工程師;2011年02期

3 商榮華;尤芳;;我國(guó)農(nóng)超對(duì)接模式發(fā)展研究[J];價(jià)值工程;2012年17期

4 王連鋒;宋建社;曹繼平;葉慶;;帶硬時(shí)間窗模糊車輛路徑問(wèn)題的多目標(biāo)優(yōu)化[J];計(jì)算機(jī)工程;2013年04期

5 楊浩雄;胡靜;何明珂;;配送中多車場(chǎng)多任務(wù)多車型車輛調(diào)度研究[J];計(jì)算機(jī)工程與應(yīng)用;2013年10期

6 趙璐;趙磊;朱道立;;有道路限行的集團(tuán)蔬菜城市配送車輛路徑問(wèn)題[J];上海管理科學(xué);2013年05期

本文編號(hào)：1702308