本文選題：車輛路徑問題　切入點(diǎn)：遺傳算法　出處：《重慶理工大學(xué)》2017年碩士論文

【摘要】：目前中國社區(qū)超市發(fā)展速度越來越快,商品配送的需求也迅速增長。合理的配送路徑可以提高配送效率,提高客戶的滿意率并降低物流企業(yè)的成本;然而實(shí)際配送中配送路線固定、配送信息系統(tǒng)落后、返空率較高,造成車輛利用率低、相關(guān)物流企業(yè)成本不斷提高,這些已成為制約配送企業(yè)和社區(qū)超市可持續(xù)發(fā)展的瓶頸。因此研究社區(qū)超市的配送路徑優(yōu)化具有一定的現(xiàn)實(shí)意義。本文選擇LS公司社區(qū)超市配送路徑問題進(jìn)行研究,主要包括以下幾個方面:首先,在調(diào)研的基礎(chǔ)上,了解了LS公司超市配送的問題,包括超市配送管理混亂、車輛利用率低、憑經(jīng)驗(yàn)設(shè)定配送路線(盲目性強(qiáng))等。其次,利用調(diào)研數(shù)據(jù),根據(jù)出現(xiàn)的相關(guān)問題設(shè)計了四個車輛路徑模型,包括常規(guī)任務(wù)單配送中心車輛路徑問題、常規(guī)任務(wù)多配送中心車輛路徑問題,臨時任務(wù)旅行商問題、臨時任務(wù)帶時間窗車輛路徑問題。然后應(yīng)用遺傳算法設(shè)計MATLAB仿真程序,得出常規(guī)配送任務(wù)和臨時配送任務(wù)最優(yōu)配送路線;與LS公司原始配送路線對比,算例數(shù)值結(jié)果表明,基于遺傳算法的社區(qū)超市配送車輛路徑優(yōu)化方案,可以滿足社區(qū)超市配送要求,顯著地降低企業(yè)的配送成本;最后,總結(jié)了文章的主旨和不足,為以后的研究打下基礎(chǔ)。
[Abstract]:At present, community supermarkets in China are developing faster and faster, and the demand for commodity distribution is also growing rapidly.Reasonable distribution path can improve the efficiency of distribution, improve the satisfaction rate of customers and reduce the cost of logistics enterprises. However, in the actual distribution, the distribution information system is backward, the empty rate is high, and the vehicle utilization ratio is low.The increasing cost of logistics enterprises has become a bottleneck restricting the sustainable development of distribution enterprises and community supermarkets.Therefore, the study of community supermarket distribution path optimization has a certain practical significance.This article chooses LS company community supermarket distribution route question to carry on the research, mainly includes the following several aspects: first, on the basis of the investigation, has understood the LS company supermarket distribution question, including the supermarket distribution management confusion, the vehicle utilization ratio is low,Set distribution route by experience (strong blindness) and so on.Secondly, according to the research data, four vehicle routing models are designed according to the related problems, including conventional task single distribution center vehicle routing problem, conventional task multi-distribution center vehicle routing problem, temporary task traveling salesman problem.Temporary task with time window vehicle routing problem.Then the genetic algorithm is used to design the MATLAB simulation program to get the optimal distribution route of conventional distribution task and temporary distribution task, and compared with the original distribution route of LS company, the numerical results show that,The vehicle routing optimization scheme based on genetic algorithm can meet the requirements of community supermarket distribution and significantly reduce the distribution costs of enterprises. Finally, the paper summarizes the main idea and shortcomings of the paper, which will lay a foundation for future research.
【學(xué)位授予單位】：重慶理工大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F721.7;F252.1

【參考文獻(xiàn)】

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

1 胡衛(wèi);梁承姬;樊陸彬;;基于同時取送貨的多溫共配冷鏈車輛路徑優(yōu)化[J];廣西大學(xué)學(xué)報(自然科學(xué)版);2016年05期

2 劉恒宇;汝宜紅;;考慮交通擁堵及工作量平衡性的一致性車輛路徑問題[J];西南交通大學(xué)學(xué)報;2016年05期

3 葉勇;張惠珍;;多配送中心車輛路徑問題的狼群算法[J];計算機(jī)應(yīng)用研究;2017年09期

4 戴卓;;三層物流網(wǎng)絡(luò)選址—路徑優(yōu)化及混合啟發(fā)式算法研究[J];計算機(jī)應(yīng)用研究;2017年08期

5 馬向國;劉同娟;楊平哲;蔣榮芬;;基于隨機(jī)需求的冷鏈物流車輛路徑優(yōu)化模型[J];系統(tǒng)仿真學(xué)報;2016年08期

6 揭婉晨;楊s，

本文編號：1706823