裝載配送一體化聯(lián)合優(yōu)化問題研究
[Abstract]:With the rapid development of the logistics industry, the role of distribution in the logistics system becomes more and more important. Vehicle Routing Problem (VFP) and Vehicle Routing Problem (VRP) are the two core problems in logistics distribution. In this paper, on the basis of summarizing the research of VFP and VRP both at home and abroad, this paper fully considers the internal relation of the two problems and the mutual restriction, and studies the two problems, so as to achieve the purpose of simultaneously optimizing the vehicle distribution path and the vehicle loading scheme. The research focuses on two:1) building a new type of VFPVRP joint optimization model;2) designing the solution algorithm of the VFPVRP joint optimization model by using a hybrid genetic algorithm, and is used for solving the corresponding practical problems. In this paper, the present situation and the logistics distribution theory of VFP, VRP and VFPVRP are reviewed in this paper, and the VFP and VRP are discussed in detail. The VFP is a three-dimensional multi-model VFP, and the VRP is a non-full VR P. On the basis of this, this paper analyzes and solves the problems encountered in the whole process by the mutual restriction of VFP and VRP, and establishes the combined optimization model of VFPVRP. In the design part of the algorithm, the general idea of the design is first defined, that is, a hybrid genetic algorithm is constructed to model the joint optimization problem by combining the genetic algorithm with the heuristic algorithm. The algorithm of this paper is based on the genetic algorithm, and the solution of the VRP is the main line, and a loading scheme optimization module is designed to combine the VRP with the solution of VFP. This strategy is different from the idea that the VRP and VFP are respectively designed by the design algorithm of the VRP and the VFP, and the internal relations and the restriction of the two are really considered, and the two problems are solved at the same time. In the end, this paper uses the MATLAB software to write the program to implement the algorithm, and uses the MATLAB program to give an example. A good result is obtained in the short time, and the result of the experiment proves the feasibility and the effectiveness of the optimal model and the algorithm of the combination of the cargo loading and the vehicle.
【學(xué)位授予單位】:重慶大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:TP18;F259.2
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 雷定猷;劉俊;張英貴;張忠輝;劉期柏;;鐵路集裝箱平衡裝箱優(yōu)化模型與算法[J];鐵道科學(xué)與工程學(xué)報(bào);2010年04期
2 陳文蘭;戴樹貴;;車輛路徑安排問題算法研究綜述[J];滁州學(xué)院學(xué)報(bào);2007年03期
3 孫麗君;胡祥培;王征;;車輛路徑規(guī)劃問題及其求解方法研究進(jìn)展[J];系統(tǒng)工程;2006年11期
4 張兵;王瑛;林嘉豪;徐耀輝;;混合遺傳算法在大型運(yùn)輸機(jī)裝載問題中的運(yùn)用[J];火力與指揮控制;2012年05期
5 鐘石泉;王雪蓮;;多箱型三維裝箱問題及其優(yōu)化研究[J];計(jì)算機(jī)工程與應(yīng)用;2009年22期
6 姜昌華;戴樹貴;胡幼華;;求解車輛路徑問題的混合遺傳算法[J];計(jì)算機(jī)集成制造系統(tǒng);2007年10期
7 俞雪雷;周俊紅;楊俊琴;;有交通條件約束與軟時(shí)間窗約束的配送配載模型算法研究[J];交通與運(yùn)輸(學(xué)術(shù)版);2007年01期
8 邱佩蘭;;降低運(yùn)輸成本 促進(jìn)物流發(fā)展[J];寧波經(jīng)濟(jì)(財(cái)經(jīng)視點(diǎn));2009年05期
9 姜義東,查建中,何大勇;集裝箱裝載矩形貨物的布局研究[J];鐵道學(xué)報(bào);2000年06期
10 卜雷,尹傳忠,蒲云;集裝箱運(yùn)輸多箱三維裝載優(yōu)化問題的遺傳算法[J];鐵道學(xué)報(bào);2004年02期
本文編號:2444820
本文鏈接:http://www.sikaile.net/jingjilunwen/jingjiguanlilunwen/2444820.html