复杂快递网络的优化方法及抗毁性能研究
|
摘要
网络优化问题一直都是物流、交通、计算机、通信、数学和运筹学等领域研究的热点,以往研究的焦点大多集中在如何设计有效的算法,以解决优化过程中多目标、多约束条件以及高计算复杂度等问题。本论文所研究的快递网络系统,是一个具有多维、多层和多目标等特征的超网络系统。在这个系统中配送网点和配送线路所构成的物理层网络仅仅是超网络系统的组成部分之一,在其上部还存在着管理层网络。管理层网络由以分公司为管理单元的组织管理维度子网和以转运中心为区域货物集散中心的业务管理维度子网构成,物理层网络中货物的配送过程受管理层网络的调度和制约。因此,研究物理层网络的优化问题时,需要考虑管理层网络的影响。另外,由于快递网络系统内部各层次之间要素的相互关联性,针对物理层网络和管理层网络的破坏行为均可能对快递公司造成重大损失。因此,从不同层次研究其抗毁性能,有助于更好的保护快递网络系统。
本论文分析了快递企业配送系统所具有的超网络结构,探讨了在矩阵式的管理结构和快递行业“限时派送”经营模式的制约下,物理层网络的综合优化问题；论文还从超网络的视角,分别研究了快递网络系统中的物理层网络和管理层网络遭受破坏时,其抗毁性能特征：
(1)构造了一种适合描述快递网络系统特征的超网络模型
为了能兼顾配送成本和效率,快递企业通常采用矩阵式的管理结构,一方面以省级分公司为管理单元,实现对物理层网络的分区管理和成本控制；另一方面,以转运中心作为区域货物的集散中心,对货物进行统一调度和配送。这种矩阵式的管理模式,使得快递企业在管理层形成两个不同维度的子网络,物理网络中货物的配送是在管理层网络中两个不同维度子网络的管理和调度下完成的,本论文构建了适合描述快递网络系统内部复杂结构和关系的超网络模型。
(2)提出了一种新的快递网络优化方法
分析了组织管理维度基于成本的优化方法和业务管理维度基于效率的优化方法,以此为基础,结合快递企业“限时派送”的经营模式,提出了基于时间阈值的优化方法。该优化方法能保证快递企业在承诺的时间内完成快件送达任务的前提下,最大限度的降低配送成本。论文还以某快递企业的网络系统为例,对模型和优化方法进行了验证,结果表明,阈值取值的差异,不仅会影响总配送时间和总配送成本,也会改变快件的最优配送路径。
(3)设计了适合物理层网络结构特点的优化算法
论文针对快递网络系统中物理层网络具有社区结构和子核的特征,设计了具有并行运算特征的基于局域搜索的分段优化方法,并以某快递企业的网络为例,对该优化算法进行了验证,结果表明,该算法能够在保证计算精度的前提下,降低运算的复杂度。
(4)评估了快递网络系统的抗毁性能
首先,设计了评价快递网络抗毁性能的效率指标,该效率指标不仅能反映快递网络静态结构的破坏状况,同时还能反映动态流所受的影响,因此能科学评价快递企业因网络破坏而遭受的损失；其次,采用节点删除法模拟物理层网络遭受的破坏,在考虑相继故障和拥挤度影响的前提下,分析了物理层网络的抗毁性能；最后,定义了管理层网络中分公司的管理效率值指标,模拟了管理层网络遭受破坏后,由于管理效率值下降,从而导致物理层网络中的配送效率下降的过程。研究结果显示,管理效率的少量下降,将会导致物理层网络中总配送成本大幅度的增加,说明了相比于物理层网络的局部破坏,管理层网络的局部破坏对企业影响更大。
Network optimization problem is a popular issue in many research fields, such as logistics, transportation, computer science, communication,mathematic and operation research. Previous studies mainly deal with it focusing on how to design an more effective algorithm to solve optimization problems with properties of multi-objective, multi-constrained and high computation complexity. The express network system is a super-network system with characteristics of multi-dimention, multi-layer and multi-objective, as one part of super-network system, the physical layer network is composed of delivery centers and routes, goods delivery in physical layer network is scheduled and restricted by the management layer network, which consisted of organization management dimension subnetwork and business management dimension subnetwork, the former take the branch company as its management unit and the latter regard the transshipment center as the collecting and distributing center. As a result, the management dimension subnetwork has an effect on the optimal outcome of physical layer network. In addition, for the interdependence of internal factors in express network system, acts of sabotage committed both against physical layer network and against management dimension subnetwork, may bring about heavy loss to the express company, so, to analyze its survivability at a different layer will help to protect express network system better.
It analysizes the super-network structure of express distribution system, discusses the optimization problem of physical layer network which restricted by "time-limited delivery" and matrix management mode which is adopted widely in express industry, it also investigates the vulnerability of express network system when the physical layer network and the management dimension subnetwork is damaged respectively.
(1)It designs a super-network model which suitable for describing the characteristics of express distribution network system
In order to consider cost and efficiency simultaneously, a matrix management mode is adopted by express companies, on one hand, they consider province-level branch company as management unit to supervise the physical-layer network and control its operation cost divisionally, on the other hand, they regard the transshipment center as the collecting and distributing center for goods unified dispatching, as a result, two different dimension subnetworks who schedule goods distribution in physichal layer network jointly, are formed in management layer network. A supernetwork model is designed to describe the complex construction and complicated relation of express network system.
(2) It proposes a new optimization method of express network
On the basis of the cost optimization-based method raised in organization management dimension and the time optimization-based method of physical layer network raised in business management dimension, combines with the "time-limited delivery" in express industry, an optimization method of multicriteria express super-network based on time threshold is proposed, the optimization method can reduces the distribution costs to the utmost on the premise of that the express consignments are delivered in the commitment time, the method is also illustrated by an application case, results show that the delivery routes, delivery time and delivery cost is related to time threshold.
(3) It designs an optimization algorithm according to structure characteristics of physical layer network
It proposes a segmental optimization method with features of parallel operation based on local searching, according to the community structure and sub-cores of physical layer network, the method is also illustrated by an application case, results show that our optimization method can effectively reduce computation complexity while keeping the calculation precision.
(4) It studies the vulnerability of express network system
In the first place, it designs an efficiency index to evaluate the vulnerability of express network system, the index can not only accesses the damage of express network structure reasonably, but also can measures the influence degree of flow on network, as a result, it can evaluates the losses of express company scientifically when the express network damaged. Secondly, node-removal method is used to simulates the damage to physical layer network, its vulnerability is also analysized in consideration of the effect of cascading failures and crowding. It defines the management efficiency index of branch company in the end, the drop course of delivery efficiency in physical layer network results from the reduction of management efficiency is also simulated. Results show that a little decrease of management effeciency may results in a sharp increase of total delivery cost of physical layer network, so, we can conclude that compares with local failure in physical layer network, partial failure in management layer network brings express company a worse influence.
本论文分析了快递企业配送系统所具有的超网络结构,探讨了在矩阵式的管理结构和快递行业“限时派送”经营模式的制约下,物理层网络的综合优化问题；论文还从超网络的视角,分别研究了快递网络系统中的物理层网络和管理层网络遭受破坏时,其抗毁性能特征：
(1)构造了一种适合描述快递网络系统特征的超网络模型
为了能兼顾配送成本和效率,快递企业通常采用矩阵式的管理结构,一方面以省级分公司为管理单元,实现对物理层网络的分区管理和成本控制；另一方面,以转运中心作为区域货物的集散中心,对货物进行统一调度和配送。这种矩阵式的管理模式,使得快递企业在管理层形成两个不同维度的子网络,物理网络中货物的配送是在管理层网络中两个不同维度子网络的管理和调度下完成的,本论文构建了适合描述快递网络系统内部复杂结构和关系的超网络模型。
(2)提出了一种新的快递网络优化方法
分析了组织管理维度基于成本的优化方法和业务管理维度基于效率的优化方法,以此为基础,结合快递企业“限时派送”的经营模式,提出了基于时间阈值的优化方法。该优化方法能保证快递企业在承诺的时间内完成快件送达任务的前提下,最大限度的降低配送成本。论文还以某快递企业的网络系统为例,对模型和优化方法进行了验证,结果表明,阈值取值的差异,不仅会影响总配送时间和总配送成本,也会改变快件的最优配送路径。
(3)设计了适合物理层网络结构特点的优化算法
论文针对快递网络系统中物理层网络具有社区结构和子核的特征,设计了具有并行运算特征的基于局域搜索的分段优化方法,并以某快递企业的网络为例,对该优化算法进行了验证,结果表明,该算法能够在保证计算精度的前提下,降低运算的复杂度。
(4)评估了快递网络系统的抗毁性能
首先,设计了评价快递网络抗毁性能的效率指标,该效率指标不仅能反映快递网络静态结构的破坏状况,同时还能反映动态流所受的影响,因此能科学评价快递企业因网络破坏而遭受的损失；其次,采用节点删除法模拟物理层网络遭受的破坏,在考虑相继故障和拥挤度影响的前提下,分析了物理层网络的抗毁性能；最后,定义了管理层网络中分公司的管理效率值指标,模拟了管理层网络遭受破坏后,由于管理效率值下降,从而导致物理层网络中的配送效率下降的过程。研究结果显示,管理效率的少量下降,将会导致物理层网络中总配送成本大幅度的增加,说明了相比于物理层网络的局部破坏,管理层网络的局部破坏对企业影响更大。
Network optimization problem is a popular issue in many research fields, such as logistics, transportation, computer science, communication,mathematic and operation research. Previous studies mainly deal with it focusing on how to design an more effective algorithm to solve optimization problems with properties of multi-objective, multi-constrained and high computation complexity. The express network system is a super-network system with characteristics of multi-dimention, multi-layer and multi-objective, as one part of super-network system, the physical layer network is composed of delivery centers and routes, goods delivery in physical layer network is scheduled and restricted by the management layer network, which consisted of organization management dimension subnetwork and business management dimension subnetwork, the former take the branch company as its management unit and the latter regard the transshipment center as the collecting and distributing center. As a result, the management dimension subnetwork has an effect on the optimal outcome of physical layer network. In addition, for the interdependence of internal factors in express network system, acts of sabotage committed both against physical layer network and against management dimension subnetwork, may bring about heavy loss to the express company, so, to analyze its survivability at a different layer will help to protect express network system better.
It analysizes the super-network structure of express distribution system, discusses the optimization problem of physical layer network which restricted by "time-limited delivery" and matrix management mode which is adopted widely in express industry, it also investigates the vulnerability of express network system when the physical layer network and the management dimension subnetwork is damaged respectively.
(1)It designs a super-network model which suitable for describing the characteristics of express distribution network system
In order to consider cost and efficiency simultaneously, a matrix management mode is adopted by express companies, on one hand, they consider province-level branch company as management unit to supervise the physical-layer network and control its operation cost divisionally, on the other hand, they regard the transshipment center as the collecting and distributing center for goods unified dispatching, as a result, two different dimension subnetworks who schedule goods distribution in physichal layer network jointly, are formed in management layer network. A supernetwork model is designed to describe the complex construction and complicated relation of express network system.
(2) It proposes a new optimization method of express network
On the basis of the cost optimization-based method raised in organization management dimension and the time optimization-based method of physical layer network raised in business management dimension, combines with the "time-limited delivery" in express industry, an optimization method of multicriteria express super-network based on time threshold is proposed, the optimization method can reduces the distribution costs to the utmost on the premise of that the express consignments are delivered in the commitment time, the method is also illustrated by an application case, results show that the delivery routes, delivery time and delivery cost is related to time threshold.
(3) It designs an optimization algorithm according to structure characteristics of physical layer network
It proposes a segmental optimization method with features of parallel operation based on local searching, according to the community structure and sub-cores of physical layer network, the method is also illustrated by an application case, results show that our optimization method can effectively reduce computation complexity while keeping the calculation precision.
(4) It studies the vulnerability of express network system
In the first place, it designs an efficiency index to evaluate the vulnerability of express network system, the index can not only accesses the damage of express network structure reasonably, but also can measures the influence degree of flow on network, as a result, it can evaluates the losses of express company scientifically when the express network damaged. Secondly, node-removal method is used to simulates the damage to physical layer network, its vulnerability is also analysized in consideration of the effect of cascading failures and crowding. It defines the management efficiency index of branch company in the end, the drop course of delivery efficiency in physical layer network results from the reduction of management efficiency is also simulated. Results show that a little decrease of management effeciency may results in a sharp increase of total delivery cost of physical layer network, so, we can conclude that compares with local failure in physical layer network, partial failure in management layer network brings express company a worse influence.
引文
[1]郭淑芳.中国快递产业的竞争力研究[D].上海：上海师范大学商学院,2009.
[2]牛津经济研究所.快递业对全球经济的作用[J].中国物流与采购,2010,(1)：20-23.
[3]李波.快递企业服务网络布局优化研究[D].北京：北京交通大学交通运输学院,2010.
[4]李静宇,吴玉妍,王乃超.沉重的两翼如何腾飞[J].中国储运,2010,(10)：28-32.
[5]汤世强,吴忠,陈心德.电子商务物流配送瓶颈及解决方案[J].商业研究,2010,(2)：202-204.
[6]沈群力.民营快递企业的市场状况研究[J].价格理论与实践,2007,(10)：73-74.
[7]李静宇.快递成本与服务的博弈[J].中国储运,2010,(10)：42-44.
[8]李波.快递企业服务网络布局优化研究[D].北京：北京交通大学交通运输学院,2010.
[9]Hendricks K, Piccione M, Tan G F. Entry and exit in hub-spoke networks [J]. Rand Journal of Economics,1997,28 (2):291-303.
[10]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[11]Kim D, et al. Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33 (4):391-407.
[12]A rmacost A P, Barnhart C, Ware K A. Composite variable fo rmulations for express shipment service network design[J]. Transportation Science,2002,36 (1):1-20.
[13]Buedenbender K, Grunert T, Sebastian H J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[14]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[15]柏明国,朱金福.全连通航线网络和枢纽航线网络的比较研究[J].系统工程理论与实践,2006,(9)：113-117.
[16]Smilowitz K, A tamturk A, Daganzo C F. Deferred item and vehicle routing with in integrated networks[J]. Transportation Research E,2003,39(4):305-323.
[17]Wasner M, Czunther Z. apfel. An integrated Multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics,2004, (90):403-419.
[18]Chestler L. Overnight air express:Spatial pattern, competition and the future in small package delivery services [J].Transportation Quarterly,1985,39(1):59-71.
[19]Armacost A P, Barnhart C, Ware K A, et al. UPS optimizes its air network[J]. Interfaces, 2004,34(1):15-25.
[20]Berechman J, Poddar S, Shy O. Network structure and entry in the deregulated airline industry [J].KEIO Economic Studies,1998,35:71-82.
[21]Brueckner J K, Zhang Y. A model of scheduling in airline networks:How a hub-and-spoke system affects flight frequency, fares and welfare[J]. Journal of Transport Economics and Policy, 2001,35:195-222.
[22]Hendricks K, Piccione M, Tan G F. Entry and exit in hub-spoke networks [J]. Rand Journal of Economics,1997,28 (2):291-303.
[23]Pels E, N ijkamp P, R ietveld P. A note on the optimality of airline networks[J]. Economics Letters,2000,69:429-434.
[24]柏明国,朱金福.全连通航线网络和枢纽航线网络的比较研究[J].系统工程理论与实践,2006,(9)：113-117.
[25]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[26]Barnhart C, Schneur R R. Air network design for express freight service[J]. Operations Research,1996,44 (6):852-863.
[27]Armacost A P, Barnhart C, Ware K A. Composite variable for mulations for express shipment service network design[J]. Transportation Science,2002,36 (1):1-20.
[28]Barnhart C, Schneur R. Air network design for express shipment service[J].Operations Research, 1996,44(6):852-863.
[29]Kuby M J, Gray R G. The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research A,1993,27(1):1-12.
[30]Wasner M, Czunther Z. apfel. An integrated Multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics,2004, (90):403-419.
[31]刘沛.枢纽辐射式快速货运网络规划研究[D].济南：山东大学,2007.
[32]张健,吴耀华,刘沛,王艳艳.公路快速货运复合枢纽辐射式网络规划分析[J].山东大学学报(工学版),2008,38(5)：6-9,13.
[33]戴韬,霍佳震.非枢纽辐射式快递网络的航线规划研究[J].计算机工程与应用,2010,46(5)：193-196,223.
[34]Dijkstra E. A note on two problems with graphs[J]. Numer Math,1959 (1):269-271.
[35]Floyd RW. Algorithm 97 Shortest path[J]. Communications of the ACM,1962,5(6):345.
[36]任鸣鸣,杨超.废弃品联合回收物流网络优化设计[J].统计与决策,2007,(7)：34-36.
[37]Fisher M L. Optimal solution of vehicle routing problems using minimum k-trees[J]. Operations Research,1994,42 (4):141-153.
[38]Padberg M, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems[J]. SIAM Review,1991,33 (1):60-100.
[39]Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation[J]. Operations Research,1997,45 (3):395-406.
[40]Tan K C, Chew Y H, Lee L H. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems[J]. European Journal of Operational Research,2006,172(3): 855-885.
[41]赵建有,闫旺,胡大伟.配送网络规划蚁群算法[J].交通运输工程学报,2004,4(3)：79-81.
[42]李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究[J].管理工程学报,2006,20(4)：9-12.
[43]Wen H Y. Genetic algorithm-based computation of shortest path in discrete-time networks[J]. Journal of South China University of Technology,2008,36(2):13-16.
[44]阎啸天,武穆清.基于GA的网络最短路径多目标优化算法研究[J].控制与决策,2009,24(7)：104-1109.
[45]张丽霞,赵又群,潘福全Hopfield神经网络算法求解路网最优路径[J].哈尔滨工业大学学报,2009,41(9)：222-224.
[46]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报,2005,20(6)：596-600.
[47]Zhang H. Immune optimization algorithm for constrained nonlinear multiobjective optimization problems[J]. Applied Soft Computing Journal,2007,7(3):840-857.
[48]Liu C, Wang D W. Predatory search algorithm with restriction of solution distance[J]. Biological Cybernetics,2005,92:293-302.
[49]王有为.基于禁忌表的捕食搜索算法及其在旅行商问题中的实验研究[J].系统工程理论与实践.2008,2：131-136.
[50]蒋忠中,汪定伟.物流配送车辆路径优化的模糊规划模型与算法[J].系统仿真学报,2006,18(11)：3301-3312.
[51]汪传旭,蒋良奎.基于双层规划的区域港口内陆运输网络优化决策[J].管理工程学报,2008,22(4)：67-71,84.
[52]何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3)：61-67.
[53]何波,杨超,杨珺.废弃物逆向物流网络设计的模糊多目标优化模型[J].工业工程与管理.2007,5：43-46.
[54]Buedenbender K, Grunert T, Sebastian H J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[55]Kim D, et al. Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33 (4):391-407.
[56]Smilowitz K, A tamturk A, Daganzo C F. Deferred item and vehicle routing with in integrated networks[J]. Transportation Research E,2003,39(4):305-323.
[57]汪传旭.基于轴-辐运输系统的区域港口群二级物流运输网络优化[J].系统工程理论与实践,2009,(9)：152-158.
[58]Kuby M J, Gray R G. The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research A,1993,27(1):1-12.
[59]余明珠,李建斌,雷东.装卸一体化的车辆路径问题及基于插入法的新禁忌算法[J].中国管理科学,2010,18(2)：89-95.
[60]胡明伟,唐浩.动态车辆路径问题的多目标优化模型与算法[J].深圳大学学报(理工版),2010,27(2)：230-235.
[61]Sheffi Y. Urban Transportation Networks:Equilibrium Analysis with Mathematical Programming Methods[M]. NJ:Printice-Hall,1985.
[62]Nagurney A,Dong J. Supernetworks:Decision-Making for the Information Age [M]. Cheltenham:Edward Elgar Publishing,2002.
[63]王众托,王志平.超网络初探[J].管理学报,2008,5(1)：2-8.
[64]Nagurney A, Zhao L. Variational inequalities and networks in the formation and computation of market equilibria and disequilibria:The case of direct demand functions [J]. Transportation Science,1993,27(1):4-15.
[65]Nagurney A,Dong J, Zhang D. A Supply Chain Network Equilibrium Model[J]. Transportation Research E,2002,38 (5):281-303.
[66]张铁柱,刘志勇,滕春贤,等.多商品流供应链网络均衡模型的研究[J].系统工程理论与实践,2005,25(7)：61-66.
[67]张宁.产品随机选择与运输的跨区域市场均衡[J].系统工程理论与实践,1997,17(12)：74-78.
[68]张宁,卢兴普.多规格产品随机选择的均衡[J].系统工程理论与实践,1997,17(10)：14-17,90.
[69]徐兵,朱道立.产品随机选择下多商品流供应链网络均衡模型研究[J].系统工程理论与实践,2007,3：82-90,104.
[70]王志平,周生宝,郭俊芳等.基于变分不等式的网络广告资源分配的超网络模型[J].大连海事大学学报,2007,33(4)：26-30.
[71]席运江,党延忠.基于加权超网络模型的组织知识存量表示方法[J].情报学报,2007,26(2)：210-215.
[72]Nagurney A,Dong J. Management of Knowledge Intensive Systems as Supernetworks:Modeling, Analysis, Computations, and Applications [J]. Mathematical and Computer Modelling,2005,42: 397-417.
[73]Quandt R E. A Probabilistic Abstract Mode Model. Studies in Travel Demand Ⅷ, Mathematical Inc, Princeron, New Jersey,1967.127-149.
[74]Nagurney A, Dong J, Mokhtarian P L. Teleshopping versus shopping:a multicriteria network equilibrium framework[J]. Mathematical and Computer Modeling,2001,54(34):783-798.
[75]Tzeng G. H, Chen C H. Multiobjective decision making in traffic assignment. IEEE Transactions on Engineering Management,1993,40:180-187.
[76]王志平,王众托.超网络理论及其应用[M].北京：科学出版社,2008,239-254.
[77]Erdos P, Renyi A. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960,5:17-61.
[78]Watts D J, Strogatz S H. Collective dynamics of small-world networks[J]. Nature,1998,393: 440-442.
[79]Barabas A L, Albert R. Emergence of scaling in random net-works[J]. Science,1999,286:509-512.
[80]Cohen R, Erez K, Ben-Avraham D et al. Resilience of the Internet to Random Breakdowns [J]. Physical Review Letters,2000,85:4626-4629.
[81]Cohen R, Erez K, Ben-Avraham D et al. Breakdown of the Internet under Intentional Attack[J]. Physical Review Letters,2001,86(16):3682-3685.
[82]Wang B, Tang H W, Guo C H, et al. Entropy Optimization of Scale-free Networks Robustness to Random Failures[J]. Physica A,2005,363:591-596.
[83]Sole R V, Alverde S V. Information theory of complex networks:on evolution and architectural constraints[J]. Lect. Notes. Phys.,2004,650:189-207.
[84]Wang X F,Chen G.Synchronization in scale-free dynamical networks:robustness and fragility[J]. IEEE Trans.Circuits and Systems-Ⅰ,2002,49(1):54-62.
[85]Wang X F, Chen G. Synchronization in small-world dynamical networks[J]. Int.J.Bifurcation and Chaos,2002,12(1):187-192.
[86]Jeong H, Tombor B, Albert R. The large scale organization of metabolic networks[J]. Nature, 2000,407:651-654.
[87]Faloutsos M, Faloutsos P, Faloutsos C. On power law relationships of the internet topology[J]. Computer Communication Review,1999,29(4):251-262.
[88]Serrano M A, Boguna M. Topology of the world trade web[J]. Physical Review E,2003,68: 015101-015104.
[89]Newman M E J. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA, 2001,98:404-409.
[90]Albert R, Albert I, Nakarado G L. Structural vulnerability of the North American power grid. Physical Review E,2004,69:025103(R).
[91]Roopnarine P D. Extinction cascades and catastrophe in ancient food webs[J]. Paleobiology,2006, 32(1):1-19.
[92]Guimer A R, Mossa S. The World-Wide Air Transportation Network:Anomalous Centrality, Community Structure, and Cities' Global Roles [J].Proc. Natl. Acad. Sci.,2005,102(22): 7794-7799.
[93]Sen P, Dasgupta P, Chatterjee A, etal. Small-World Properties of the Indian Railway Network[J]. Phys. Rev. E,2003,67:036106.
[94]田炜,邓贵仕,武佩剑,车文娇.世界航运网络复杂性分析[J].大连理工大学学报,2007,47(4)：605-609.
[95]赵伟,何红生,林中材,杨孔庆.中国铁路客运网网络性质的研究[J].物理学报,2006,55(8)：3906-3911.
[96]刘宏鲲,周涛.中国城市航空网络的实证研究与分析[J].物理学报,2007,56(1)：106-111.
[97]黄建华.快递网络的复杂性及鲁棒性分析—以某快递企业为例[J].西南交通大学学报(社会科学版),2009,10(6)：98-102.
[98]Kosterev D N,Taylor C W,Mittelstadt W A. Model validation for the August 10,1996 WSCC system outage[J].IEEE Trans on Power Systems,1999,14(3):967-979.
[99]甘德强,胡江溢,韩祯祥.2003年国际若干停电事故思考[J].电力系统自动化,2004,28(3)：1-5.
[100]Dunne J A,Williams R J,Martinez N D. Network structure and biodiversity loss in food webs: robustness increases with connectance[J]. Ecol. Lett.,2002,5:558-567.
[101]高亮,李梦辉,吴金闪,狄增如.食物网络在顶点攻击与边攻击下的鲁棒性[J].系统工程理论与实践,2005,(7)：1-8.
[102]Jeong H, Mason S, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature, 2001,411:41-42.
[103]Cardenas J P, Mouronte M L, Moyano L G, Vargas M L, Benito R M. On the robustness of Spanish telecommunication networks[J]. Physica A,2010,6:1-8.
[104]Darren M.Scott, David C.Novak, Lisa Aultman-Hall, Feng Guo. Network Robustness Index:A new method for identifying critical links and evaluating the performance of transportation networks[J]. Journal of transport geography,2006,14:215-227.
[105]Wu J J, Sun H J, Gao Z Y. Cascading failures on weighted urban traffic equilibrium networks [J]. Physica A,2007,386:407-413.
[106]李勇,谭跃进,吴俊.基于任务时间约束的物流保障网络级联失效抗毁性建模与分析[J].系统工程,2009,27(5)：7-12.
[107]Bavelas, Alex. A Mathematical Model for Group Structure[J]. Applied Anthropology,1948,7: 16-39.
[108]Callaway D S, Newman M E J, Strogatez S H, Watts D J. Network Robustness and Fragility: Percolation on Random Graphs [J]. Phys. Rev. Lett.,2000,85(25):5468-5471.
[109]Albert R, Jeong H, Barabasi A L. Error and Attack Tolerance of Complex Networks [J]. Nature, 2000,406:378-382.
[110]Gallos L K, Cohen R, Argyrakis P. Stability and Topology of Scale-free Networks under Attack and Defense Strategies[J]. Phys Rev Lett.,2005,94:188701.
[111]Freeman, Linton C. A Set of Measures of Centrality Based on Betweenness[J]. Sociometry, 1977,40:35-41.
[112]Freeman, Linton C. Centrality in social networks:Ⅰ.Conceptual clarification[J]. Social Networks, 1979,1(3):215-239.
[113]Barthelemy M. Betweenness centrality in large complex networks[J]. Euro. Phys. J. B,2004,38 (2):163-168.
[114]陈晓刚,孙可,曹一家.基于复杂网络理论的大电网结构脆弱性分析[J].电工技术学报,2007,22(10)：138-144.
[115]Freeman L C. Centrality in social networks:ii.Experimental results[J]. Social Networks,1979,2 (2):119-141.
[116]陈静,孙林夫.复杂网络中节点重要度评估[J].西南交通大学学报,2009,44(3)：426-429.
[117]Irina Petreska, Igor Tomovski, Eugenio Gutierrez, et al. Application of modal analysis in assessing attack vulnerability of complex networks [J]. Commun Nonlinear Sci Numer Simulat, 2010,15:1008-1018.
[118]Brandes U, A fast algorithm for betweenness centrality [J]. Journal of Mathematical Sociology, 2001,25 (2):163-177.
[119]Estrada E, Rodriguez-velazquez J A. Subgraph centrality in complex networks[J]. Physical Review E,2005,71(5):1-9.
[120]Newman M E J. A measure of betweenness centrality based on random walk[J]. Social Networks,2005,27(1):39-54.
[121]谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,11(11)：79-83.
[122]Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J].Oper Res Lett, 1982,1:157-160.
[123]Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path[J]. Theoretical Computer Science,2001,296(1):167-177.
[124]陈勇,胡爱群,胡俊等.通信网络中最重要节点确定方法[J].高技术通讯,2004,1：573-575.
[125]吴俊,谭跃进,邓宏钟,迟妍.考虑级联失效的复杂负载网络节点重要度评估[J].小型微型计算机系统,28(4)：627-630.
[126]王建伟,荣莉莉,郭天柱.一种参数可调的网络节点重要性度量方法[J].科研管理,2009,30(4)：74-79.
[127]杜巍,蔡萌,杜海峰.网络结构鲁棒性指标及应用研究[J].西安交通大学学报,2010,44(4)：93-97.
[128]王林,张婧婧.复杂网络的中心化[J].复杂系统与复杂性科学,2006,3(1)：13-20.
[129]荣莉莉,郭天柱,王建伟.复杂网络节点中心性[J].上海理工大学学报,2008,30(3)：227-230,236.
[130]Holme P,Kim B J,Yoon C N,etal. Attack vulnerability of complex networks[J]. Phys.Rev.E, 2002,65(5):056109.
[131]吴俊,谭跃进.复杂网络抗毁性测度研究[J].系统工程学报,2005(2)：128-131.
[132]Xiao Zhongzhe,Dong Zaiwang.Improved GIB synchronization method for OFDM system[J]. IEEE Telecommunications,2003,2 (8):1417-1421.
[133]Lu Hui, Dong Zai-wang.Carrier frequency offset estimation for DAB receiver based onphase reference symbol [J].IEEE Transactions on Consumer Electronics,2000,46(1):127-130.
[134]陈建国,张永静.通信网络拓扑抗毁性评估算法研究[J].无线电通信技术,2006(1)：6-7.
[135]张中伟,陈建国.抗毁通信网络设计[J].无线电通信技术,2000,26(2)：33-38.
[136]刘啸林,王能.通信网络抗毁性量度研究[J].上海师范大学学报(自然科学版),2006,35(5)：38-41.
[137]丁琳,谭敏生,肖炜.复杂网络抗毁性研究综述[J].电脑知识与技术,2009,5(1)：51-53,61.
[138]Cardenas J P, Mouronte M L, Moyano L G, Vargas M L, Benito R M. On the robustness of Spanish telecommunication networks[J]. Physica A,2010,6:1-8.
[139]Liu J G, Wang Z T, Dang Y Z, Optimization of robustness of scale-free network to random and targeted attacks [J], Mod. Phys. Lett. B,2005,19:785-792.
[140]Liu J G, Wang Z T, Dang Y Z, Optimization of scale-free network for random failures[J], Mod. Phys. Lett. B,2006,20:815-820.
[141]Paul G, Tanizawa T, Havlin S, Stanley H E. Optimization of Robustness of Complex Networks[J]. The European Physical Journal B,2004,38:187-191.
[142]Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, Irina Rish. Improving Network Robustness by Edge Modification. Physica A,2005,357:593-612.
[143]Shan He, Sheng Li, Hongru Ma. Effect of Edge Removal on Topological and Functional Robustness of Complex Networks. Physica A,2009,388:2243-2253.
[144]陶少华,刘玉华,许凯华,谈德茂.无尺度网络中集散节点的抗脆弱性策略[J].计算机工程与应用,2007,43(2)：151-153,167.
[145]Ye Wu, Ping Li, Maoyin Chen, Jinghua Xiao, Jurgen Kurths. Response of Scale-free Networks with Community Structure to External Stimuli. Physica A,2009,388:2987-2994.
[146]Kwon Y K, Cho K H. Analysis of feedback loops and robustness in network evolution based on Boolean models[J]. BMC Bioinformatics,2007,8(9):430-438.
[147]Dou B L, Wang X G, Zhang S Y. Robustness of networks against cascading failures[J]. Physica A,2010,389:2310-2317.
[148]Wang B,Tang H W, Guo C H, Xiu Z L, Zhou T, Optimization of network structure to random failures[J], Physica A:Statistical Mechanics and its Applications,2006,368 (2):607-614.
[149]Yukio Hayashi, Jun Matsukubo. Improvement of the robustness on geographical networks by adding shortcuts[J]. Physica A,2007,380:552-562.
[150]Ash J, Newth D. Optimizing complex networks for resilience against cascading failure[J]. Physica A:Statistical Mechanics and its Applications,2007,380(7):673-683.
[151]陈晔,赵金超,齐欢.分层复杂网络的鲁棒性研究[J].兵工学报,2009,30(6)：839-843.
[152]黄金源,张宁,肖仰华.基于拷贝模型的复杂网络鲁棒性研究[J].计算机应用研究,2010,27(4)：1403-1406.
[153]李勇,邓宏钟,吴俊,吕欣,刘斌,谭跃进,基于级联失效的复杂保障网络抗毁性仿真分析[J],计算机应用研究,2008,(11)：3451-3454.
[154]Shargel B, Sayama H, Epstein I R, et al. Optimization of robustness and connectivity in complex networks[J]. Phys. Rev. Lett.,2003,90 (6):068701.
[155]Valente A X C N, Sarkar A, Stone H A. Two-peak and three-peak optimal complex networks[J]. Phys. Rev. Lett.,2004,92(11):118702.
[156]Tanizawa T, Paul G, Cohen R, et al. Optimization of network robustness to waves of targeted and random attacks[J]. Phys. Rev. E,2005,71(4):047101.
[157]Wang B, Tang H W, Guo C H, et al. Entropy Optimization of Scale-free Networks Robustness to Random Failures[J]. Physica A,2005,363:591-596.
[158]Sole R V, Alverde S V. Information theory of complex networks:on evolution and architectural constraints[J]. Lect. Notes. Phys.,2004,650:189-207.
[159]Dorogovtsev S N,Mendes J F F. Comment on "Breakdown of the Internet under intentional attack"[J]. Phys. Rev. Lett.,2001,87(21):219801.
[160]Warren C P, Sander L M, Sokolov I. Geography in a scale-free network model[J]. Phys. Rev. E, 2002,66(5):056105.
[161]Rozenfeld A F, Cohen R, Ben Avraham D, et al. Scale-free networks on lattices[J]. Phys. Rev. Lett.,2002,89:218701.
[162]吴俊,谭跃进,邓宏钟,李勇,刘斌.基于不等概率抽样的不完全信息条件下复杂网络抗毁性模型[J].系统工程理论与实践,2010,30(7)：1207-1217.
[163]李勇,邓宏钟,吴俊,吕欣,刘斌,谭跃进.基于级联失效的复杂保障网络抗毁性仿真分析[J].计算机应用研究,2008,25(11)：3451-3454.
[164]Rezaei B A, Sarshar N, Roychowdhury V P,etal. Disaster management in power-law networks: Recovery from and protection against intentional attacks[J]. Physica A,2007,381:497-514.
[165]Moreno Y, Gomez J B, Pacheco A F. Instability of scale-free networks under node-breaking avalanches[J]. Europhys Lett,2002,58(4):630-636.
[166]谭跃进,吴俊,邓宏钟,朱大智.复杂网络抗毁性研究综述[J],系统工程,2006,(10)：1-5.
[167]Watts D J. A simple model of global cascades on random networks[J]. Proc Natl Acad Sci,2002, 99(9):5766-5771.
[168]Holme P. Edge overload breakdown in evolving networks [J]. Phys Rev E,2002,66(3):036119.
[169]Motter A E, Nishikawa T, Lai Y C. Cascade-based attacks on complex networks[J]. Phys Rev E, 2002,66(6):065102(R).
[170]Moreno Y, Pastor-Satorras R, Vazquez A, et al. Critical load and congestion instabilities in scale-free networks[J]. Europhys Lett,2003,62(2):292-298.
[171]Crucitti P, Latora V, Marchiori M. Model for cascading failures in complex networks[J]. Phys. Rev. E,2004,69 (4):045104(R).
[172]Zhao Liang, Kwangho P, Lai Y C. Attack vulnerability of scale-free networks due to cascading breakdown[J]. Phys Rev E,2004,70(3):035101.
[173]Wang Xiao-fan, Xu J. Cascading failures in coupled map lattices[J]. Phys Rev E,2004,70 (5): 056113.
[174]Wu Jian-jun, Gao Zi-you. Cascade and breakdown in scale-free networks with community structure[J]. Phys Rev E,2006,74(6):066111.
[175]王建伟,荣莉莉.基于负荷局域择优重新分配原则的复杂网络上的相继故障[J].物理学报,2009,58(6)：3714-3721.
[176]Wang W X, Chen G R. Universal robustness characteristic of weighted networks against cascading failure[J]. Physical Review. E,2008,77:026101.
[177]王建伟,荣莉莉.超负荷边带有崩溃概率的相继故障模型上袭击策略研究[J].中国管理科学,2009,17(6)：147-156.
[178]Wu J J, Gao Z Y, Sun H J. Effects of the cascading failures on scale-free traffic networks[J]. Physica A,2007,378:505-511.
[179]Girvan M, Newman M E J. Community structure in social and biological networks[J]. Proc Natl Acad Sci USA,2002,99:7821-7826.
[180]Ravasz E, Somera A L, Mongru D A, et al. archical organization of modularity in metabolic networks. Science,2002,297:1551-1555.
[181]Spirin V, Mirny L A. Protein complexes and functional modules in molecular networks. Proc Natl Acad Sci USA,2003,100:12123-12128.
[182]Onnela J P, Chakraborti A, Kaski K, et al. Dynamics of market correlations:Taxonomy and portfolio analysis[J]. Phys Rev,2003, E68:056110.
[183]Newman M E J. Fast algorithm for detecting community structure in networks[J]. Phys Rev. 2004, E69,066133.
[184]Watts D J, Dodds P S, Newman M E J. Identity and search in social networks [J]. Science, 2002,296:1302-1305.
[185]Fiedler M. Algebraic connectivity of graphs[J]. Czech Math J,1973,23:298-305.
[186]Pothen A, Simon H, Liou K P. Partitioning sparse matrices with eigenvectors of graphs[J]. SIAM J Matrix Anal Appl,1990,11:430-452.
[187]Mohar B.The Laplacian spectrum of graphs[J].Graph Theory Combinatorics and Applications, 1991,2:87-898.
[188]Kernighan W, Lin S. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal,1970,49:291-307.
[189]Santo Fortunato. Community detection in graphs [J]. Physics Reports,2010,486(3):75-174.
[190]Breiger R L, Boorman S A, Arabie P. An algorithm for clustering relations data with applications to social network analysis and comparison with multidimensional scaling. Journal of Mathematical Psychology,1975,12:328-383.
[191]Amaral L A N, Scala A, Barthelemy M, et al. Classes of small-world networks. Proc Natl Acad Sci USA,2000,97:11149-11152.
[192]Duanbing C,Yan F, Mingsheng S. A fast and efficient heuristic algorithm for detecting community structures in complex networks [J]. Physica A:Statistical Mechanics and its Applications,2009,388(13):2741-2749.
[193]Charles F, David W, Eli V. The use of sparsest cuts to reveal the hierarchical community structure of social networks[J]. Social Networks,2008,30(3):223-234.
[194]Yang Gang,Zhou Tao,Wang Jie,et al. Epidemic spread in weighted scale-free networks[J]. Chinese Physics Letters,2005,22(2):501-513.
[195]朱涛,张水平,郭戎潇,常国岑.改进的加权复杂网络节点重要度评估的收缩方法[J].系统工程与电子技术,2009,31(8)：1902-1905.
[196]陈华良,刘忠信,陈增强,袁著祉.复杂网络的一种加权路由策略研究[J].物理学报,2009,58(9)：6068-6073.
[197]Latora V, Marchiori M. Efficient Behavior of Small-World Networks[J]. Physical Review Letters,2001,87(19):198701.
[198]Paolo Crucitti, Vito Latora, Massimo Marchiori, Andrea Rapisarda. Error and Attack Tolerance of Complex Networks[J]. Physica A,2004,340:388-394.
[199]Xiao Z Z, Dong Z W. Improved GIB synchronization method for OFDM system[J]. IEEE Telecommunications,2003,2(8):1417-1421.
[2]牛津经济研究所.快递业对全球经济的作用[J].中国物流与采购,2010,(1)：20-23.
[3]李波.快递企业服务网络布局优化研究[D].北京：北京交通大学交通运输学院,2010.
[4]李静宇,吴玉妍,王乃超.沉重的两翼如何腾飞[J].中国储运,2010,(10)：28-32.
[5]汤世强,吴忠,陈心德.电子商务物流配送瓶颈及解决方案[J].商业研究,2010,(2)：202-204.
[6]沈群力.民营快递企业的市场状况研究[J].价格理论与实践,2007,(10)：73-74.
[7]李静宇.快递成本与服务的博弈[J].中国储运,2010,(10)：42-44.
[8]李波.快递企业服务网络布局优化研究[D].北京：北京交通大学交通运输学院,2010.
[9]Hendricks K, Piccione M, Tan G F. Entry and exit in hub-spoke networks [J]. Rand Journal of Economics,1997,28 (2):291-303.
[10]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[11]Kim D, et al. Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33 (4):391-407.
[12]A rmacost A P, Barnhart C, Ware K A. Composite variable fo rmulations for express shipment service network design[J]. Transportation Science,2002,36 (1):1-20.
[13]Buedenbender K, Grunert T, Sebastian H J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[14]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[15]柏明国,朱金福.全连通航线网络和枢纽航线网络的比较研究[J].系统工程理论与实践,2006,(9)：113-117.
[16]Smilowitz K, A tamturk A, Daganzo C F. Deferred item and vehicle routing with in integrated networks[J]. Transportation Research E,2003,39(4):305-323.
[17]Wasner M, Czunther Z. apfel. An integrated Multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics,2004, (90):403-419.
[18]Chestler L. Overnight air express:Spatial pattern, competition and the future in small package delivery services [J].Transportation Quarterly,1985,39(1):59-71.
[19]Armacost A P, Barnhart C, Ware K A, et al. UPS optimizes its air network[J]. Interfaces, 2004,34(1):15-25.
[20]Berechman J, Poddar S, Shy O. Network structure and entry in the deregulated airline industry [J].KEIO Economic Studies,1998,35:71-82.
[21]Brueckner J K, Zhang Y. A model of scheduling in airline networks:How a hub-and-spoke system affects flight frequency, fares and welfare[J]. Journal of Transport Economics and Policy, 2001,35:195-222.
[22]Hendricks K, Piccione M, Tan G F. Entry and exit in hub-spoke networks [J]. Rand Journal of Economics,1997,28 (2):291-303.
[23]Pels E, N ijkamp P, R ietveld P. A note on the optimality of airline networks[J]. Economics Letters,2000,69:429-434.
[24]柏明国,朱金福.全连通航线网络和枢纽航线网络的比较研究[J].系统工程理论与实践,2006,(9)：113-117.
[25]倪玲霖,史峰,方晓平,涂茜.全连通快递网络与轴辐快递网络的比较[J].系统工程,2009,27(12)：45-50.
[26]Barnhart C, Schneur R R. Air network design for express freight service[J]. Operations Research,1996,44 (6):852-863.
[27]Armacost A P, Barnhart C, Ware K A. Composite variable for mulations for express shipment service network design[J]. Transportation Science,2002,36 (1):1-20.
[28]Barnhart C, Schneur R. Air network design for express shipment service[J].Operations Research, 1996,44(6):852-863.
[29]Kuby M J, Gray R G. The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research A,1993,27(1):1-12.
[30]Wasner M, Czunther Z. apfel. An integrated Multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics,2004, (90):403-419.
[31]刘沛.枢纽辐射式快速货运网络规划研究[D].济南：山东大学,2007.
[32]张健,吴耀华,刘沛,王艳艳.公路快速货运复合枢纽辐射式网络规划分析[J].山东大学学报(工学版),2008,38(5)：6-9,13.
[33]戴韬,霍佳震.非枢纽辐射式快递网络的航线规划研究[J].计算机工程与应用,2010,46(5)：193-196,223.
[34]Dijkstra E. A note on two problems with graphs[J]. Numer Math,1959 (1):269-271.
[35]Floyd RW. Algorithm 97 Shortest path[J]. Communications of the ACM,1962,5(6):345.
[36]任鸣鸣,杨超.废弃品联合回收物流网络优化设计[J].统计与决策,2007,(7)：34-36.
[37]Fisher M L. Optimal solution of vehicle routing problems using minimum k-trees[J]. Operations Research,1994,42 (4):141-153.
[38]Padberg M, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems[J]. SIAM Review,1991,33 (1):60-100.
[39]Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation[J]. Operations Research,1997,45 (3):395-406.
[40]Tan K C, Chew Y H, Lee L H. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems[J]. European Journal of Operational Research,2006,172(3): 855-885.
[41]赵建有,闫旺,胡大伟.配送网络规划蚁群算法[J].交通运输工程学报,2004,4(3)：79-81.
[42]李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究[J].管理工程学报,2006,20(4)：9-12.
[43]Wen H Y. Genetic algorithm-based computation of shortest path in discrete-time networks[J]. Journal of South China University of Technology,2008,36(2):13-16.
[44]阎啸天,武穆清.基于GA的网络最短路径多目标优化算法研究[J].控制与决策,2009,24(7)：104-1109.
[45]张丽霞,赵又群,潘福全Hopfield神经网络算法求解路网最优路径[J].哈尔滨工业大学学报,2009,41(9)：222-224.
[46]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报,2005,20(6)：596-600.
[47]Zhang H. Immune optimization algorithm for constrained nonlinear multiobjective optimization problems[J]. Applied Soft Computing Journal,2007,7(3):840-857.
[48]Liu C, Wang D W. Predatory search algorithm with restriction of solution distance[J]. Biological Cybernetics,2005,92:293-302.
[49]王有为.基于禁忌表的捕食搜索算法及其在旅行商问题中的实验研究[J].系统工程理论与实践.2008,2：131-136.
[50]蒋忠中,汪定伟.物流配送车辆路径优化的模糊规划模型与算法[J].系统仿真学报,2006,18(11)：3301-3312.
[51]汪传旭,蒋良奎.基于双层规划的区域港口内陆运输网络优化决策[J].管理工程学报,2008,22(4)：67-71,84.
[52]何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3)：61-67.
[53]何波,杨超,杨珺.废弃物逆向物流网络设计的模糊多目标优化模型[J].工业工程与管理.2007,5：43-46.
[54]Buedenbender K, Grunert T, Sebastian H J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[55]Kim D, et al. Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33 (4):391-407.
[56]Smilowitz K, A tamturk A, Daganzo C F. Deferred item and vehicle routing with in integrated networks[J]. Transportation Research E,2003,39(4):305-323.
[57]汪传旭.基于轴-辐运输系统的区域港口群二级物流运输网络优化[J].系统工程理论与实践,2009,(9)：152-158.
[58]Kuby M J, Gray R G. The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research A,1993,27(1):1-12.
[59]余明珠,李建斌,雷东.装卸一体化的车辆路径问题及基于插入法的新禁忌算法[J].中国管理科学,2010,18(2)：89-95.
[60]胡明伟,唐浩.动态车辆路径问题的多目标优化模型与算法[J].深圳大学学报(理工版),2010,27(2)：230-235.
[61]Sheffi Y. Urban Transportation Networks:Equilibrium Analysis with Mathematical Programming Methods[M]. NJ:Printice-Hall,1985.
[62]Nagurney A,Dong J. Supernetworks:Decision-Making for the Information Age [M]. Cheltenham:Edward Elgar Publishing,2002.
[63]王众托,王志平.超网络初探[J].管理学报,2008,5(1)：2-8.
[64]Nagurney A, Zhao L. Variational inequalities and networks in the formation and computation of market equilibria and disequilibria:The case of direct demand functions [J]. Transportation Science,1993,27(1):4-15.
[65]Nagurney A,Dong J, Zhang D. A Supply Chain Network Equilibrium Model[J]. Transportation Research E,2002,38 (5):281-303.
[66]张铁柱,刘志勇,滕春贤,等.多商品流供应链网络均衡模型的研究[J].系统工程理论与实践,2005,25(7)：61-66.
[67]张宁.产品随机选择与运输的跨区域市场均衡[J].系统工程理论与实践,1997,17(12)：74-78.
[68]张宁,卢兴普.多规格产品随机选择的均衡[J].系统工程理论与实践,1997,17(10)：14-17,90.
[69]徐兵,朱道立.产品随机选择下多商品流供应链网络均衡模型研究[J].系统工程理论与实践,2007,3：82-90,104.
[70]王志平,周生宝,郭俊芳等.基于变分不等式的网络广告资源分配的超网络模型[J].大连海事大学学报,2007,33(4)：26-30.
[71]席运江,党延忠.基于加权超网络模型的组织知识存量表示方法[J].情报学报,2007,26(2)：210-215.
[72]Nagurney A,Dong J. Management of Knowledge Intensive Systems as Supernetworks:Modeling, Analysis, Computations, and Applications [J]. Mathematical and Computer Modelling,2005,42: 397-417.
[73]Quandt R E. A Probabilistic Abstract Mode Model. Studies in Travel Demand Ⅷ, Mathematical Inc, Princeron, New Jersey,1967.127-149.
[74]Nagurney A, Dong J, Mokhtarian P L. Teleshopping versus shopping:a multicriteria network equilibrium framework[J]. Mathematical and Computer Modeling,2001,54(34):783-798.
[75]Tzeng G. H, Chen C H. Multiobjective decision making in traffic assignment. IEEE Transactions on Engineering Management,1993,40:180-187.
[76]王志平,王众托.超网络理论及其应用[M].北京：科学出版社,2008,239-254.
[77]Erdos P, Renyi A. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences,1960,5:17-61.
[78]Watts D J, Strogatz S H. Collective dynamics of small-world networks[J]. Nature,1998,393: 440-442.
[79]Barabas A L, Albert R. Emergence of scaling in random net-works[J]. Science,1999,286:509-512.
[80]Cohen R, Erez K, Ben-Avraham D et al. Resilience of the Internet to Random Breakdowns [J]. Physical Review Letters,2000,85:4626-4629.
[81]Cohen R, Erez K, Ben-Avraham D et al. Breakdown of the Internet under Intentional Attack[J]. Physical Review Letters,2001,86(16):3682-3685.
[82]Wang B, Tang H W, Guo C H, et al. Entropy Optimization of Scale-free Networks Robustness to Random Failures[J]. Physica A,2005,363:591-596.
[83]Sole R V, Alverde S V. Information theory of complex networks:on evolution and architectural constraints[J]. Lect. Notes. Phys.,2004,650:189-207.
[84]Wang X F,Chen G.Synchronization in scale-free dynamical networks:robustness and fragility[J]. IEEE Trans.Circuits and Systems-Ⅰ,2002,49(1):54-62.
[85]Wang X F, Chen G. Synchronization in small-world dynamical networks[J]. Int.J.Bifurcation and Chaos,2002,12(1):187-192.
[86]Jeong H, Tombor B, Albert R. The large scale organization of metabolic networks[J]. Nature, 2000,407:651-654.
[87]Faloutsos M, Faloutsos P, Faloutsos C. On power law relationships of the internet topology[J]. Computer Communication Review,1999,29(4):251-262.
[88]Serrano M A, Boguna M. Topology of the world trade web[J]. Physical Review E,2003,68: 015101-015104.
[89]Newman M E J. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA, 2001,98:404-409.
[90]Albert R, Albert I, Nakarado G L. Structural vulnerability of the North American power grid. Physical Review E,2004,69:025103(R).
[91]Roopnarine P D. Extinction cascades and catastrophe in ancient food webs[J]. Paleobiology,2006, 32(1):1-19.
[92]Guimer A R, Mossa S. The World-Wide Air Transportation Network:Anomalous Centrality, Community Structure, and Cities' Global Roles [J].Proc. Natl. Acad. Sci.,2005,102(22): 7794-7799.
[93]Sen P, Dasgupta P, Chatterjee A, etal. Small-World Properties of the Indian Railway Network[J]. Phys. Rev. E,2003,67:036106.
[94]田炜,邓贵仕,武佩剑,车文娇.世界航运网络复杂性分析[J].大连理工大学学报,2007,47(4)：605-609.
[95]赵伟,何红生,林中材,杨孔庆.中国铁路客运网网络性质的研究[J].物理学报,2006,55(8)：3906-3911.
[96]刘宏鲲,周涛.中国城市航空网络的实证研究与分析[J].物理学报,2007,56(1)：106-111.
[97]黄建华.快递网络的复杂性及鲁棒性分析—以某快递企业为例[J].西南交通大学学报(社会科学版),2009,10(6)：98-102.
[98]Kosterev D N,Taylor C W,Mittelstadt W A. Model validation for the August 10,1996 WSCC system outage[J].IEEE Trans on Power Systems,1999,14(3):967-979.
[99]甘德强,胡江溢,韩祯祥.2003年国际若干停电事故思考[J].电力系统自动化,2004,28(3)：1-5.
[100]Dunne J A,Williams R J,Martinez N D. Network structure and biodiversity loss in food webs: robustness increases with connectance[J]. Ecol. Lett.,2002,5:558-567.
[101]高亮,李梦辉,吴金闪,狄增如.食物网络在顶点攻击与边攻击下的鲁棒性[J].系统工程理论与实践,2005,(7)：1-8.
[102]Jeong H, Mason S, Barabasi A L, et al. Lethality and centrality in protein networks[J]. Nature, 2001,411:41-42.
[103]Cardenas J P, Mouronte M L, Moyano L G, Vargas M L, Benito R M. On the robustness of Spanish telecommunication networks[J]. Physica A,2010,6:1-8.
[104]Darren M.Scott, David C.Novak, Lisa Aultman-Hall, Feng Guo. Network Robustness Index:A new method for identifying critical links and evaluating the performance of transportation networks[J]. Journal of transport geography,2006,14:215-227.
[105]Wu J J, Sun H J, Gao Z Y. Cascading failures on weighted urban traffic equilibrium networks [J]. Physica A,2007,386:407-413.
[106]李勇,谭跃进,吴俊.基于任务时间约束的物流保障网络级联失效抗毁性建模与分析[J].系统工程,2009,27(5)：7-12.
[107]Bavelas, Alex. A Mathematical Model for Group Structure[J]. Applied Anthropology,1948,7: 16-39.
[108]Callaway D S, Newman M E J, Strogatez S H, Watts D J. Network Robustness and Fragility: Percolation on Random Graphs [J]. Phys. Rev. Lett.,2000,85(25):5468-5471.
[109]Albert R, Jeong H, Barabasi A L. Error and Attack Tolerance of Complex Networks [J]. Nature, 2000,406:378-382.
[110]Gallos L K, Cohen R, Argyrakis P. Stability and Topology of Scale-free Networks under Attack and Defense Strategies[J]. Phys Rev Lett.,2005,94:188701.
[111]Freeman, Linton C. A Set of Measures of Centrality Based on Betweenness[J]. Sociometry, 1977,40:35-41.
[112]Freeman, Linton C. Centrality in social networks:Ⅰ.Conceptual clarification[J]. Social Networks, 1979,1(3):215-239.
[113]Barthelemy M. Betweenness centrality in large complex networks[J]. Euro. Phys. J. B,2004,38 (2):163-168.
[114]陈晓刚,孙可,曹一家.基于复杂网络理论的大电网结构脆弱性分析[J].电工技术学报,2007,22(10)：138-144.
[115]Freeman L C. Centrality in social networks:ii.Experimental results[J]. Social Networks,1979,2 (2):119-141.
[116]陈静,孙林夫.复杂网络中节点重要度评估[J].西南交通大学学报,2009,44(3)：426-429.
[117]Irina Petreska, Igor Tomovski, Eugenio Gutierrez, et al. Application of modal analysis in assessing attack vulnerability of complex networks [J]. Commun Nonlinear Sci Numer Simulat, 2010,15:1008-1018.
[118]Brandes U, A fast algorithm for betweenness centrality [J]. Journal of Mathematical Sociology, 2001,25 (2):163-177.
[119]Estrada E, Rodriguez-velazquez J A. Subgraph centrality in complex networks[J]. Physical Review E,2005,71(5):1-9.
[120]Newman M E J. A measure of betweenness centrality based on random walk[J]. Social Networks,2005,27(1):39-54.
[121]谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,11(11)：79-83.
[122]Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J].Oper Res Lett, 1982,1:157-160.
[123]Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path[J]. Theoretical Computer Science,2001,296(1):167-177.
[124]陈勇,胡爱群,胡俊等.通信网络中最重要节点确定方法[J].高技术通讯,2004,1：573-575.
[125]吴俊,谭跃进,邓宏钟,迟妍.考虑级联失效的复杂负载网络节点重要度评估[J].小型微型计算机系统,28(4)：627-630.
[126]王建伟,荣莉莉,郭天柱.一种参数可调的网络节点重要性度量方法[J].科研管理,2009,30(4)：74-79.
[127]杜巍,蔡萌,杜海峰.网络结构鲁棒性指标及应用研究[J].西安交通大学学报,2010,44(4)：93-97.
[128]王林,张婧婧.复杂网络的中心化[J].复杂系统与复杂性科学,2006,3(1)：13-20.
[129]荣莉莉,郭天柱,王建伟.复杂网络节点中心性[J].上海理工大学学报,2008,30(3)：227-230,236.
[130]Holme P,Kim B J,Yoon C N,etal. Attack vulnerability of complex networks[J]. Phys.Rev.E, 2002,65(5):056109.
[131]吴俊,谭跃进.复杂网络抗毁性测度研究[J].系统工程学报,2005(2)：128-131.
[132]Xiao Zhongzhe,Dong Zaiwang.Improved GIB synchronization method for OFDM system[J]. IEEE Telecommunications,2003,2 (8):1417-1421.
[133]Lu Hui, Dong Zai-wang.Carrier frequency offset estimation for DAB receiver based onphase reference symbol [J].IEEE Transactions on Consumer Electronics,2000,46(1):127-130.
[134]陈建国,张永静.通信网络拓扑抗毁性评估算法研究[J].无线电通信技术,2006(1)：6-7.
[135]张中伟,陈建国.抗毁通信网络设计[J].无线电通信技术,2000,26(2)：33-38.
[136]刘啸林,王能.通信网络抗毁性量度研究[J].上海师范大学学报(自然科学版),2006,35(5)：38-41.
[137]丁琳,谭敏生,肖炜.复杂网络抗毁性研究综述[J].电脑知识与技术,2009,5(1)：51-53,61.
[138]Cardenas J P, Mouronte M L, Moyano L G, Vargas M L, Benito R M. On the robustness of Spanish telecommunication networks[J]. Physica A,2010,6:1-8.
[139]Liu J G, Wang Z T, Dang Y Z, Optimization of robustness of scale-free network to random and targeted attacks [J], Mod. Phys. Lett. B,2005,19:785-792.
[140]Liu J G, Wang Z T, Dang Y Z, Optimization of scale-free network for random failures[J], Mod. Phys. Lett. B,2006,20:815-820.
[141]Paul G, Tanizawa T, Havlin S, Stanley H E. Optimization of Robustness of Complex Networks[J]. The European Physical Journal B,2004,38:187-191.
[142]Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, Irina Rish. Improving Network Robustness by Edge Modification. Physica A,2005,357:593-612.
[143]Shan He, Sheng Li, Hongru Ma. Effect of Edge Removal on Topological and Functional Robustness of Complex Networks. Physica A,2009,388:2243-2253.
[144]陶少华,刘玉华,许凯华,谈德茂.无尺度网络中集散节点的抗脆弱性策略[J].计算机工程与应用,2007,43(2)：151-153,167.
[145]Ye Wu, Ping Li, Maoyin Chen, Jinghua Xiao, Jurgen Kurths. Response of Scale-free Networks with Community Structure to External Stimuli. Physica A,2009,388:2987-2994.
[146]Kwon Y K, Cho K H. Analysis of feedback loops and robustness in network evolution based on Boolean models[J]. BMC Bioinformatics,2007,8(9):430-438.
[147]Dou B L, Wang X G, Zhang S Y. Robustness of networks against cascading failures[J]. Physica A,2010,389:2310-2317.
[148]Wang B,Tang H W, Guo C H, Xiu Z L, Zhou T, Optimization of network structure to random failures[J], Physica A:Statistical Mechanics and its Applications,2006,368 (2):607-614.
[149]Yukio Hayashi, Jun Matsukubo. Improvement of the robustness on geographical networks by adding shortcuts[J]. Physica A,2007,380:552-562.
[150]Ash J, Newth D. Optimizing complex networks for resilience against cascading failure[J]. Physica A:Statistical Mechanics and its Applications,2007,380(7):673-683.
[151]陈晔,赵金超,齐欢.分层复杂网络的鲁棒性研究[J].兵工学报,2009,30(6)：839-843.
[152]黄金源,张宁,肖仰华.基于拷贝模型的复杂网络鲁棒性研究[J].计算机应用研究,2010,27(4)：1403-1406.
[153]李勇,邓宏钟,吴俊,吕欣,刘斌,谭跃进,基于级联失效的复杂保障网络抗毁性仿真分析[J],计算机应用研究,2008,(11)：3451-3454.
[154]Shargel B, Sayama H, Epstein I R, et al. Optimization of robustness and connectivity in complex networks[J]. Phys. Rev. Lett.,2003,90 (6):068701.
[155]Valente A X C N, Sarkar A, Stone H A. Two-peak and three-peak optimal complex networks[J]. Phys. Rev. Lett.,2004,92(11):118702.
[156]Tanizawa T, Paul G, Cohen R, et al. Optimization of network robustness to waves of targeted and random attacks[J]. Phys. Rev. E,2005,71(4):047101.
[157]Wang B, Tang H W, Guo C H, et al. Entropy Optimization of Scale-free Networks Robustness to Random Failures[J]. Physica A,2005,363:591-596.
[158]Sole R V, Alverde S V. Information theory of complex networks:on evolution and architectural constraints[J]. Lect. Notes. Phys.,2004,650:189-207.
[159]Dorogovtsev S N,Mendes J F F. Comment on "Breakdown of the Internet under intentional attack"[J]. Phys. Rev. Lett.,2001,87(21):219801.
[160]Warren C P, Sander L M, Sokolov I. Geography in a scale-free network model[J]. Phys. Rev. E, 2002,66(5):056105.
[161]Rozenfeld A F, Cohen R, Ben Avraham D, et al. Scale-free networks on lattices[J]. Phys. Rev. Lett.,2002,89:218701.
[162]吴俊,谭跃进,邓宏钟,李勇,刘斌.基于不等概率抽样的不完全信息条件下复杂网络抗毁性模型[J].系统工程理论与实践,2010,30(7)：1207-1217.
[163]李勇,邓宏钟,吴俊,吕欣,刘斌,谭跃进.基于级联失效的复杂保障网络抗毁性仿真分析[J].计算机应用研究,2008,25(11)：3451-3454.
[164]Rezaei B A, Sarshar N, Roychowdhury V P,etal. Disaster management in power-law networks: Recovery from and protection against intentional attacks[J]. Physica A,2007,381:497-514.
[165]Moreno Y, Gomez J B, Pacheco A F. Instability of scale-free networks under node-breaking avalanches[J]. Europhys Lett,2002,58(4):630-636.
[166]谭跃进,吴俊,邓宏钟,朱大智.复杂网络抗毁性研究综述[J],系统工程,2006,(10)：1-5.
[167]Watts D J. A simple model of global cascades on random networks[J]. Proc Natl Acad Sci,2002, 99(9):5766-5771.
[168]Holme P. Edge overload breakdown in evolving networks [J]. Phys Rev E,2002,66(3):036119.
[169]Motter A E, Nishikawa T, Lai Y C. Cascade-based attacks on complex networks[J]. Phys Rev E, 2002,66(6):065102(R).
[170]Moreno Y, Pastor-Satorras R, Vazquez A, et al. Critical load and congestion instabilities in scale-free networks[J]. Europhys Lett,2003,62(2):292-298.
[171]Crucitti P, Latora V, Marchiori M. Model for cascading failures in complex networks[J]. Phys. Rev. E,2004,69 (4):045104(R).
[172]Zhao Liang, Kwangho P, Lai Y C. Attack vulnerability of scale-free networks due to cascading breakdown[J]. Phys Rev E,2004,70(3):035101.
[173]Wang Xiao-fan, Xu J. Cascading failures in coupled map lattices[J]. Phys Rev E,2004,70 (5): 056113.
[174]Wu Jian-jun, Gao Zi-you. Cascade and breakdown in scale-free networks with community structure[J]. Phys Rev E,2006,74(6):066111.
[175]王建伟,荣莉莉.基于负荷局域择优重新分配原则的复杂网络上的相继故障[J].物理学报,2009,58(6)：3714-3721.
[176]Wang W X, Chen G R. Universal robustness characteristic of weighted networks against cascading failure[J]. Physical Review. E,2008,77:026101.
[177]王建伟,荣莉莉.超负荷边带有崩溃概率的相继故障模型上袭击策略研究[J].中国管理科学,2009,17(6)：147-156.
[178]Wu J J, Gao Z Y, Sun H J. Effects of the cascading failures on scale-free traffic networks[J]. Physica A,2007,378:505-511.
[179]Girvan M, Newman M E J. Community structure in social and biological networks[J]. Proc Natl Acad Sci USA,2002,99:7821-7826.
[180]Ravasz E, Somera A L, Mongru D A, et al. archical organization of modularity in metabolic networks. Science,2002,297:1551-1555.
[181]Spirin V, Mirny L A. Protein complexes and functional modules in molecular networks. Proc Natl Acad Sci USA,2003,100:12123-12128.
[182]Onnela J P, Chakraborti A, Kaski K, et al. Dynamics of market correlations:Taxonomy and portfolio analysis[J]. Phys Rev,2003, E68:056110.
[183]Newman M E J. Fast algorithm for detecting community structure in networks[J]. Phys Rev. 2004, E69,066133.
[184]Watts D J, Dodds P S, Newman M E J. Identity and search in social networks [J]. Science, 2002,296:1302-1305.
[185]Fiedler M. Algebraic connectivity of graphs[J]. Czech Math J,1973,23:298-305.
[186]Pothen A, Simon H, Liou K P. Partitioning sparse matrices with eigenvectors of graphs[J]. SIAM J Matrix Anal Appl,1990,11:430-452.
[187]Mohar B.The Laplacian spectrum of graphs[J].Graph Theory Combinatorics and Applications, 1991,2:87-898.
[188]Kernighan W, Lin S. An efficient heuristic procedure for partitioning graphs[J]. Bell System Technical Journal,1970,49:291-307.
[189]Santo Fortunato. Community detection in graphs [J]. Physics Reports,2010,486(3):75-174.
[190]Breiger R L, Boorman S A, Arabie P. An algorithm for clustering relations data with applications to social network analysis and comparison with multidimensional scaling. Journal of Mathematical Psychology,1975,12:328-383.
[191]Amaral L A N, Scala A, Barthelemy M, et al. Classes of small-world networks. Proc Natl Acad Sci USA,2000,97:11149-11152.
[192]Duanbing C,Yan F, Mingsheng S. A fast and efficient heuristic algorithm for detecting community structures in complex networks [J]. Physica A:Statistical Mechanics and its Applications,2009,388(13):2741-2749.
[193]Charles F, David W, Eli V. The use of sparsest cuts to reveal the hierarchical community structure of social networks[J]. Social Networks,2008,30(3):223-234.
[194]Yang Gang,Zhou Tao,Wang Jie,et al. Epidemic spread in weighted scale-free networks[J]. Chinese Physics Letters,2005,22(2):501-513.
[195]朱涛,张水平,郭戎潇,常国岑.改进的加权复杂网络节点重要度评估的收缩方法[J].系统工程与电子技术,2009,31(8)：1902-1905.
[196]陈华良,刘忠信,陈增强,袁著祉.复杂网络的一种加权路由策略研究[J].物理学报,2009,58(9)：6068-6073.
[197]Latora V, Marchiori M. Efficient Behavior of Small-World Networks[J]. Physical Review Letters,2001,87(19):198701.
[198]Paolo Crucitti, Vito Latora, Massimo Marchiori, Andrea Rapisarda. Error and Attack Tolerance of Complex Networks[J]. Physica A,2004,340:388-394.
[199]Xiao Z Z, Dong Z W. Improved GIB synchronization method for OFDM system[J]. IEEE Telecommunications,2003,2(8):1417-1421.