应急物资配送的网络优化问题研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
随着社会经济的快速发展,人口、资源、交通、环境等社会问题日益突出,自然灾害也频繁发生,突发事件已经极大地危害着我国经济发展与社会稳定,突发事件下应急物流的调度问题也成为关注的焦点,突发公共事件应急物流系统必须在有限的时间、空间和资源约束下满足应急物流需求,以实现时间效益最大化和灾害损失最小化。论文以应急物资配送网络为研究对象,利用最短路理论建立应急物资配送网络规划模型进行优化,从而找到满足多目标要求的最优配置网络,提高应急物资配送的有效性和快速响应速度,支持应急物流调度决策。
     论文重点针对应急物资配送网络应急调度的三种突发情形:1.配送网络的配送成本发生改变的情形;2.当某条路由于突发事件发生断裂的情形;3.已有网络不畅通而新修了一条路的情形。建立基于图论的最短路概念模型,将其分别抽象为最短路问题的三种具体情形:1.弧上权值的改变(变大或变小)的情形;2.去掉网络中的一条弧的情形;3.在网络中添加一条弧的情形。进而,运用具有约束条件的最短路问题分析方法进行了理论分析,给出了每种情形的解决方法和算法设计。采用Dijkstra以及Floyd两种算法,编写程序,求得最优解,并在实例中进行了仿真实验。
     论文研究未能列举出应急物流调度问题的各种可能情况,理论模型的建立没有考虑应急物流调度多目标决策下的资源冲突(约束条件不能全部满足)等对决策结果的影响,均将作为今后继续研究的方向之一。
With the social and economic development, population, resources, transportation, environmental and other social problems have become increasingly prominent, meanwhile, the natural disaster also frequently occurs. Emergencies and incidents already have been harming China’s economic development and the social stability. Dispatch problems, which are about Emergency Logistics Distribution in the emergencies and incidents, have been the focus in our country. Emergency logistics systems should meet the demand of the emergency logistics in the constraint condition of the limited time, the space and the resources, which can realizes the maximization of the time benefit and the minimum of the disaster loses. This dissertation takes the network of Emergency Logistics Distribution as its object, and takes use of the Shortest-path theory to establish the mathematical models on the network of Emergency Logistics Distribution, and then to optimize it. It will therefore find out the optimized distribution network to meet the requirement of multiple objective functions with update constraints. It is helpful to enhance the validity and the high response speed of Emergency Logistics Distribution, at the same time to support dispatch decision-making on the emergency logistics.
     This dissertation aims at three kinds of sharp-edged situations about the network of Emergency Logistics Distribution, as follows: the first is that cost of distribution network happens to charge; the second is that emergencies and incidents cause some road to be broken; the third is that, because existing network is unsmooth, it needs to rebuild another road. According to the above three kinds of situations, the paper adopts shortest-path concept model based on the graph theory, and it abstract three kinds of the conditions on the shortest-path problem, as follows: the first is that weights on the arc have to charge (fill out or trail off); the second is that an arc of the network has been deleted; the third is that an arc of the network has been added. Proceed to the next step, it goes to theoretical analysis and has given the solution and algorithm design for each condition. It uses Dijkstra and Floyd arithmetic, and obtains the optimal solution with the editing routine. Meanwhile, it takes the simulation experiment in the case.
     This dissertation has not been able to enumerate each kind of possibility situation on the dispatch problems of the Emergency Logistics, and the establishment of the theoretical model has not considered resources conflict of the multi-objective decision about the Emergency Logistics(the constraints cannot be satisfied completely), which makes influence to result of the strategic decision. All of these will be as one of research areas to continue studying.
引文
[1][俄]卡普斯京(В.Ф.Капустин),李国海译.运筹学:问题与前景[J].学科趋势,2005,39-40.
    [2]彭岳林,邱赛兵.网络最短路灵敏度的算法[J].山东理工大学学报,2004,18(3):50-52.
    [3]陈挚,谢政.最短路的灵敏度分析[J].数学理论与应用,2002,22(2):104-106.
    [4]徐冬梅.最短路问题的Gauss-Seidel矩阵算法[D].沈阳:东北大学,2005.
    [5]郑莉,张瑞丰,李莉,余小沛.C++语言程序设计案例教程[M].北京:清华大学出版社,2005.
    [6]肖位枢.图论及其算法[M].北京:航空工业出版社,1993,183-202.
    [7]Ramkumar Ramaswamy James Bolin Nil opal Chakravarti. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs [J],Math program,SerA,2004,7(7): 1-15.
    [8]Floyd R W.Algorithm97, shortest path [J], Common Acm,1962,15(2): 339-345.
    [9]Booth,H.,Westbrook.A linear algorithm for analysis of minimum spanning and shortest path trees of planar graphs[J], 1994,341-352.
    [10]Sowinski LL.The Lean,Mean Supply Chain and its Human Counterpart[J].World Trade.2003, 16(6):18.
    [11]Thomas A.Supply Chain Reliability for Contingency Operations[J].Annual Reliability and Maintainability Symposiums.2002:61-67.
    [12]Kembali Cook D , Stephenson R . Lesson in logistics from Somalia [J] Disaster.1984,8:57-66.
    [13]Carter WN.Disaster Management—A Disaster Manager'’S Handbook [M].Philippines:Asian Development Bank,1992.
    [14]Thomas A.Supply Chain Reliability for Contingency Operations [J].Annual Reliability and Maintainability Symposium.2002:61-67.
    [15]Cottrill K.Preparing for the Worst[J].Traffic World.2002,266(40):15.
    [16]Rathi A K, Church R L and Solanki R S.Allocating Resources to Support a Multi-commodity Flow with Time Windows[J].Logistics and Transportation Review.1993,28:167-188.
    [17]Equi L , Gallo Marziale S. A Combined Transportation and scheduling Problem[R].Pisa,Italy Working Paper.Pisa University.1996:523-538.
    [18]Barbarosoglu G,Aida Y.A.Two-stage Stochastic Programming Framework for Transportation Planning in Disaster Response[J].Journal of the Operational Research Society.2004,55:43-53
    [19]Lee H W.Zbindenn M . Marrying Logistics and Technology for Effective Relief[J].Forced Migration Review.2003,l8:34-35
    [20]Equi L,Gallo G Marziale S,et a1.A Combined Transportation and Scheduling Problem[J].European Journal of Operational Research.1 997 (97):94-104.
    [21]Long D . Logistics for Disaster Relief : Engineering on the Runm . 1iE Solutions.1997,29(6):26-29
    [22]Kaatrud D B,Samii R WasSenhove L.N.UN Joint Logistics Centre:a Coordinated Response to Common Humanitarian Logistics Concerns[J].Forced Migration Review,2003,18:1l-14.
    [23]高东椰,刘新华.浅论应急物流[J].中国物流与采购,2003.(23):22-23.
    [24]计雷,龚卫锋.应急物流交通运输保障[J].中国物流与采购,2003.
    [25]宋明安.紧急救灾物流配送系统模式构建[D].中国台湾省:国立交通大学交通运输研究所,2005.
    [26]刘春林,何建敏,施建军.一类应急物资调度的优化模型研究阴.中国管理科学,2001,9(3):29-36.
    [27]何建敏,刘春林.限制期条件下应急车辆调度问题的模糊优化方法[J].控制与决策.2001,16:318-321.
    [28]黄洪涛.应急物流系统研究[D].大连海事大学,2006.
    [29]欧忠文,李科,姜玉宏等.应急物流保障机制研究[J].物流技术.2005,(9):13-15.
    [30]施佑林.灾后工程抢修作业与赈灾物流排程的研究[D].中国台湾省:国立中央大学土木工程研究所,2004.
    [31]刘海军.应急物流交通运输保障[J].中国物流与采购,2003.
    [32]邹旭东,郑四发,班学钢,连小珉.具有交通限制约束的道路网络最优路径算法[J].中国物流与采购,2002.
    [33]欧忠文,李科,姜玉宏等.应急物流保障机制研究[J].物流技术.2005,(9):13-15.
    [34]王宗喜.应急物流系统及其快速反应机制研究[J].中国软科学.2005,(6):127-131.
    [35]谢如鹤,宗岩.论我国应急物流体系的建立[J].广州大学学报:社会科学版.2005,4(11):55-58