多樞紐通道軸輻式物流網(wǎng)絡(luò)設(shè)計研究
[Abstract]:The problem of "how to reduce the cost of logistics and improve the efficiency of logistics system" is no longer confined to the theoretical research level, but affects people's daily life in a more rapid and direct way. With the advent of the "Internet" era, the rapid rise of e-commerce, the terms "online purchase" and "virtual economy" have become a kind of consumption and life dependence. Logistics as an intermediate bridge and link, its efficiency and cost have never so profoundly affected us. With the change of living habits and the background of the great development of world trade, there is also a huge challenge to the basic guarantee of logistics network. Our government began to advocate the macro-construction strategy of "big logistics channel", while the related enterprises began a new round of micro-reconstruction of network layout. Both of them look forward to opening up the large logistics network channels from top to bottom. I hope to reduce the cost of social logistics and improve the efficiency of logistics. Under this historical background, considering the present situation of the development of social logistics in China, this paper studies a special kind of axle-spoke logistics network design problem, that is, multi-hub channel axis-spoke logistics network. In this problem, due to the limitation of investment and the fact that the international logistics network can not be overcome by geographical factors at present, the hub level network with complete connectivity can not be formed between the hub nodes in the network. Therefore, in this paper, a series of interconnected channel networks must be formed for the location of hub nodes, which can realize the economies of scale of transportation cost or transport time by connecting efficient channels between hubs. A pure integer nonlinear programming model is proposed to solve the problem of hub location and channel configuration in network design. The objective of the study is to minimize the total weighted transportation time between all the nodes and to consider the budget constraints of the total cost of the construction of the logistics hub network, taking into account the time consumption of logistics operations at the key nodes of the hub network, and the objective of the study is to minimize the total weighted transportation time between all the nodes. Make it more in line with our current logistics network design status and demand. In this paper, a hybrid elite genetic algorithm (Hybrid Elitist Genetic Algorithm,HEGA) is proposed to solve the above model. This algorithm combines the basic idea of traditional genetic algorithm and elite reservation strategy, and introduces the Metropolis acceptance criterion and the update rule of particle swarm optimization algorithm into genetic operation, and obtains a global search ability. Efficient convergence, accurate and stable heuristic algorithm. By comparing the experimental results of LINGO and HEGA algorithm in the same scale calculation, the consistent calculation results and the stable and ideal convergence curve of HEGA algorithm are obtained. The accuracy and convergence of the HEGA algorithm proposed in this paper for solving small scale problems are proved. It also shows the speed of solving the problem beyond the exact algorithm. The calculation results of small and medium scale and large scale standard examples verify the effectiveness of the HEGA algorithm, regardless of its convergence. In terms of accuracy and stability, the HEGA algorithm has a better performance in solving the multi-hub channel axis-spoke logistics network design problem proposed in this paper. The purpose of this paper is to put forward a class of logistics network planning and design methods that meet the needs of the times.
【學(xué)位授予單位】:長安大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:F259.2;U115
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 王磊;羅小華;俞淼;夏順興;;基于精英策略的遺傳算法在功能驗證中的應(yīng)用[J];華東理工大學(xué)學(xué)報(自然科學(xué)版);2016年05期
2 辛曼玉;;“一帶一路”戰(zhàn)略下國際物流大通道建設(shè)研究[J];物流技術(shù);2015年16期
3 胡青蜜;胡志華;;考慮運輸成本與時間競爭的軸輻式網(wǎng)絡(luò)設(shè)計問題[J];華中師范大學(xué)學(xué)報(自然科學(xué)版);2015年02期
4 胡志華;洪雯婷;胡青蜜;;軸輻式物流網(wǎng)絡(luò)擴(kuò)張的樞紐重配置優(yōu)化[J];上海海事大學(xué)學(xué)報;2015年01期
5 伍艷蓮;姜海燕;莊嘉祥;郭小清;許一驊;;精英策略個體優(yōu)勢遺傳算法研究[J];計算機(jī)工程與應(yīng)用;2016年07期
6 胡青蜜;胡志華;;考慮不確定貨流及其影響的軸輻式網(wǎng)絡(luò)隨機(jī)規(guī)劃模型[J];華中師范大學(xué)學(xué)報(自然科學(xué)版);2014年02期
7 劉存緒;熊宗輝;霍麗婭;陳嘉翔;;現(xiàn)代物流網(wǎng)絡(luò)結(jié)構(gòu)類型的研究[J];成都工業(yè)學(xué)院學(xué)報;2013年04期
8 胡青蜜;胡志華;陶莎;;二級軸輻式零擔(dān)物流網(wǎng)絡(luò)設(shè)計的資源均衡利用問題[J];公路交通科技;2013年04期
9 趙晉;霍佳震;;軸輻式服務(wù)網(wǎng)絡(luò)規(guī)劃研究綜述[J];上海管理科學(xué);2010年06期
10 崔小燕;李旭宏;毛海軍;張永;楊平樂;;無容量約束單分配軸-輻式物流網(wǎng)絡(luò)設(shè)計[J];交通運輸系統(tǒng)工程與信息;2010年05期
相關(guān)博士學(xué)位論文 前3條
1 楊光華;區(qū)域物流網(wǎng)絡(luò)結(jié)構(gòu)的演化機(jī)理與優(yōu)化研究[D];中南大學(xué);2010年
2 翁克瑞;軸輻式物流網(wǎng)絡(luò)設(shè)計的選址與路線優(yōu)化研究[D];華中科技大學(xué);2007年
3 李陽;軸輻式網(wǎng)絡(luò)理論及應(yīng)用研究[D];復(fù)旦大學(xué);2006年
相關(guān)碩士學(xué)位論文 前4條
1 李高波;具有容量約束的混合軸輻式多式聯(lián)運樞紐網(wǎng)絡(luò)設(shè)計[D];長安大學(xué);2014年
2 朱宇清;多式聯(lián)運軸輻式物流網(wǎng)絡(luò)的設(shè)計優(yōu)化研究[D];長安大學(xué);2013年
3 張銀花;基于服務(wù)能力的軸輻式物流網(wǎng)絡(luò)構(gòu)建研究[D];北京交通大學(xué);2012年
4 吳桂芳;物流配送中心選址優(yōu)化模型及算法研究[D];武漢理工大學(xué);2009年
,本文編號:2425046
本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/2425046.html