本文選題：人道救援物流 + 最后一公里運(yùn)輸�。� 參考：《西南交通大學(xué)》2014年碩士論文

【摘要】：近年來(lái)各種突發(fā)事件(自然災(zāi)害、暴力沖突、瘟疫傳播等)頻發(fā)。應(yīng)急物資由配送中心及時(shí)、準(zhǔn)確、高效的運(yùn)送到災(zāi)民手中的最后一公里運(yùn)輸是災(zāi)后應(yīng)急響應(yīng)的核心,決定著災(zāi)難救援運(yùn)作的成敗。最后一公里運(yùn)輸問(wèn)題的求解目標(biāo)通常是運(yùn)輸成本的最小化(效率目標(biāo))或某類(lèi)服務(wù)水平指標(biāo)的最大化(效益目標(biāo),如需求滿(mǎn)足量、物資配送的速度等),但卻會(huì)導(dǎo)致一些距離配送中心較近的受災(zāi)點(diǎn)獲得物資的時(shí)間遠(yuǎn)長(zhǎng)于偏遠(yuǎn)地區(qū)以及各受災(zāi)點(diǎn)獲得首批物資的時(shí)間長(zhǎng)短差別很大等分配不公平現(xiàn)象的發(fā)生。這不僅背離了人道救援物流及時(shí)拯救更多生命的目標(biāo),也容易造成災(zāi)情的擴(kuò)大化。如何確定最后一公里運(yùn)輸?shù)暮线m目標(biāo),為所有受災(zāi)點(diǎn)提供同等水平的服務(wù)并在盡可能相同的時(shí)間內(nèi)為所有的受災(zāi)點(diǎn)提供一定比例的首批應(yīng)急物資己成為降低災(zāi)難對(duì)人類(lèi)社會(huì)危害的關(guān)鍵。本文主要從公平目標(biāo)的建模與分析以及多目標(biāo)的選擇與融合兩個(gè)方面對(duì)最后一公里運(yùn)輸問(wèn)題進(jìn)行了研究。 1、針對(duì)災(zāi)后應(yīng)急物資嚴(yán)重短缺、運(yùn)輸車(chē)輛不足的情況,提出了分批到貨的應(yīng)急物資配送模型,各受災(zāi)點(diǎn)的需求量分多周期由多車(chē)分批予以滿(mǎn)足。定義了由災(zāi)民需求未滿(mǎn)足率表達(dá)的負(fù)效用函數(shù),將最后一公里運(yùn)輸?shù)墓侥繕?biāo)歸納為所有周期各受災(zāi)點(diǎn)產(chǎn)生的負(fù)效用函數(shù)值之和的最小化,該目標(biāo)實(shí)現(xiàn)了物資配送的均衡性與公平性。算例結(jié)果表明：相對(duì)于運(yùn)輸成本的最小化以及物資到達(dá)時(shí)間的最小化,公平目標(biāo)能夠在最短的時(shí)間內(nèi)為所有的受災(zāi)點(diǎn)提供較高需求滿(mǎn)足率的物資。 2、基于應(yīng)急物資分類(lèi)與物資供應(yīng)的不確定性,建立了效率與公平相結(jié)合的多目標(biāo)多周期最后一公里運(yùn)輸規(guī)劃模型。效率目標(biāo)計(jì)算了規(guī)劃周期內(nèi)的車(chē)輛路徑總成本,公平目標(biāo)均衡了規(guī)劃周期內(nèi)由物資需求未滿(mǎn)足率定義的懲罰成本。利用Matlab中的Yalmip工具箱對(duì)模型進(jìn)行編程,算例結(jié)果表明：懲罰成本參數(shù)決定了各類(lèi)物資配送的優(yōu)先級(jí)別,只有當(dāng)某類(lèi)物資的懲罰成本參數(shù)大于特定值時(shí)才會(huì)對(duì)其進(jìn)行配送。當(dāng)物資的懲罰成本參數(shù)相同時(shí),每個(gè)周期各類(lèi)物資的配送量大小與受災(zāi)點(diǎn)對(duì)該類(lèi)物資的需求量成正比,但各類(lèi)物資的需求未滿(mǎn)足率卻保持一致。 本文的研究為應(yīng)急物資的合理分配,最后一公里運(yùn)輸合適目標(biāo)的選擇以及人道救援運(yùn)作效率的提高提供了新的思路。
[Abstract]:In recent years, a variety of emergencies (natural disasters, violent conflicts, plague spread, etc.) frequent. The last kilometer transportation of emergency materials from distribution center to disaster victims is the core of post-disaster emergency response, which determines the success or failure of disaster relief operation. The goal of solving the last kilometer transport problem is usually the minimization of transport cost (efficiency target) or the maximization of certain service level indicators (benefit target, such as demand satisfaction, etc.) The speed of material distribution, however, will lead to the unfair distribution of goods in some disaster areas near the distribution center, which is far longer than that in remote areas, and the time of obtaining the first batch of materials varies greatly among the disaster sites. This not only deviates from the goal of saving more lives in time, but also easily causes disaster expansion. How to determine the appropriate target for the last kilometer of transport, Providing the same level of service to all the affected sites and providing a certain proportion of the first batch of emergency supplies to all the affected sites at the same time as possible has become the key to reducing the harm to human society caused by the disaster. In this paper, the last kilometer transportation problem is studied from two aspects: modeling and analysis of fair objective and multi-objective selection and fusion. 1. In view of the serious shortage of emergency materials and the shortage of transportation vehicles after the disaster, a delivery model of emergency materials in batches is put forward, and the demand of each disaster spot is met by multiple vehicles in batches. The negative utility function expressed by the rate of unsatisfied needs of the disaster victims is defined, and the fair objective of the last kilometer transportation is reduced to the minimization of the sum of the values of the negative utility functions generated by all the affected points during the period. This goal realizes the balance and fairness of material distribution. The numerical results show that the fair target can provide all the affected sites with high demand satisfaction rate in the shortest time compared with the minimization of transportation cost and the minimum of material arrival time. 2. Based on the uncertainty of emergency material classification and material supply, a multi-objective and multi-cycle last kilometer transportation planning model combining efficiency and fairness is established. The efficiency objective calculates the total vehicle routing cost in the planning cycle, and the fair objective balances the penalty cost defined by the unmet rate of material demand in the planning cycle. The model is programmed by using the Yalmip toolbox in Matlab. The results show that the penalty cost parameter determines the priority of all kinds of material distribution, and only when the penalty cost parameter of a certain material is greater than the specific value will it be distributed. When the penalty cost parameters of materials are the same, the distribution quantity of each cycle is directly proportional to the demand for this kind of materials at the disaster point, but the unsatisfied rate of each kind of materials remains the same. The research in this paper provides a new idea for the rational distribution of emergency materials, the choice of suitable target for the last kilometer transportation and the improvement of the operational efficiency of humanitarian rescue.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：U116

【參考文獻(xiàn)】

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

1 汪定偉,張國(guó)祥;突發(fā)性災(zāi)害救援中心選址優(yōu)化的模型與算法[J];東北大學(xué)學(xué)報(bào);2005年10期

2 趙林度;;城市重大危險(xiǎn)源應(yīng)急物流網(wǎng)絡(luò)研究[J];東南大學(xué)學(xué)報(bào)(哲學(xué)社會(huì)科學(xué)版);2007年01期

3 方磊,何建敏;給定限期條件下的應(yīng)急系統(tǒng)優(yōu)化選址模型及算法[J];管理工程學(xué)報(bào);2004年01期

4 石彪;池宏;祁明亮;宋江海;許建國(guó);;應(yīng)急物資運(yùn)輸?shù)膬呻A段車(chē)輛調(diào)度模型[J];系統(tǒng)工程;2012年07期

5 秦緒偉;劉曉;李凱;;面向自然災(zāi)害的救援準(zhǔn)備計(jì)劃:隨機(jī)規(guī)劃模型與案例[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年11期

6 陳志宗;尤建新;;重大突發(fā)事件應(yīng)急救援設(shè)施選址的多目標(biāo)決策模型[J];管理科學(xué);2006年04期

7 李陽(yáng),李聚軒,滕立新;大規(guī)模災(zāi)害救災(zāi)物流系統(tǒng)研究[J];科技導(dǎo)報(bào);2005年07期

8 高文軍;陳菊紅;胡飛虎;;我國(guó)應(yīng)急物流研究綜述與展望[J];物流科技;2009年08期

9 陳鋼鐵;帥斌;;在時(shí)間窗條件下應(yīng)急物資運(yùn)輸路徑優(yōu)化問(wèn)題研究[J];鐵道運(yùn)輸與經(jīng)濟(jì);2010年03期

10 歐忠文,李科,姜玉宏,王會(huì)云,甘文旭;應(yīng)急物流保障機(jī)制研究[J];物流技術(shù);2005年09期

，

本文編號(hào)：1819386