本文選題：物流節(jié)點　切入點：設(shè)施選址　出處：《北京交通大學(xué)》2017年碩士論文

【摘要】：近年來,我國交通運輸線路建設(shè)取得了突飛猛進的發(fā)展。在交通運輸線路建設(shè)工程中,建設(shè)材料的物流成本占據(jù)較大的比重,最大化降低物流成本成為節(jié)約工程成本的重要途徑。通常情況下,建設(shè)所需材料都是由事先建設(shè)好的物流節(jié)點運往待建線路。因此,合理進行物流節(jié)點的選址,是降低物流成本的關(guān)鍵。而在交通運輸線路建設(shè)工程中,物料的需求沿著待建線路產(chǎn)生,這區(qū)別于一般選址問題中需求產(chǎn)生于離散點的情況,需求具有"線狀"特征。在選址研究中,將此類問題定義為線狀需求物流節(jié)點選址問題。本文立足于交通運輸線路建設(shè)蓬勃發(fā)展的時代背景,研究了一個線狀需求物流節(jié)點選址問題。論文在借鑒既有線狀需求選址研究成果的基礎(chǔ)上,選擇了歐氏距離作為距離范式,利用線積分刻畫需求的線狀特性,建立了一個基于歐氏距離的線狀需求物流節(jié)點選址模型,并根據(jù)線積分的性質(zhì)及積分定義,借鑒經(jīng)典的重心法、微分法以及迭代法的思想對模型進行求解。論文首先介紹了研究背景、研究意義、研究內(nèi)容、方法及框架,綜述了選址問題、針對"顧客"的選址研究、針對衡量標(biāo)準的理論研究,提出了需求為線狀,衡量標(biāo)準為歐氏距離的物流節(jié)點選址問題。為了解決這一問題,本文采用需求密度函數(shù)的線積分描述線狀需求,選擇歐氏距離函數(shù)作為衡量標(biāo)準,并對各項參數(shù)進行分別研究和逐一設(shè)定,建立了基于歐氏距離的線狀需求物流節(jié)點選址模型。再借鑒經(jīng)典選址模型算法中的重心法和微分法,提出求解本文模型的有效算法,并借助MATLAB R2012a編寫程序?qū)崿F(xiàn)該算法。最后通過一個實際的算例驗證了本文建立的模型及設(shè)計的算法具備可行性�；趯灸Ｐ偷纳钊胩骄�,本文又提出了兩個拓展模型,分別建立了基于平方歐氏距離的線狀需求物流節(jié)點選址模型和多節(jié)點下基于歐氏距離的線狀需求物流節(jié)點選址模型,從距離范式和節(jié)點個數(shù)的角度對基本模型進行了延伸。
[Abstract]:In recent years, China's transportation line construction has made rapid development. In the transportation line construction project, construction materials occupy a larger proportion of logistics costs, maximize reduce logistics cost has become an important way to save the cost of the project. Typically, construction materials required are good for the construction of logistics nodes in advance the line. Therefore, the reasonable location of logistics nodes. The key is to reduce the cost of logistics and transportation lines. In construction engineering, material demand along the line to be built, which is different from the general location problem in demand arising from the discrete point, demand has linear characteristics. In the location of the this problem is defined as a linear demand logistics node location problem. This paper is based on the transportation line construction boom as the background, study a linear demand logistics node The location based location problem. Research results in reference to existing shape requirements, choose the Euclidean distance as the distance paradigm, using line integral linear characterizations of properties of the demand, set up a location model of the linear demand of logistics nodes based on Euclidean distance, and according to the nature and definition of integral line integrals, using classical gravity method, to solve the model differential method and thought of iterative methods. The paper firstly introduces the research background, research significance, research content, method and framework, summarizes the location problem, according to the "customer" location research, theory research of the measure standard, put forward the demand for the line, the criteria for the logistics node Euclidean distance location problem. In order to solve this problem, this paper uses demand density function of line integral description of linear demand, choose the Euclidean distance function as a measure of the standard, and the various parameters. For research and set one by one, established the location model of the linear demand of logistics nodes based on Euclidean distance. Then from the classic location of center of gravity method and differential method model algorithm, proposed effective algorithm to solve the model, and using the MATLAB R2012a program to realize the algorithm. Finally, through a practical example to verify this the model and algorithm design is feasible. The basic model based on in-depth research, this paper proposes two development model, respectively set up location model of the linear demand of logistics nodes based on Euclidean distance model and multi linear demand logistics node location node square based on Euclidean distance, the extension of the basic model from paradigm and the number of nodes.

【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：U116.2

【參考文獻】

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

1 程珩;牟瑞芳;;物流配送中心選址的重心法探討[J];交通運輸工程與信息學(xué)報;2013年01期

2 韓晨;程軍;楊秀英;;地理坐標(biāo)系淺析[J];價值工程;2012年32期

3 韓皓;王素玲;;多級物流節(jié)點選址問題建模與求解[J];上海海事大學(xué)學(xué)報;2009年04期

4 蔣長兵,王姍姍;精確重心算法在物流節(jié)點選址中的應(yīng)用[J];物流技術(shù);2005年09期

5 苗興東,李映紅,范存軍;重心法選址探討[J];交通標(biāo)準化;2004年10期

6 魯曉春,詹荷生;關(guān)于配送中心重心法選址的研究[J];北方交通大學(xué)學(xué)報;2000年06期

，

本文編號：1713860