运用贪婪算法构建物流网络的方法与应用研究
|
摘要
贪婪技术就是在每一步操作中,“贪婪”地选择最佳操作,并希望通过一系列局部的最优选择进而对全局问题产生一个最优解。他的特点是一步一步的进行操作,每一步都采用某个优化测度作最优选择从而对目前构造的部分解做一个扩展,直到获得问题的完整解为止。
贪婪算法作为一种改进了的分级处理方法,其能否真正解决问题的关键还在于其能否找到合适的量度标准。在一个给定的问题上面,通常都会有好几种不同的量度标准。并且这些量度标准仿佛都是可取的,然而在实际情况中我们如果采用其中大多数的量度标准作处理,我们所得到的“最优解”并不是真正的问题最优解。所以决定一个贪婪算法的效用往往是看其能否选择出产生问题最优解的最优量度标准。本文提出了一种计算物流成本的量度标准,并以该标准作为后面判断的依据。
在现代社会中物流产业已经成为国民经济发展的动脉,其发展程度可以说是衡量一国现代化程度和综合国力的重要标志之一。但是目前我国物流成本占GDP比例较高,下降速度也较为缓慢,这反映出我国物流效益整体水平仍然较低。而要改善现状就要提高我们的物流服务,减少物流成本。而运用贪婪算法来处理实际物流中所遇到的物流中心选址和路径选择问题已经成为一个研究方向被人们所关注。
本文以舟山海洋经济新区的发展规划为背景,主要工作如下:
1)介绍了贪婪算法的概念以及研究现状,并对几种经典的算法(Dijkstra算法和Prim算法)进行了简要介绍和分析。
2)研究了贪婪算法在物流中心选址问题上的应用。包括选址问题是如何产生的,以及目前所用的几种解决方法,并着重介绍了运用贪婪算法解决这一问题时的基本原理和计算方法。
3)研究了贪婪算法在解决物流路径问题上的应用,并分析所用的基本原理和存在的不足,进而提出一种新的并行计算方法来加以解决。
4)运用上述算法对舟山市的物流网络进行分析,并进行了技术实现。
The Greed technology is a strategy by which we―greedily‖choose the optimal operation in every step, hoping that we get an optimal solution of the whole problem through a series of locally optimal choice. His characteristic lies in solving the problem step by step, with each step using an optimization measure to make optimal choices to make an extension on the current construction until we completely solve the problem.
As an improved hierarchical processing method, the Greedy algorithm’s effectiveness also lies in whether we could find a suitable standard of measurement. There are often several different standards of measurement in a given problem. And all these measures are seemed desirable. However, actually, the" optimal" we get is not the real optimal solution if we adopt most of these standard measures for treatment to the problem. So the effectiveness of a greedy algorithm depends on whether we could find the best standard of measurement. This article offers a standard of measurement and uses it to deal with the mentioned problems.
In modern society, logistics has become the artery of national economic development. Its development can be regarded as a measure of a country's modernization and also as the symbol of a country’s comprehensive national strength. But at present our country content sheds cost to occupy GDP proportion is still in high position, the falling speed is relatively slow, which reflects the overall level of China's logistics benefit is still low. In order to improve the service of logistics, we need to minimize the cost of the logistics network. Using the greedy algorithm to deal with the practical logistics center location and path selection has become one of the hot research topics concerned by scientists.
.This article under the background of the ZhouShan Marine Economic Zone Development Plan introduces :
1)The concept and research status quo of greedy algorithm and introduce several classical algorithms(Prim algorithm, Dijkstra algorithm), and then put forward the innovation of this article and article structure.
2) This article introduces how to use the greedy algorithm to solve the logistics center location problem, including the introduction of how the location problem comes up and the using of several solving methods. Then it introduces the use of the greedy algorithm and the basic principles and the methods of calculation to solve these problems.
3) This article studies the greedy algorithm in solving logistics routing problem on the application and analysises the basic principle, then proposes a new method of parallel computing.
4) Based on this algorithm, we analysis the Zhoushan city logistics with the application of this technology.
贪婪算法作为一种改进了的分级处理方法,其能否真正解决问题的关键还在于其能否找到合适的量度标准。在一个给定的问题上面,通常都会有好几种不同的量度标准。并且这些量度标准仿佛都是可取的,然而在实际情况中我们如果采用其中大多数的量度标准作处理,我们所得到的“最优解”并不是真正的问题最优解。所以决定一个贪婪算法的效用往往是看其能否选择出产生问题最优解的最优量度标准。本文提出了一种计算物流成本的量度标准,并以该标准作为后面判断的依据。
在现代社会中物流产业已经成为国民经济发展的动脉,其发展程度可以说是衡量一国现代化程度和综合国力的重要标志之一。但是目前我国物流成本占GDP比例较高,下降速度也较为缓慢,这反映出我国物流效益整体水平仍然较低。而要改善现状就要提高我们的物流服务,减少物流成本。而运用贪婪算法来处理实际物流中所遇到的物流中心选址和路径选择问题已经成为一个研究方向被人们所关注。
本文以舟山海洋经济新区的发展规划为背景,主要工作如下:
1)介绍了贪婪算法的概念以及研究现状,并对几种经典的算法(Dijkstra算法和Prim算法)进行了简要介绍和分析。
2)研究了贪婪算法在物流中心选址问题上的应用。包括选址问题是如何产生的,以及目前所用的几种解决方法,并着重介绍了运用贪婪算法解决这一问题时的基本原理和计算方法。
3)研究了贪婪算法在解决物流路径问题上的应用,并分析所用的基本原理和存在的不足,进而提出一种新的并行计算方法来加以解决。
4)运用上述算法对舟山市的物流网络进行分析,并进行了技术实现。
The Greed technology is a strategy by which we―greedily‖choose the optimal operation in every step, hoping that we get an optimal solution of the whole problem through a series of locally optimal choice. His characteristic lies in solving the problem step by step, with each step using an optimization measure to make optimal choices to make an extension on the current construction until we completely solve the problem.
As an improved hierarchical processing method, the Greedy algorithm’s effectiveness also lies in whether we could find a suitable standard of measurement. There are often several different standards of measurement in a given problem. And all these measures are seemed desirable. However, actually, the" optimal" we get is not the real optimal solution if we adopt most of these standard measures for treatment to the problem. So the effectiveness of a greedy algorithm depends on whether we could find the best standard of measurement. This article offers a standard of measurement and uses it to deal with the mentioned problems.
In modern society, logistics has become the artery of national economic development. Its development can be regarded as a measure of a country's modernization and also as the symbol of a country’s comprehensive national strength. But at present our country content sheds cost to occupy GDP proportion is still in high position, the falling speed is relatively slow, which reflects the overall level of China's logistics benefit is still low. In order to improve the service of logistics, we need to minimize the cost of the logistics network. Using the greedy algorithm to deal with the practical logistics center location and path selection has become one of the hot research topics concerned by scientists.
.This article under the background of the ZhouShan Marine Economic Zone Development Plan introduces :
1)The concept and research status quo of greedy algorithm and introduce several classical algorithms(Prim algorithm, Dijkstra algorithm), and then put forward the innovation of this article and article structure.
2) This article introduces how to use the greedy algorithm to solve the logistics center location problem, including the introduction of how the location problem comes up and the using of several solving methods. Then it introduces the use of the greedy algorithm and the basic principles and the methods of calculation to solve these problems.
3) This article studies the greedy algorithm in solving logistics routing problem on the application and analysises the basic principle, then proposes a new method of parallel computing.
4) Based on this algorithm, we analysis the Zhoushan city logistics with the application of this technology.
引文
[1] Anany Levitin .Introduction to the Design and Analysis of Algorithms[M].北京.清华大学出版社,2010:232—250.
[2] Cormen.T.H,Leiserson C.E.,Rivest R.L.,and C.Stein. Introduction to Algorithms,2nd ed[M].MIT Press,Cambridge,MA,2001.
[3]程树林,钱萌.改进Kruskal算法仿真城市通信网络建设[J]计算机应用与软件.2008.10(169-171)
[4] Prim R.C. Shortest connection networks and some generalizations[J]. Bell System Technical Journal,vol.36,no.1,1957,1389-1401
[5] Kruskal J.B.On the shortest spanning subtree of a graph and the traveling salesman problem[J].Proceedings of the American Mathematical Society,vol.7,1956,48-50.
[6]刘志宇,杨柳.一种改进的Dijkstra算法在嵌入式GIS中的应用[J].计算机应用与软件,2009,(12):262-264.
[7]司连法,王文静.快速Dijkstra最短路径优化算法的实现[J].测绘通报,2005,(8):15-18.
[8]章海峰.进口物资中转运输选址-分配问题[D].武汉:华中科技大学,2006.
[9]张健.公路快速货运轴辐式网络运载规划研究与应用[D].济南:山东大学,2008.
[10]何骏.长三角区域流通服务业的发展研究[J].当代经济管理,2011.(08):39-44
[11]上海统计年鉴2010[Z].北京:中国统计出版社.
[12]张祥建.2009年上海城市经济与管理发展报告[M].上海:上海财经大学出版社,2010.
[13]国家统计局人口和就业统计司,劳动和社会保障部规划财务司.历年中国劳动统计年鉴[Z] .北京:中国统计出版社.
[14]赵洪祝.全面推进海洋经济发展示范区建设[J].今日浙江,2011,(07):10-12.
[15] Curry G.L.and R.W.Skeith.A dynamic programming algorithm for facility location and allocation[J].American Institute of Industrial Engineers Transactions, 1969,1:133-138.
[16] Wesolowsky G.O.Truscott W.G.The multiperiod location-allocation problem with relocation of facilities[J].Management Science,1975,22(1):57-65.
[17] Luce Brotcorne,Gilbert Laporte and Frederic Semet.Ambulance location and relocation models:invited review[J].European Journal of Operational Research, 2003,147:451-463.
[18] Geoffrion A.M and Graves G.W.Multicommodity distribution system design by benders decomposition[J].Management Science,1974,20:822-844.
[19] Alan T.Murray,Ross A.Gerrard.Capacitated service and regional constraints in location-allocation modeling[J].Location Science,1997,5(2):103-118.
[20] Moshe Eben-Chaime,Abraham Mehrez,Gad Markovich.Capacitated location allocation problems on a line[J].Computers&Operations Research,2002,29: 459-470.
[21] H.Topcuoglua,F.Coruta,M.Ermisb,G.Yilmaz.Solving the uncapacitated hub location problem using genetic algorithms[J].Computers&Operations Research, 2005,32:967-984.
[22] A.J.Scott.Dynamic location-allocation systems:Some basic planning strategies[J]. Environment and Planning,1971,3:73-82.
[23]董鹏,杨超,陈新.一类带能力约束的运输问题[J].海军工程大学学报,2004,16 (5):96-99.
[24] Laporte G,Nobert Y,Arpin H Q.An exact algorithm for solving a capacitated location-routing problem[J].Annals of Operation Research,1986,239-310.
[25] Sanjay Melkote,Mark S.Daskin.An integrated model of facility location and transportation network design[J].Transportation Research Part A,2001,35:515-538.
[26] C.S.Tapiero.Transportation-location-allocation problems over time[J].Journal of Regional Science,1971,11(3):377-384.
[27] Alfredo M,Blas P.A branch and bound algorithm for the transportation problem with location of p transshipment points[J].Computers Operations Research,1997, 24(7):659-678.
[28] Cem C,Basheer M,Khumawala,Japhett L,Anthony L.An algorithm for the capacitated multi-commodity multi-period facility location problem[J].Computers Operations Research,2001,28:411-427.
[29] Bernard Gendron,Jean-Yves Potvin,Patrick Soriano.A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements[J]. Parallel Computing,2003,29:591-606.
[30]袁庆达,陈旭梅,黎青松.基于“服务型”物流战略的p-Center选址问题研究[J].西南交通大学学报,2001,36(3):250-253
[31]陈子侠.考虑售后服务和配送成本的选址问题系统的建模仿真[J].计算机工程, 2003,29(7):23-23.
[32]谭凌,高峻峻,王迎军.基于库存成本优化的物流中心选址问题研究[J].系统工程学报,2004,19(1):59-65.
[33]张培林,魏巧云.物流物流中心选址模型及其启发式算法[J].交通运输工程学报,2003,3(2):65-68.
[34]陈曦,傅明.GIS环境下的物流物流中心选址模型与算法研究[J].计算技术与自动化2001,20(4):6-9.
[35]李延晖,马士华.基于时间约束的单源/p个中转点配送系统的MINLP模型[J].中国管理科学,2004,12(3):86-90.
[36] Jayaraman V, Guide JR V D R, Srivastava R. A closed-loop logistics model for remanufacturing [J].Journal of the Operational Research Society, 1999,50, 50 :497~508 .
[37] Fleischmann M, Krikke H R, Dekker R, et al. A characterisation of logistics networks for product recovery [J].Omega, 2000,28, 28 :653~666 .
[38] Shih L H. Reverse logistics system planning for recycling electrical appliances and computers in Taiwan[J] .Resources, Conservation and Recycling, 2001,32, 32 :55~72 .
[39] Marin A, Pelegrin B. The return plant location prob-lem: modelling and resolution[J] .European Journal of Operational Research, 1998,104, 104 :375~392 .
[40] Fleischmann M, Bloemhof -Ruwaard J M, Dekker R,et al. Quantitative models for reverse logistics: a review[J] .European Journal of Operation Research, 1997,103, 103 :1~17 .
[41]黄冬梅,张岭,韩彦岭.并行搜救算法在确定灾后搜救路线中的应用[J].计算机应用研究,2011.28(2):472-480.
[42]孙强,沈建华,顾君忠.求图中顶点之间所有最短路径的一种实用算法[J].计算机工程,2002,28(2):134-136.
[43] Bergh van den F,Engelbrecht A P.A cooperative approach to particle swarm optimization[J].IEEE Trans on Evolutionary Computation,2004,8(3):225-239.
[44]来卫国,李鸥,程军.一种新的求解度约束最小生成树的遗传算法[J].计算机仿真,2008,25(8):162-165.
[45]刘志宇,杨柳.一种改进的Dijkstra算法在嵌入式GIS中的应用[J].计算机应用与软件,2009,(12):262-264.
[46]浙江省舟山市城市规划编制中心.舟山本岛及周边岛屿区域城乡一体化发展规划[R].2005.
[47]中国城市规划设计研究院.舟山市城市总体规划(2000~2020)[R].2001.
[48]马祖军,代颖.产品回收逆向物流网络优化设计模型[J].管理工程学报, 2005-12-30
[49]马祖军,代颖,刘飞.制造/再制造集成物流网络设计的随机规划模型[J].中国机械工程2006-05-10.09(902-906)
[50]周亦波,李志华,戴同,钟毅芳.单元制造系统布局模型及其求解[J].华中科技大学学报(自然科学版) 2002-01-30 01(65-67)
[51]庞明宝,魏连雨.区域物流线路网络双层规划研究[J].公路交通科技.2005.10(158-162)
[52]孙毅彪,王程铭.基于有向图规划的最佳物流路径策略分析及应用[J].运筹与管理.2003.02(110-113)
[53]吴云志,乐毅,王超,张友华.蚁群算法在物流路径优化中的应用及仿真[J].合肥工业大学学报(自然科学版)2009.02(211-214)
[54]乐美龙,香村俊武. Compound Method of Solving Logistics Routes Allocation[J].Journal of Shanghai Jiaotong University(Science) 2010.01(119-123)
[55]伍星华,王旭,林云.废旧产品回收再制造物流网络的优化设计模型[J].计算机工程与应用.2010.26(22-24)
[56]王建宇.现代物流若干问题研究[D].吉林大学.2008
[57]龚承柱,诸克军,郭海湘.基于蚁群算法的多目标网络铺设策略研究[J].计算机工程.2011.15期(177-180)
[58]孙凌宇,冷明,谭云兰,郁松年.赋权有向图的最小生成树算法[J]计算机工程.2010.02.( 61-63+66)
[59]许红波.舟山港散货水水中转运输发展战略研究及其技术经济评价[D].上海:上海海事大学.2003
[60] Hassan Salarieh, Hoda Sadeghian, Kaveh Merat. Chaos control in lateral oscillations of spinning disks via nonlinear feedback[J]. Nonlinear Analysis: Real World Applications, 2009, 10: 2864 - 2872.
[61] Krishna pada Das, Samrat Chatterjee, J. Chattopadhyay. Disease in prey population and body size of intermediate predator reduce the prevalence of chaos-conclusion drawn from Hastings–Powell model[J]. Ecological Complexity, 2009, 6(3): 363-374.
[62]程静跃.舟山群岛发展产业生态系统的生态承载力研究[D].杭州:浙江工业大学.2009
[63] Krishna pada Das, Samrat Chatterjee, J. Chattopadhyay. Disease in prey population and body size of intermediate predator reduce the prevalence of chaos-conclusion drawn from Hastings–Powell model[J]. Ecological Complexity, 2009, 6(3): 363-374.
[64]冯凌英.舟山城市空间环境特色研究[D].杭州:浙江大学,2008
[65] Geoffrion A.M,and McBride R.Lagrangean relaxation applied to capacitated facility location problems[J] .American Institute of Industrial Engineers Transactions, 1978,10:40-47.
[66] Cornuejols G.,M.Fisher and G.L.Nemhauser,On the uncapacitated location problem. [J].Annals of Discrete Mathmatics,1977,1:163-177.
[67] Suda Tragantalerngsak,John Holt,Mikael.An exact method for the two-echelon,single-source,capacitated facility location problem[J].European Journal of Operational Research,2000,123:473–489.
[68] Luce Brotcorne,Gilbert Laporte and Frederic Semet.Ambulance location and relocation models:invited review [J]. European Journal of Operational Research,2003,147:451-463.
[69] Kara B.Y and B.C.Tansel.On the single-assignment p-Hub center problem [J] . European Journal of Operation Research,2000,125:648-655.
[70] Jose A.Moreno Perez,J.Marcos Moreno-Vega,Inmaculada Rodriguez Martin. Variable neighborhood tabu search and its application to the median cycle problem[J].European Journal of Operational Research,2003,151:365-378.
[71] Mohan R.Akella,Rajan Batta,Eric M.Delmelle et al.Base station location and channel allocation in a cellular network with emergency coverage requirements [J] . European Journal of Operational Research,2005,164:301-323.
[72] Swarnkar R,Tiwari M.K.Modelling machine loading problem of FMSs and its solution methodology uUsing a hybrid tabu search and simulated annealing-based heuristic approach [J].Robotics and Computer-Integrated Manufacturing,2004,20(3):
[73] Aoyama I,Sato H,Nakajima K.Genetic algorithm and tabu search method for care service scheduling problem and comparison between these two Methods [J].Journal of the Operations Research Society of Japan,2001,44(3):280.
[74] Dorigo M,Gambardella M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computations,1997,1(1):53-66.
[75] Bullnheimer B,Hartl R.F,Strauss C.A new rank based version of the ant system- a computational study[J].Central European Journal for Operations Research and Economics,1998.
[76]苏仰娜.基于Flash的汽车模拟驾驶教学系统[J].河南大学学报(自然科学版)2010.40(3):307-310
[77]沈钧,李庆.Flash CS3 ActionScript3.0游戏开发基础与范例[M].北京:电子工业出版社,2008.
[78]朱治国,缪亮,陈艳丽.Flash ActionScript3.0编程技术教程[M].北京:清华大学出版社,2008.
[79] Joey Lott ,Danny Patterson. Advanced ActionScript 3 With Design Patterns [M].北京:清华大学出版社,2008.
[80]陈善亮,毛保华,丁勇.英国交通一体化政策与我国的对策[J].交通科技,2004(1):(63-66).
[81]张岚,贺玉龙,荣建,等.北京城乡交通一体化发展模式浅析[J].综合运输,2006(4):(49-52).
[82]叶彭姚,陈小鸿.功能组团格局城市道路网规划研究[J].城市交通,2006,4(1):(36-41).
[83]上海同济城市规划设计研究院.舟山市城市公共交通规划(2001年~2020年)[R].2002.
[84]陆化普,文国玮.BRT系统成功的关键:带形城市土地利用形态[J].城市交通,2006,4(3):11-15.
[85]陈伟峰,陈秋晓,郭涤寰.舟山中心城市组团间交通一体化策略研究[J].山西建筑.2008.18期
[86]彭涛,杭文.我国公路快速货运发展的切入点[J].现代交通科技,2006,3(1):64一68.
[87]马天山,何朝平.道路快速货运组织方式[J].长安大学学报(自然科学版),2005。25(3):62一65.
[88]孙晓燕.论我国公路运输业向现代物流业的转型[J].商场现代化,2005,16:119一200.
[89]宋传平.我国公路快速货运的发展研究[J].公路运输文摘,2003,10:23一27.
[90] TG Crainie,Gilbert LaPorte.Invited review : Planning model or freighttrans Portation[J]. EuroPean Journal of OPerationalResearch,1997,97(3):409一438
[91] M.Wasner,G Zap fel.A iniegrated multi-depot hub-loeation vehiele routing model for network Planning of Parcel service[J].international Joumal of Produetion Eeonomies,2004, 90(3):403一419
[92]朱桃杏,吴殿廷,赵莉琴.基于旅游体验视角的京津冀区域铁路交通线路评价与选择——空间句法模型和图论最小生成树Kruskal算法[C].Institute of Electrical and Electronics Engineers, Inc. 2010
[93]高维春,谭旭.基于Kruskal最大树聚类的教师教学质量评价[C].Institute of Electrical and Electronics Engineers, Inc.。2010
[94]程树林,钱萌.改进Kruskal算法仿真城市通信网络建设[J].计算机应用与软件.2008.10(169-171)
[2] Cormen.T.H,Leiserson C.E.,Rivest R.L.,and C.Stein. Introduction to Algorithms,2nd ed[M].MIT Press,Cambridge,MA,2001.
[3]程树林,钱萌.改进Kruskal算法仿真城市通信网络建设[J]计算机应用与软件.2008.10(169-171)
[4] Prim R.C. Shortest connection networks and some generalizations[J]. Bell System Technical Journal,vol.36,no.1,1957,1389-1401
[5] Kruskal J.B.On the shortest spanning subtree of a graph and the traveling salesman problem[J].Proceedings of the American Mathematical Society,vol.7,1956,48-50.
[6]刘志宇,杨柳.一种改进的Dijkstra算法在嵌入式GIS中的应用[J].计算机应用与软件,2009,(12):262-264.
[7]司连法,王文静.快速Dijkstra最短路径优化算法的实现[J].测绘通报,2005,(8):15-18.
[8]章海峰.进口物资中转运输选址-分配问题[D].武汉:华中科技大学,2006.
[9]张健.公路快速货运轴辐式网络运载规划研究与应用[D].济南:山东大学,2008.
[10]何骏.长三角区域流通服务业的发展研究[J].当代经济管理,2011.(08):39-44
[11]上海统计年鉴2010[Z].北京:中国统计出版社.
[12]张祥建.2009年上海城市经济与管理发展报告[M].上海:上海财经大学出版社,2010.
[13]国家统计局人口和就业统计司,劳动和社会保障部规划财务司.历年中国劳动统计年鉴[Z] .北京:中国统计出版社.
[14]赵洪祝.全面推进海洋经济发展示范区建设[J].今日浙江,2011,(07):10-12.
[15] Curry G.L.and R.W.Skeith.A dynamic programming algorithm for facility location and allocation[J].American Institute of Industrial Engineers Transactions, 1969,1:133-138.
[16] Wesolowsky G.O.Truscott W.G.The multiperiod location-allocation problem with relocation of facilities[J].Management Science,1975,22(1):57-65.
[17] Luce Brotcorne,Gilbert Laporte and Frederic Semet.Ambulance location and relocation models:invited review[J].European Journal of Operational Research, 2003,147:451-463.
[18] Geoffrion A.M and Graves G.W.Multicommodity distribution system design by benders decomposition[J].Management Science,1974,20:822-844.
[19] Alan T.Murray,Ross A.Gerrard.Capacitated service and regional constraints in location-allocation modeling[J].Location Science,1997,5(2):103-118.
[20] Moshe Eben-Chaime,Abraham Mehrez,Gad Markovich.Capacitated location allocation problems on a line[J].Computers&Operations Research,2002,29: 459-470.
[21] H.Topcuoglua,F.Coruta,M.Ermisb,G.Yilmaz.Solving the uncapacitated hub location problem using genetic algorithms[J].Computers&Operations Research, 2005,32:967-984.
[22] A.J.Scott.Dynamic location-allocation systems:Some basic planning strategies[J]. Environment and Planning,1971,3:73-82.
[23]董鹏,杨超,陈新.一类带能力约束的运输问题[J].海军工程大学学报,2004,16 (5):96-99.
[24] Laporte G,Nobert Y,Arpin H Q.An exact algorithm for solving a capacitated location-routing problem[J].Annals of Operation Research,1986,239-310.
[25] Sanjay Melkote,Mark S.Daskin.An integrated model of facility location and transportation network design[J].Transportation Research Part A,2001,35:515-538.
[26] C.S.Tapiero.Transportation-location-allocation problems over time[J].Journal of Regional Science,1971,11(3):377-384.
[27] Alfredo M,Blas P.A branch and bound algorithm for the transportation problem with location of p transshipment points[J].Computers Operations Research,1997, 24(7):659-678.
[28] Cem C,Basheer M,Khumawala,Japhett L,Anthony L.An algorithm for the capacitated multi-commodity multi-period facility location problem[J].Computers Operations Research,2001,28:411-427.
[29] Bernard Gendron,Jean-Yves Potvin,Patrick Soriano.A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements[J]. Parallel Computing,2003,29:591-606.
[30]袁庆达,陈旭梅,黎青松.基于“服务型”物流战略的p-Center选址问题研究[J].西南交通大学学报,2001,36(3):250-253
[31]陈子侠.考虑售后服务和配送成本的选址问题系统的建模仿真[J].计算机工程, 2003,29(7):23-23.
[32]谭凌,高峻峻,王迎军.基于库存成本优化的物流中心选址问题研究[J].系统工程学报,2004,19(1):59-65.
[33]张培林,魏巧云.物流物流中心选址模型及其启发式算法[J].交通运输工程学报,2003,3(2):65-68.
[34]陈曦,傅明.GIS环境下的物流物流中心选址模型与算法研究[J].计算技术与自动化2001,20(4):6-9.
[35]李延晖,马士华.基于时间约束的单源/p个中转点配送系统的MINLP模型[J].中国管理科学,2004,12(3):86-90.
[36] Jayaraman V, Guide JR V D R, Srivastava R. A closed-loop logistics model for remanufacturing [J].Journal of the Operational Research Society, 1999,50, 50 :497~508 .
[37] Fleischmann M, Krikke H R, Dekker R, et al. A characterisation of logistics networks for product recovery [J].Omega, 2000,28, 28 :653~666 .
[38] Shih L H. Reverse logistics system planning for recycling electrical appliances and computers in Taiwan[J] .Resources, Conservation and Recycling, 2001,32, 32 :55~72 .
[39] Marin A, Pelegrin B. The return plant location prob-lem: modelling and resolution[J] .European Journal of Operational Research, 1998,104, 104 :375~392 .
[40] Fleischmann M, Bloemhof -Ruwaard J M, Dekker R,et al. Quantitative models for reverse logistics: a review[J] .European Journal of Operation Research, 1997,103, 103 :1~17 .
[41]黄冬梅,张岭,韩彦岭.并行搜救算法在确定灾后搜救路线中的应用[J].计算机应用研究,2011.28(2):472-480.
[42]孙强,沈建华,顾君忠.求图中顶点之间所有最短路径的一种实用算法[J].计算机工程,2002,28(2):134-136.
[43] Bergh van den F,Engelbrecht A P.A cooperative approach to particle swarm optimization[J].IEEE Trans on Evolutionary Computation,2004,8(3):225-239.
[44]来卫国,李鸥,程军.一种新的求解度约束最小生成树的遗传算法[J].计算机仿真,2008,25(8):162-165.
[45]刘志宇,杨柳.一种改进的Dijkstra算法在嵌入式GIS中的应用[J].计算机应用与软件,2009,(12):262-264.
[46]浙江省舟山市城市规划编制中心.舟山本岛及周边岛屿区域城乡一体化发展规划[R].2005.
[47]中国城市规划设计研究院.舟山市城市总体规划(2000~2020)[R].2001.
[48]马祖军,代颖.产品回收逆向物流网络优化设计模型[J].管理工程学报, 2005-12-30
[49]马祖军,代颖,刘飞.制造/再制造集成物流网络设计的随机规划模型[J].中国机械工程2006-05-10.09(902-906)
[50]周亦波,李志华,戴同,钟毅芳.单元制造系统布局模型及其求解[J].华中科技大学学报(自然科学版) 2002-01-30 01(65-67)
[51]庞明宝,魏连雨.区域物流线路网络双层规划研究[J].公路交通科技.2005.10(158-162)
[52]孙毅彪,王程铭.基于有向图规划的最佳物流路径策略分析及应用[J].运筹与管理.2003.02(110-113)
[53]吴云志,乐毅,王超,张友华.蚁群算法在物流路径优化中的应用及仿真[J].合肥工业大学学报(自然科学版)2009.02(211-214)
[54]乐美龙,香村俊武. Compound Method of Solving Logistics Routes Allocation[J].Journal of Shanghai Jiaotong University(Science) 2010.01(119-123)
[55]伍星华,王旭,林云.废旧产品回收再制造物流网络的优化设计模型[J].计算机工程与应用.2010.26(22-24)
[56]王建宇.现代物流若干问题研究[D].吉林大学.2008
[57]龚承柱,诸克军,郭海湘.基于蚁群算法的多目标网络铺设策略研究[J].计算机工程.2011.15期(177-180)
[58]孙凌宇,冷明,谭云兰,郁松年.赋权有向图的最小生成树算法[J]计算机工程.2010.02.( 61-63+66)
[59]许红波.舟山港散货水水中转运输发展战略研究及其技术经济评价[D].上海:上海海事大学.2003
[60] Hassan Salarieh, Hoda Sadeghian, Kaveh Merat. Chaos control in lateral oscillations of spinning disks via nonlinear feedback[J]. Nonlinear Analysis: Real World Applications, 2009, 10: 2864 - 2872.
[61] Krishna pada Das, Samrat Chatterjee, J. Chattopadhyay. Disease in prey population and body size of intermediate predator reduce the prevalence of chaos-conclusion drawn from Hastings–Powell model[J]. Ecological Complexity, 2009, 6(3): 363-374.
[62]程静跃.舟山群岛发展产业生态系统的生态承载力研究[D].杭州:浙江工业大学.2009
[63] Krishna pada Das, Samrat Chatterjee, J. Chattopadhyay. Disease in prey population and body size of intermediate predator reduce the prevalence of chaos-conclusion drawn from Hastings–Powell model[J]. Ecological Complexity, 2009, 6(3): 363-374.
[64]冯凌英.舟山城市空间环境特色研究[D].杭州:浙江大学,2008
[65] Geoffrion A.M,and McBride R.Lagrangean relaxation applied to capacitated facility location problems[J] .American Institute of Industrial Engineers Transactions, 1978,10:40-47.
[66] Cornuejols G.,M.Fisher and G.L.Nemhauser,On the uncapacitated location problem. [J].Annals of Discrete Mathmatics,1977,1:163-177.
[67] Suda Tragantalerngsak,John Holt,Mikael.An exact method for the two-echelon,single-source,capacitated facility location problem[J].European Journal of Operational Research,2000,123:473–489.
[68] Luce Brotcorne,Gilbert Laporte and Frederic Semet.Ambulance location and relocation models:invited review [J]. European Journal of Operational Research,2003,147:451-463.
[69] Kara B.Y and B.C.Tansel.On the single-assignment p-Hub center problem [J] . European Journal of Operation Research,2000,125:648-655.
[70] Jose A.Moreno Perez,J.Marcos Moreno-Vega,Inmaculada Rodriguez Martin. Variable neighborhood tabu search and its application to the median cycle problem[J].European Journal of Operational Research,2003,151:365-378.
[71] Mohan R.Akella,Rajan Batta,Eric M.Delmelle et al.Base station location and channel allocation in a cellular network with emergency coverage requirements [J] . European Journal of Operational Research,2005,164:301-323.
[72] Swarnkar R,Tiwari M.K.Modelling machine loading problem of FMSs and its solution methodology uUsing a hybrid tabu search and simulated annealing-based heuristic approach [J].Robotics and Computer-Integrated Manufacturing,2004,20(3):
[73] Aoyama I,Sato H,Nakajima K.Genetic algorithm and tabu search method for care service scheduling problem and comparison between these two Methods [J].Journal of the Operations Research Society of Japan,2001,44(3):280.
[74] Dorigo M,Gambardella M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computations,1997,1(1):53-66.
[75] Bullnheimer B,Hartl R.F,Strauss C.A new rank based version of the ant system- a computational study[J].Central European Journal for Operations Research and Economics,1998.
[76]苏仰娜.基于Flash的汽车模拟驾驶教学系统[J].河南大学学报(自然科学版)2010.40(3):307-310
[77]沈钧,李庆.Flash CS3 ActionScript3.0游戏开发基础与范例[M].北京:电子工业出版社,2008.
[78]朱治国,缪亮,陈艳丽.Flash ActionScript3.0编程技术教程[M].北京:清华大学出版社,2008.
[79] Joey Lott ,Danny Patterson. Advanced ActionScript 3 With Design Patterns [M].北京:清华大学出版社,2008.
[80]陈善亮,毛保华,丁勇.英国交通一体化政策与我国的对策[J].交通科技,2004(1):(63-66).
[81]张岚,贺玉龙,荣建,等.北京城乡交通一体化发展模式浅析[J].综合运输,2006(4):(49-52).
[82]叶彭姚,陈小鸿.功能组团格局城市道路网规划研究[J].城市交通,2006,4(1):(36-41).
[83]上海同济城市规划设计研究院.舟山市城市公共交通规划(2001年~2020年)[R].2002.
[84]陆化普,文国玮.BRT系统成功的关键:带形城市土地利用形态[J].城市交通,2006,4(3):11-15.
[85]陈伟峰,陈秋晓,郭涤寰.舟山中心城市组团间交通一体化策略研究[J].山西建筑.2008.18期
[86]彭涛,杭文.我国公路快速货运发展的切入点[J].现代交通科技,2006,3(1):64一68.
[87]马天山,何朝平.道路快速货运组织方式[J].长安大学学报(自然科学版),2005。25(3):62一65.
[88]孙晓燕.论我国公路运输业向现代物流业的转型[J].商场现代化,2005,16:119一200.
[89]宋传平.我国公路快速货运的发展研究[J].公路运输文摘,2003,10:23一27.
[90] TG Crainie,Gilbert LaPorte.Invited review : Planning model or freighttrans Portation[J]. EuroPean Journal of OPerationalResearch,1997,97(3):409一438
[91] M.Wasner,G Zap fel.A iniegrated multi-depot hub-loeation vehiele routing model for network Planning of Parcel service[J].international Joumal of Produetion Eeonomies,2004, 90(3):403一419
[92]朱桃杏,吴殿廷,赵莉琴.基于旅游体验视角的京津冀区域铁路交通线路评价与选择——空间句法模型和图论最小生成树Kruskal算法[C].Institute of Electrical and Electronics Engineers, Inc. 2010
[93]高维春,谭旭.基于Kruskal最大树聚类的教师教学质量评价[C].Institute of Electrical and Electronics Engineers, Inc.。2010
[94]程树林,钱萌.改进Kruskal算法仿真城市通信网络建设[J].计算机应用与软件.2008.10(169-171)