基于滑动综合权的物流网络问题研究
|
摘要
当前,物流活动已经形成网络,并对生产制造活动、消费流通活动及其他社会活动形成了事实上的支撑。但是在物流网络中,存在着受客户要求、生产企业状况、物流企业状况、交通运输网络状况、相关社会经济系统状况的影响,产生在物流网络中的与时间、费用、流量等相关的问题,包括物流网络本体表征问题、物流活动度量方式问题、度量范围的容许度问题、物流网络的构成要素选择以及配流问题等。论文针对上述问题,主要从以下4个方面开展了研究。
首先,论文分析了物流网络的特性及拓扑结构。物流网络有着其特定的网络拓扑结构,除了有着与其他网络类似的基本属性外,还有着其特有的属性。论文根据研究需要,对研究对象进行了界定,认为物流网络可以由能够抽象为节点的工厂(货主)、物流中心(物流商)、交通运输枢纽或承运人等,以及能够抽象为路径的交通运输公共路径、场(厂)内输送路径以及物流主体间的联系等构成；介绍了复杂网络的结构特征参数,以及各种网络结构形式,提出物流网络具有的社会-技术双重性,以及“基础设施系统-物流设施网络-物流网络”三层结构模式,分析其基本属性和复杂网络属性,给出物流网络的拓扑结构,探讨现实中物流网络的复杂属性及其特征值范围。
其次,论文研究了物流网络中综合权的滑动机理以及滑动综合权的确定方法。论文根据物流链与供应链、物流网络的关系,分析了物流链的功能和特点,根据物流服务的供应产生时刻与需求期望时刻之间存在着一定的差值,即以时间差的形式表现出一定程度供需脱节状况,引入滑动综合权对物流链赋权。提出以时间、费用作为滑动综合权的主要组成,使用了时间价值系数将时间转化可以用价值进行度量的方式,采用双层时间窗界定物流供需双方的行为,分不计影响、存在提前滑动影响、存在延迟滑动影响、超出供需双方所能接受的时间限定范围等四种情况讨论了滑动的影响,建立随机状态条件下,服从正态分布的滑动综合权的表达函数,分析滑动综合权对于时间价值、费用、滑动影响的敏感程度,指出了减少滑动影响的途径。
再次,论文提出了物流链的选择模型及方法。论文提出在物流链规划设计中,对于其组成元素中的可替代物流节点和物流路径进行选择,以构成满足特定要求的物流链的问题。该问题是一个组合优化问题,采用滑动综合权思想描述物流链的权值。在问题规模较小时,采用了图论的方法对物流链进行了描述和拓扑,针对物流链中物流节点也存权值的情况,提出了使用改进标号算法对基于滑动综合权的物流链选择问题进行求解。在问题规模扩大后,该问题会出现参数爆炸的情况。针对该状况,提出基于滑动综合权的优化模型,采用在同一染色体中对物流节点和路径同时编码的方式,以及多维数组表示相应参数的数据处理方法,使用了遗传算法进行求解。
最后,论文研究了物流网络的配流方法。论文对于各个主体都能达到利益最大或成本最小,且能够满足一定的物流需求的物流网络配流问题,在战术层的层面上,考虑到物流业的特性,结合纳什均衡以及用户均衡原理,提出了配流问题中的物流网络框架,采用了滑动综合权思想描述物流网络的权值,分析了承运人、物流商在纳什均衡状况下的最优条件,以及考虑用户均衡原理的货主均衡条件,建立利用变分不等式形式表达的物流网络均衡配流模型,利用其等价的互补问题阐明了其现实意义,证明了模型的数学性质,据其采用修正投影算法进行求解,随后考虑到物流网络的随机状况,探讨了在随机需求和随机效用两个方面的随机状态条件下的物流网络均衡配流问题,分析了在这两方面随机状态下的不确定情形,建立了相应的变分不等式模型,利用其等价的互补问题阐明了其现实意义,证明了模型的数学性质,据其采用修正投影算法进行求解。
由于物流本质上是为满足客户的需要,对物品、服务和信息从起点到终点所有活动进行有效率且有效益的规划、组织、管理、控制等。因此,上述研究,能使物流网络更有效率地运作,创造出更多的效益,其意义在于将物流网络进行抽象,为相关研究提供了理论支撑；建立滑动综合权的赋权方法,为物流网络优化研究提供新的研究手段；根据物流网络中所具有的滑动综合权,提出物流链的构成选择和物流网络均衡配流方法,为物流网络优化理论提供新的思路与方法；从物流网络本体的角度看待各种物流运作问题,优化物流网络规划设计运作等,从而对降低社会物流消耗,加快制造业的发展,提高消费的服务水平与质量。
Nowadays, the logistics activity has formed network, also played important role in manufacture, consumption circulation and other social activities. However, the client demand, manufacturer, logistic company, the transportation network, relevant social economic system affect the logistics network. Moreover, there are many other factors would have influence on the operation of logistics network, such as the time, cost, flow characters, method of measure, the tolerance of the measure scale, the primary components,and equilibrium assignment. In this paper, I'11do some research above in four aspects.
Firstly, the paper analyses the characters and topological structure of logistics network, which has its unique basic attribute besides the similar character of general network. According to the demand of research, this paper defines the research objects, and introduces the parameters of structure feature of Complex Network and various network structures, then purposes the duality of society and technology, and three-decker structure. In addition, this paper analyses the basic character of both logistics network and Complex Network, and provide the topological structure, also discusses the complex feature and the eigenvalue of logistics network in reality.
What's more, this paper researches about the mechanism of slide general weight and its operation method. On the basis of the relevance among logistics chain, supply chain and logistics network, the paper analyses the function and character of logistics chain, and brings in the method that how the slide general weight gives weight to logistics chain. Also, the thesis presents that time and cost primarily constitutes the slide general weight. Due to the Time value coefficient transforms time into value unit of measure, and the double time window applies to definition of the behavior between suppliers and consumers of logistics, the paper discusses the influence of slide into four conditions, and sets up function expression of slide general weight on condition of random conditional. Besides, through the analysis of sensitive degree which time value, cost and slide effect on slide general weight, the paper purposes the process of decreasing slide influence.
This thesis puts forward the option of logistics chain's model and method, then explains the choose of logistics nodes and logistics route, so as to obtain the designated logistics chain model, which belongs to Optimization Combination problem. When the logistics chain choose in small scale, I adopt graph theory to get the description and topology of logistics chain, and use an improved labeling method to resolve the problem of logistics chain choose, which is based on slide general weight. As the scale enlarges, the parameters which are suitable for logistics chain choose will be in a large number. Thus, this paper intends to use genetic algorithm to get value, by means of relevant coding method, the designated data processing method. These methods stems from optimum model based on slide general weight.
At last, the paper discusses the way of logistics assignment. Under condition of Nash equilibrium and user equilibrium, the paper analyses the optimum condition of transport contractor, logistics enterprise and the balance condition of owner of cargo, in order to build the balance assignment model of logistics network, which in the form of variational inequality, and testify the model's mathematic feature which can be used to do operation. Then, the balance assignment model of logistics network, which is under the condition of random demand and utility are stated continuously. In view of relevant probability method, the paper sets up variational inequality model and makes use of it to do operation.
In essence, the logistics aims at meeting need of the client, and focus on activities of whole transportation process, which has efficient and beneficial programming, organization, management, control,in three factors such as goods, service and information. Thus, the research above may contributes to more efficient and profitable logistics network, which means abstracts the network, so as to provide theory support for relevant research. In conclusion, the paper tries to sets up the weight method of slide general weight, which provides optimum method of logistics network with new research route. According to the character of slide general weight, the paper elaborates the component choice of logistics chain and method of Equilibrium assignment in logistics network, for new concept and method of logistics network optimum theory. From the perspective of logistics network, the paper discusses variety of logistics operation and planning and design of optimum logistics network, aiming at reducing the logistics energy consumption, accelerating the development of manufacture, and improving the stander and quality of logistics service.
首先,论文分析了物流网络的特性及拓扑结构。物流网络有着其特定的网络拓扑结构,除了有着与其他网络类似的基本属性外,还有着其特有的属性。论文根据研究需要,对研究对象进行了界定,认为物流网络可以由能够抽象为节点的工厂(货主)、物流中心(物流商)、交通运输枢纽或承运人等,以及能够抽象为路径的交通运输公共路径、场(厂)内输送路径以及物流主体间的联系等构成；介绍了复杂网络的结构特征参数,以及各种网络结构形式,提出物流网络具有的社会-技术双重性,以及“基础设施系统-物流设施网络-物流网络”三层结构模式,分析其基本属性和复杂网络属性,给出物流网络的拓扑结构,探讨现实中物流网络的复杂属性及其特征值范围。
其次,论文研究了物流网络中综合权的滑动机理以及滑动综合权的确定方法。论文根据物流链与供应链、物流网络的关系,分析了物流链的功能和特点,根据物流服务的供应产生时刻与需求期望时刻之间存在着一定的差值,即以时间差的形式表现出一定程度供需脱节状况,引入滑动综合权对物流链赋权。提出以时间、费用作为滑动综合权的主要组成,使用了时间价值系数将时间转化可以用价值进行度量的方式,采用双层时间窗界定物流供需双方的行为,分不计影响、存在提前滑动影响、存在延迟滑动影响、超出供需双方所能接受的时间限定范围等四种情况讨论了滑动的影响,建立随机状态条件下,服从正态分布的滑动综合权的表达函数,分析滑动综合权对于时间价值、费用、滑动影响的敏感程度,指出了减少滑动影响的途径。
再次,论文提出了物流链的选择模型及方法。论文提出在物流链规划设计中,对于其组成元素中的可替代物流节点和物流路径进行选择,以构成满足特定要求的物流链的问题。该问题是一个组合优化问题,采用滑动综合权思想描述物流链的权值。在问题规模较小时,采用了图论的方法对物流链进行了描述和拓扑,针对物流链中物流节点也存权值的情况,提出了使用改进标号算法对基于滑动综合权的物流链选择问题进行求解。在问题规模扩大后,该问题会出现参数爆炸的情况。针对该状况,提出基于滑动综合权的优化模型,采用在同一染色体中对物流节点和路径同时编码的方式,以及多维数组表示相应参数的数据处理方法,使用了遗传算法进行求解。
最后,论文研究了物流网络的配流方法。论文对于各个主体都能达到利益最大或成本最小,且能够满足一定的物流需求的物流网络配流问题,在战术层的层面上,考虑到物流业的特性,结合纳什均衡以及用户均衡原理,提出了配流问题中的物流网络框架,采用了滑动综合权思想描述物流网络的权值,分析了承运人、物流商在纳什均衡状况下的最优条件,以及考虑用户均衡原理的货主均衡条件,建立利用变分不等式形式表达的物流网络均衡配流模型,利用其等价的互补问题阐明了其现实意义,证明了模型的数学性质,据其采用修正投影算法进行求解,随后考虑到物流网络的随机状况,探讨了在随机需求和随机效用两个方面的随机状态条件下的物流网络均衡配流问题,分析了在这两方面随机状态下的不确定情形,建立了相应的变分不等式模型,利用其等价的互补问题阐明了其现实意义,证明了模型的数学性质,据其采用修正投影算法进行求解。
由于物流本质上是为满足客户的需要,对物品、服务和信息从起点到终点所有活动进行有效率且有效益的规划、组织、管理、控制等。因此,上述研究,能使物流网络更有效率地运作,创造出更多的效益,其意义在于将物流网络进行抽象,为相关研究提供了理论支撑；建立滑动综合权的赋权方法,为物流网络优化研究提供新的研究手段；根据物流网络中所具有的滑动综合权,提出物流链的构成选择和物流网络均衡配流方法,为物流网络优化理论提供新的思路与方法；从物流网络本体的角度看待各种物流运作问题,优化物流网络规划设计运作等,从而对降低社会物流消耗,加快制造业的发展,提高消费的服务水平与质量。
Nowadays, the logistics activity has formed network, also played important role in manufacture, consumption circulation and other social activities. However, the client demand, manufacturer, logistic company, the transportation network, relevant social economic system affect the logistics network. Moreover, there are many other factors would have influence on the operation of logistics network, such as the time, cost, flow characters, method of measure, the tolerance of the measure scale, the primary components,and equilibrium assignment. In this paper, I'11do some research above in four aspects.
Firstly, the paper analyses the characters and topological structure of logistics network, which has its unique basic attribute besides the similar character of general network. According to the demand of research, this paper defines the research objects, and introduces the parameters of structure feature of Complex Network and various network structures, then purposes the duality of society and technology, and three-decker structure. In addition, this paper analyses the basic character of both logistics network and Complex Network, and provide the topological structure, also discusses the complex feature and the eigenvalue of logistics network in reality.
What's more, this paper researches about the mechanism of slide general weight and its operation method. On the basis of the relevance among logistics chain, supply chain and logistics network, the paper analyses the function and character of logistics chain, and brings in the method that how the slide general weight gives weight to logistics chain. Also, the thesis presents that time and cost primarily constitutes the slide general weight. Due to the Time value coefficient transforms time into value unit of measure, and the double time window applies to definition of the behavior between suppliers and consumers of logistics, the paper discusses the influence of slide into four conditions, and sets up function expression of slide general weight on condition of random conditional. Besides, through the analysis of sensitive degree which time value, cost and slide effect on slide general weight, the paper purposes the process of decreasing slide influence.
This thesis puts forward the option of logistics chain's model and method, then explains the choose of logistics nodes and logistics route, so as to obtain the designated logistics chain model, which belongs to Optimization Combination problem. When the logistics chain choose in small scale, I adopt graph theory to get the description and topology of logistics chain, and use an improved labeling method to resolve the problem of logistics chain choose, which is based on slide general weight. As the scale enlarges, the parameters which are suitable for logistics chain choose will be in a large number. Thus, this paper intends to use genetic algorithm to get value, by means of relevant coding method, the designated data processing method. These methods stems from optimum model based on slide general weight.
At last, the paper discusses the way of logistics assignment. Under condition of Nash equilibrium and user equilibrium, the paper analyses the optimum condition of transport contractor, logistics enterprise and the balance condition of owner of cargo, in order to build the balance assignment model of logistics network, which in the form of variational inequality, and testify the model's mathematic feature which can be used to do operation. Then, the balance assignment model of logistics network, which is under the condition of random demand and utility are stated continuously. In view of relevant probability method, the paper sets up variational inequality model and makes use of it to do operation.
In essence, the logistics aims at meeting need of the client, and focus on activities of whole transportation process, which has efficient and beneficial programming, organization, management, control,in three factors such as goods, service and information. Thus, the research above may contributes to more efficient and profitable logistics network, which means abstracts the network, so as to provide theory support for relevant research. In conclusion, the paper tries to sets up the weight method of slide general weight, which provides optimum method of logistics network with new research route. According to the character of slide general weight, the paper elaborates the component choice of logistics chain and method of Equilibrium assignment in logistics network, for new concept and method of logistics network optimum theory. From the perspective of logistics network, the paper discusses variety of logistics operation and planning and design of optimum logistics network, aiming at reducing the logistics energy consumption, accelerating the development of manufacture, and improving the stander and quality of logistics service.
引文
[1]鞠颂东.物流网络：物流资源的整合与共享[M].北京：社会科学文献出版社,2008.
[2]Goetschalckx M, Vidal C J, Dogan K. Modeling and design of global logistics systems:A review of integrated strategic and tactical models and design algorithms [J]. European Journal of Operational Research,2002,143(1):1-18.
[3]Bowersox D. J., Closs D. J., Cooper M. B.供应链物流管理(原书第3版)[M].北京：机械工业出版社,2009.
[4]Thanh P N, Peton O, Bostel N. A linear relaxation-based heuristic approach for logistics network design[J]. Computers & Industrial Engineering, 2010,59(4):964-975.
[5]Chiou S W. A fast polynomial time algorithm for logistics network flows[J]. Applied Mathematics and Computation,2008,199(1):162-170.
[6]Lin L, Gen M, Wang X. Integrated multistage logistics network design by using hybrid evolutionary algorithm[J]. Computers & Industrial Engineering, 2009,56(3):854-873.
[7]Nakatsu R T. Designing business logistics networks using model-based reasoning and heuristic-based searching[J]. Expert Systems with Applications, 2005,29(4):735-745.
[8]Gen M, Syarif A. Hybrid genetic algorithm for multi-time period production/distribution planning[J]. Computers & Industrial Engineering, 2005,48(4):799-809.
[9]Gen M, Altiparamk F, Lin L. A genetic algorithm for two-stage transportation problem using priority-based encoding[J]. OR Spectrum,2006,28(3):337-354.
[10]Altiparmak F, Gen M, Lin L. A genetic algorithm approach for multi-objective optimization of supply chain networks[J]. Computer and Industrial Engineering,2006,51(1):196-215.
[11]Bidhandi H M, Yusuff R M, Ahmad M M H M, et al. Development of a new approach for deterministic supply chain network design[J]. European Journal of Operational Research,2009,198(1):121-128.
[12]Hinojosa Y, Kalcsics J, Nickel S, et al. Dynamic supply chain design with inventory[J]. Computers & Operations Research,2008,35(2):373-391.
[13]Melo M T, Nickel S, Gama F S D. Dynamic multi-commodity capacitated facility location:a mathematical modeling framework for strategic supply chain planning [J]. Computers & Operations Research,2006,33(1):181-208.
[14]Melo M T, Nickel S, Gama F S D. Facility location and supply chain management - A review[J]. European Journal of Operational Research, 2009,196(2):401-412.
[15]Filho V J M F, Galvao R D. A tabu search heuristic for the concentrator location problem[J]. Location Science,1998,6(1-4):189-209.
[16]Gong D, Gen M, Yamazaki G, et al. Computers and Industrial EngineeringHybrid evolutionary method for capacitated location-allocation problem[J]. Computers and Industrial Engineering,1997,33(3):577-580.
[17]Jaramillo J H, Bhadury J, Batta R. On the use of genetic algorithms to solve location problems[J]. Computers & Operations Research, 2002,29(6):761-779.
[18]鞠颂东,徐杰.物流网络理论及其研究意义和方法[J].中国流通经济,2007(8)：10-13.
[19]孙杨,宋瑞,何世伟.分层物流网络设计及启发式算法求解研究[J].物流技术,2009,28(1)：55-59.
[20]石琴,陈朝阳,覃运梅.多目标物流网络优化模型的研究[J].中国管理科学,2005,13(4)：40-43.
[21]秦进,史峰,裴军.考虑库存控制的物流网络设计优化模型与算法[J].系统工程,2007,25(12)：24-29.
[22]张凤林,武小悦,郭波,等.物流网络可用性研究[J].系统工程理论方法应用,2002,12(1)：77-80.
[23]董文洪.关于建立物流网络可用性测度指标体系的研究[J].数学的实践与认识,2006,36(6)：35-41.
[24]卞文良,鞠颂东.网格影响下的物流网络及其对物流企业运作的作用[J].中国软科学,2006(2)：140-145.
[25]侯发欣,张旭梅,熊红,等.基于Petri网的虚拟供应链物流网络优化[J].计算机集成制造系统,2004,10(12)：1509-1513.
[26]Fleischmann M, Krikke H R, Dekker R, et al. A characterisation of logistics networks for product recovery[J]. Omega,2000,28(6):653-666.
[27]何波,杨超,任鸣鸣.基于第三方物流的产品回收物流网络优化模型及算法[J].计算机集成制造系统,2008,14(1)：39-44.
[28]狄卫民,胡培,马祖军,等.基于随机规划的制造／再制造物流网络优化设计[J].系统仿真学报,2008,20(9)：2368-2374.
[29]周永圣,汪寿阳.一种逆向物流网络设计模型[J].交通运输系统工程与信息,2008,8(3)：71-78.
[30]戴更新,侯云章.基于模拟退火算法的逆向物流网络设计研究[J].青岛大学学报(工程技术版),2005,20(3)：27-31.
[31]彭勇.物流网络建模及遗传算法研究[J].重庆交通大学学报(自然科学版),2008,27(3)：479-483.
[32]冯勤超,顾宁生.逆向物流网络优化设计模型[J].东南大学学报(自然科学版),2007,37(增刊(Ⅱ))：321-326.
[33]马祖军,代颖.再制造物流网络优化设计的扩展模型[J].交通运输工程学报,2007,7(3)：121-126.
[34]Weber A. On the location of industries[M]. Chicago:Uniersity of Chicago Press,1929.
[35]Hakimi S L. Optimum locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research,1964,12(3):450-459.
[36]Curry G L, Skeith R W. A dynamic programming algorithm for facility location and allocation[J]. American Institute of Industrial Engineers Transactions,1969(1):133-138.
[37]Scott A J. Dynamic location-allocation systems:some basic planning strategies[J]. Environment and Planing,1971 (3):73-82.
[38]Tapiero C S. Transportation-location-allocation problems over time[J]. Journal of Regional Science,1971,11 (3):377-384.
[39]Geoffrion A M, Graves G W. Multicommodity distribution system design by benders decomposition[J]. Management Science,1974,20(5):822-844.
[40]Wesolowsky G O, Truscott W G. The multiperiod location-allocation problem with relocation of facilities[J]. Management Science,1975,22(1):57-65.
[41]Goodchild M F. Spatial choice in location-allocation problems:the role of endogenous attraction[J]. Geographical Analysis,1978,10(1):65-72.
[42]Goodchild M F. The aggregation problem in location-allocation[J]. Geographical Analysis,1979,11:240-255.
[43]Hodson M J. Toward more realistic allocation in location-allocation models: An interaction approach[J]. Environment and Planning A, 1978,10(11):1273-1285.
[44]Alan T M, Ross A G. Capacitated service and regional constraints in location-allocation modeling[J]. Location Science,1997,5(2):103-118.
[45]Mariaonv V, Serra D. Location-allocation of multiple-server service centers with constrained queues or waiting times[J]. Annals of Operations Research, 2002,111:35-50.
[46]Gong D J, Gen M S, Yamazaki G J. Hybrid evolutionary method for capacitated location-allocation problem[J]. Computers Industrial Engineering, 1997,33(3-4):577-580.
[47]Masood A B. Combining the analytic hierarchy process and goal programming for global facility location-allocation problem[J]. International Journal of Production Economics,1999,62(3):237-248.
[48]Dias J, Captivo M E, Climaco J. Capacitated dynamic location problems with opening, closure and reopening of facilities[J]. IMA Journal of Management Mathematics,2006,17(4):317-348.
[49]张潜,高立群,胡祥培.集成化物流中的定位-配给问题的启发式算法[J].东北大学学报(自然科学版),2004,25(7)：637-640.
[50]章海峰,郝春艳,杨超.带三重容量限制的中转物流选址-分配模型[J].管理工程学报,2008,22(1)：62-66.
[51]胡丹丹,杨超,刘智伟.带有响应时间承诺的选址-分配问题研究[J].管理科学,2010,23(1)：114-121.
[52]王继强,李国君.基于设施选址问题的费用分配问题的近似算法[J].计算机工程与应用,2006(13)：13-14.
[53]戢守峰,李峰,董云龙,等.基于遗传算法的三级逆向物流网络设计模型研究[J].中国管理科学,2007,15(6)：86-90.
[54]郑称德,黄达.客户需求驱动的多层物流网络选址规划模型与算法[J].系统管理学报,2009,18(2)：232-236.
[55]王文峰,刘新亮,郭波.综合多准则决策的保障设施选址-分派方法[J].系统工程理论与实践,2008(5)：148-155.
[56]Current J, Min H, Schilling D. Multiobjective analysis of facility location decisions[J]. European Journal of Operational,1990,49(2):295-307.
[57]胡运权,郭耀煌.运筹学教程[M].北京：清华大学出版社,1998.
[58]Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science,1959,6(1):80-91.
[59]Garey M R, Johnson D S. Computers and intractability:a guide to the theory of Np-completeness[M]. New York:W. H. Freeman & Co.,1979.
[60]刘云忠,宣慧玉.车辆路径问题的模型及算法研究综述[J].管理工程学报,2005,19(1)：124-130.
[61]孙丽君,胡祥培,王征.车辆路径规划问题及其求解方法研究进展[J].系统工程,2006,24(11)：31-37.
[62]Bodin L, Golden B, Assad A, et al. Routing and scheduling of vehicles and crews:The state of the art[J]. Computers and Opertions Research, 1983,10(2):63-211.
[63]Laporte G, Mercure H, Nobert Y. An exact algorithm for the asymmetrical capacitated vehicle routing problem[J]. Networks,1986,16(1):33-46.
[64]Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning the shortest path relaxation[J]. Mathematical Programming,1981,20(1):255-282.
[65]Fisher M L. Optimal solution of vehicle routing problems using minimum k-trees[J]. Operations Research,1994,42(4):626-642.
[66]Eilon S, Watson-Gandy C D T, Christofides N. Distribution management: mathematical modelling and practical analysis [M]. London:Griffin,1971.
[67]祝崇隽,刘民,吴澄.供应链中车辆路径问题的研究进展及前景[J].计算 机集成制造系统,2001,7(11)：1-5.
[68]Balinski M, Quandt R. On an integer program for a delivery problem[J]. Operations Research,1964,12(2):300-304.
[69]Rao M R, Zionts S. Allocation of Transportation Units to Alternative Trips-A Column Generation Scheme with Out-Of-Kilter Subproblems[J]. Operations Research,1968,16(1):52-63.
[70]Laporte G, Nobert Y, Desrocher M. Optimal routing under capacity and distance restritions[J]. Operations Research,1985,33(5):1050-1073.
[71]李相勇.车辆路径问题模型及算法研究[D].上海：上海交通大学,2007.
[72]Clarke G, Wright J R. Scheduling of vehicle routing problem from a central depot to a number of delivery points[J]. Operations Research, 1964,12(4):568-581.
[73]Gaskell T J. Bases for vehicle fleet scheduling[J]. Operation Research Quarterly,1967,18(3):281-295.
[74]Yellow P. A computational modification to the savings method of vehicle scheduling[J]. Operation Research Quarterly,1970,21 (2):281-283.
[75]Wark P, Holt J. A repeated matching heuristic for the vehicle routing problem[J]. Journal of Operational Research Society,1994,45(10):1156-1167.
[76]祁文祥,陆志强,孙小明.带软时间窗的集货与送货多车辆路径问题节约算法[J].交通运输工程学报,2010,10(2)：99-103.
[77]Gillett B E, Miller L R. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research,1974,22(2):340-349.
[78]Foster B A, Ryan D M. An integer programming approach to the vehicle scheduling problem[J]. Operational Research Quarterly,1976,27(2):367-384.
[79]Renaud J, Boctor F F, Laporte G. An improved petal heuristic for the vehicle routing problem[J]. The Journal of the Operational Research Society, 1996,42(2):329-336.
[80]Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicle routing[J]. Networks,1981,11 (2):109-124.
[81]Thompson P M, Psaraftis H N. Cyclic transfer algorithms for multivehicle routing and scheduling problems[J]. Operations Research, 1993,41(5):935-946.
[82]Scheuerer S. A tabu search heuristic for the truck and trailer routing problem[J]. Computers & Operations Research,2006,33(4):894-909.
[83]Brandao J. A tabu search algorithm for the open vehicle routing problem[J]. European Journal of Operational Research,2004,157(3):552-564.
[84]Ho S C, Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries[J]. Computers & Operations Research, 2004,31(12):1947-1964.
[85]Montane FAT, Galvao R D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research,2006,33(3):595-619.
[86]李相勇,田澎.带时间窗和随机事件车辆路径问题：模型和算法[J].系统工程理论与实践,2009,29(8)：81-90.
[87]Robuste F, Daganzo C F, Souleyrette R R. Implementing vehicle routing models[J]. Transportation Research Part B:Methodological, 1990,24(4):263-286.
[88]Ulungu E L, Teghem J. Multi-objective combinatorial optimization problems: a survey[J]. Journal of Multi-Criteria Decision Analysis,1994,3(2):83-104.
[89]Osman I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993,41(4):421-451.
[90]Lawrence S, Mohammad A. Parametric experimentation with a genetic algorithmic configuration for solving the vehicle routing problem: Proceedings-Annual Meeting of the Decision Sciences Insitute,1996[C].
[91]Berger J, Barkaoui M. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows[J]. Computers & Operations Research, 2004,31(12):2037-2053.
[92]潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法[J].管理科学学报,2007,10(3)：23-29.
[93]Bullnheimer B, Hartl R F, Strauss C. Applying the ant system to the vehicle routing problem:the 2nd International Conference on Metaheuristic, Sophia Anipolis,1997[C].
[94]Bullnheimer B, Hartl R F, Strauss C. An improved at system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 1999,89(0):319-328.
[95]Yu B, Yang Z Z, Yao B Z. An improved ant colony optimization for vehicle routing problem[J]. European Journal of Operational Research, 2009,196(1):171-176.
[96]Zhang X X, Tang L X. A new hybrid ant colony optimization algorithm for the vehicle routing problem[J]. Pattern Recognition Letters, 2009,30(9):848-855.
[97]Balseiro S R, Loiseau I, Ramonet J. An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows [J]. Computers & Operations Research,2011,38(6):954-966.
[98]Gajpal Y, Abad P. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup[J]. Computers & Operations Research, 2009,36(12):3215-3223.
[99]谢秉磊,郭耀煌,郭强.动态车辆路径问题：现状与展望[J].系统工程理论 方法应用,2002,11(2)：116-120.
[100]Minkoff A S. A markov decision model and decomposition heuristic for dynamics vehicle dispatching[J]. Operations Research,1993,41(1):77-90.
[101]Swihart M R, Papastavrou J D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem[J]. European Journal of Operational Research,1999,114(3):447-464.
[102]Bertsimas D J, Ryzin G V. Stohastic and dynamic vehicle routing problem in the eucidean plane with multiple capacitated vehicles[J]. Operations Research,1993,41 (1):60-76.
[103]Averbakh I, Berman O. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science,1994,28(2):162-166.
[104]Watson-Gandy C, Dohrn R Depot location with van salesmen-a practical approach[J]. Pmega Journal of Management,1973,1(3):321-329.
[105]张潜,高立群,胡祥培.集成化物流中的定位-运输路线安排问题(LRP)优化算法评述[J].东北大学学报(自然科学学报),2003,24(1)：31-34.
[106]林岩,胡祥培,王旭茵.物流系统优化中的定位——运输路线安排问题(LRP)研究评述[J].管理工程学报,2004,18(4)：45-49.
[107]Min H, Jayaramanb V, Srivastava R. Combined location-routing problems:a synthesis and future research direction [J]. European Journal of Operational Research,1998,108(1):1-15.
[108]Madsen O B G. Methods for solving combined two level location-routing problems of realistic dimensions[J]. European Journal of Operational Research,1983,12(3):295-301.
[109]Zofrafos K G, Samara S. Combined location-routing model for hazardous waste transportation[J]. Transportation Research Record,1989(1245):52-59.
[110]List G F, Mirchandani P. An integrated network/planar multi-objective model for routing and siting for hazardous materials and wastes[J]. Transportation Science,1991,25(2):146-156.
[111]Stowers C L, Palekar U S. Location models with routing considerations for a single obnoxious facility[J]. Transportation Science,1993,27(4):350-362.
[112]Koksalan M, Siiral H, Kirca O. A location-distribution application for a beer company [J]. European Journal of Operational Research,1995,80(1):16-24.
[113]汪寿阳,赵秋红,夏国平.集成物流管理系统中定位-运输路线安排问题的研究[J].管理科学学报,2000,3(2)：69-75.
[114]张潜,高立群,刘雪梅,等.定位-运输路线安排问题的两阶段启发式算法[J].控制与决策,2004,19(7)：773-777.
[115]胡大伟,陈诚.遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007(9)：171-176.
[116]曾敏刚,崔增收,余高辉.基于应急物流的减灾系统LRP研究[J].中国 管理科学,2010,18(2)：75-80.
[117]杜纲,钟石泉.基于均衡原理的定位-运输路线安排问题模型及求解算法[J].系统管理学报,2009,18(4)：469-474.
[118]金莉,朱云龙,申海,等.集成三级物流系统的网络规划问题研究[J].计算机应用研究,2010,27(9)：3287-3289.
[119]王绍仁,马祖军.震后随机动态LRP多目标优化模型及算法[J].计算机应用研究,2010,27(9)：3283-3286.
[120]Dong M, Chen F F. Performance modeling and analysis of integrated logistic chains:An analytic framework[J]. European Journal of Poerational Research, 2004,162(1):83-98.
[121]Kim J S, Ryu K H. Optimal Routing and Unertainty Processing using Geographical Information for e-Logisitcs Chain Execution[J]. International Journal of Management Science,2004,10(2):91-119.
[122]Stevens G C. Integrating the supply chain[J]. International Journal of Physical Distribution and Material Management,1989,19(8):3-8.
[123]张晓川.物流学——系统、网络和物流链[M].北京：化学工业出版社,2005.
[124]陈宝星,李易霖,邱祝强.逆向物流链研究[J].云南科技管理,2006(5)：57-59.
[125]董彩凤,刘永明.电子商务环境下物流链扩展农村市场的探讨[J].科技与管理,2008,10(4)：27-29.
[126]刘志学,付国庆,许泽勇.物流管理与供应链管理的比较[J].计算机集成制造系统,2004,10(12)：126-130.
[127]张锦.L-OD预测理论与现代物流规划方法研究[D].成都：西南交通大学,2004.
[128]李春澜.物流链选择的非集计分析与模型研究[D].成都：西南交通大学,2005.
[129]Ljungberg D, Gebresenbet G, Aradom S. Logistics Chain of Animal Transport and Abattoir Operations[J]. Biosystems Engineering, 2007,96(2):267-277.
[130]Vergara A, Ramirez J L, Llobet E. Reducing power consumption via a discontinuous operation of temperature-modulated micro-hotplate gas sensors:Application to the logistics chain of fruit[J]. Sensors and Actuators B,2008,129(1):311-318.
[131]Lasserre F. Logistics and the Internet:transportation and location issues are crucial in the logistics chain[J]. Journal of Transport Geography,2004,12(1):73-84.
[132]Slats P A, Bhola B, Evers J J M, et al. Logistic chain modelling[J]. European Journal of Operational Research,1995,87(1):1-20.
[133]Boissiere J, Frein Y, Rapine C. Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand[J]. European Journal of Operation Research,2008,186(2):608-619.
[134]Perona M, Cigolini R, Adani M, et al. The integrated management of logistic chains in the white goods industry. A field research in Italy[J]. International Journal of Production Economics,2001,69(2):227-238.
[135]周应恒,吕超,卢凌霄.中国水产业物流链研究[J].中国渔业经济,2008,26(4)：46-51.
[136]王惠,符策,李阳,等.基于SOGSA的港口虚拟物流链构建[J].计算机工程,2007,33(13)：257-259.
[137]战书彬,郑丹.山东半岛农产品精益物流链构建[J].物流科技,2009(3)：30-32.
[138]黄祖辉,刘东英.论生鲜农产品物流链的类型与形成机理[J].中国农村经济,2006(11)：4-16.
[139]刘东英,梁佳.中国的生鲜蔬菜物流链：观察与解释——以河北省乐亭县蔬菜物流系统为例[J].中国农村经济,2007(8)：47-55.
[140]唐卫宁.基于物流链整合的物流产业集群升级模式研究[J].改革与战略,2009,25(6)：157-160.
[141]Wardrop J G. Some theoretical aspects of road traffic research,1952[C].
[142]Beckmann M J, McGuire C B, Winsten C B. Studies in the Economics of Transportation[M]. New Haven:Yale University Press,1956.
[143]Smith M J. the existence, uniquness and stability of traffic equilibria[J]. Transportation Research Part B,1979,13(4):295-304.
[144]Dafermos S. Traffic Equilibrium and Variational Inequalities[J]. Transportation Science,1980,14(1):42-54.
[145]Nagurney A. Network economics:A variational inequality approach[M]. Norwell, MA:Kluwer Academic Publisher,1993.
[146]Dial R B. A probabilistic multipath traffic assignment model which obviates path enumeration[J]. Transportation Research,1971,5(2):83-111.
[147]Daganzo C F, Sheffi Y. On stochastic models of traffic assignment[J]. Transportation Science,1977,11(3):253-274.
[148]高自友,孙会君.现代物流与交通运输系统[M].北京：人民交通出版社,2003.
[149]Nagurney A, Dong J, Zhang D. A supply chain network equilibrium model[J]. Transportation Research Part E,2002,38(5):281-303.
[150]Nagurney A. Innovations in financial and economic networks[M]. Cheltenham, England:Edward Elgar Publishing,2003.
[151]Nagurney A. On the relationship between supply chain and transportation network equilibria:A supernetwork equivalence with computations[J]. Transportation Research Part E,2006,42(4):293-316.
[152]Dong J, Zhang D, Nagurney A. A supply chain network equilibrium model with random demands[J]. European Journal of Operational Research, 2004,156(1):194-212.
[153]Nagurney A, Loo J, Dong J, et al. Supply Chain Networks and Electronic Commerce:A Theoretical Perspective [J]. Netnomics,2002,4(2):187-220.
[154]Dong J, Zhang D, Nagurney A. Transp ortation and Traffic Theory in the 21st Century[M]. Pergamon:M. A. P. Taylor,2002.
[155]徐兵,朱道立.产品随机选择下多商品流供应链网络均衡模型研究[J].系统工程理论与实践,2007(3)：82-90.
[156]滕春贤,姚锋敏,胡宪武.具有随机需求的多商品流供应链网络均衡模型的研究[J].系统工程理论与实践,2007(10).
[157]徐兵,朱道立.多用户多准则随机选择下供应链网络均衡模型[J].系统工程学报,2008,23(5)：547-553.
[158]Endos P, Renyi A. On the evolution of radom graphs[J]. Publ. Math. Inst. Hung. Acad. Sci.,1960(5):1960.
[159]Watts D J, Strogatz S H. Collective Dynamics of "Small-world" Networks[J]. Nature,1998,393(6684):440-442.
[160]Barabasi A L, Albert R. Emergence of Scaling in Random Networks[J]. Science,1999,286(5439):509-512.
[161]Albert R, Barabasi A L. Statistical mechanics of complex network[J]. Review of Modern Physics,2002,74(1):47-97.
[162]Albert R, Albert I, Nakarado G L. Structural vulnerability of the North American power grid[J]. Physical Review E,2004,69:25103.
[163]Guimera R, Amaral LAN. Modeling the world-wide airport network[J]. The European Physical Journal B,2004,38:381-385.
[164]Latora V, Marchiori M. Vulnerability and protection of infrastructure networks[J]. Physical Review E,2005,71(015103(R)).
[165]Newman M E J, Forrest S, Balthrop J. Email networks and the spread of computer viruses[J]. Physical Review E,2002,66:35101.
[166]Duan W Q, Chen Z, Liu Z R, et al. Efficient target strategies for contagion in scale-free networks[J]. Physical Review E,2005,72:26133.
[167]Gomez-Gardenes J, Echenique P, Moreno Y. Immunization of real complex communication networks[J]. The European Physical Journal B, 2006,49:259-264.
[168]Moreno Y, Nekovee M, Pacheco A F. Dynamics of rumor spreading in complex networks[J]. Physical Review E,2009,69:66130.
[169]Zanette D H. Dynamics of rumor propagation on small-world networks[J]. Physical Review E,2002,65:41908.
[170]卞文良,鞠颂东.物流复杂网络模型探究：中国数量经济学会2005年学术年会,南京,2005[C].
[171]陈国荣,鄢萍,彭军,等.一种基于成长的物流网络建模方法[J].华南理工大学学报(自然科学版),2008,36(5)：24-29.
[172]杨光华.区域物流网络结构的演化机理与优化研究[D].长沙：中南大学,2010.
[173]朱道立,龚国华,罗齐.物流和供应链管理[M].上海：复旦大学出版社,2001.
[174]王之泰.现代物流学[M].北京：中国物资出版社,1995.
[175]程赐胜,蒲云虎,王正武.高速公路物流网络规划LRP模型及算法研究[J].长沙交通学院学报,2008,24(1)：37-43.
[176]张锦.物流规划原理与方法[M].成都：西南交通大学出版社,2009.
[177]Dorogovtsev S N, Mendes J F F. Evolution of Networks[J]. Advances in Physics,2002,51(4):1079-1187.
[178]Maslov S, Sneppen K. Specificity and stability in topology of protein networks[J]. Science,2002,296:910-913.
[179]Pastor-Satorras R, Vazquez A, Vespignani A. Dynamical and correlation properties of the Internet[J]. Physical Review letters,2001,87:258701.
[180]Vazquez A, Pastor-Satorras R, Vespignani A. large-scale topological and dynamical properties of the internet[J]. Physical Review E,2002,65:66130.
[181]Newman M E J. Assortative mixing in networks[J]. Physical Review Letters, 2002,89(20):208701.
[182]Boccaletti S, Latora V, Moreno Y, et al. Complex networks:Structure and dynamics[J]. Physics Reports,2006,424:175-308.
[183]刘涛,陈忠,陈晓荣.复杂网络理论及其应用研究概述[J].系统工程,2005,23(6)：1-7.
[184]Strogatz S H. Exploring complex networks[J]. Nature,2001,410:268-276.
[185]Ravasz E, Barabasi A L. Hierarchical organization in complex networks[J]. Physical Review E,2003,67:26112.
[186]Newman M E J, Girvan M. Finding and evaluating community structure in networks[J]. Physical Review E,2004,69:026113.
[187]Newman M E J. The structure and function of complex networks[J]. SIAM Review,2003,45(2):167-256.
[188]方锦清,汪小帆,郑志刚.一门崭新的交叉科学：网络科学(上)[J].物流学进展,2007,27(3)：239-343.
[189]汪小帆,李翔,陈关荣.复杂网络理论及其应用[M].北京：清华大学出版社,2006.
[190]章忠志.复杂网络的演化模型研究[D].大连：大连理工大学,2006.
[191]吴建军.城市交通网络拓扑结构复杂性研究[D].北京：北京交通大学,2008.
[192]赵月.复杂交通网络拥堵特性及控制方法研究[D].成都：西南交通大学,2009.
[193]Barrat A, Weigt M. On the properties of small workd networks[J]. Eur. Phys. J. B,2000,13:547-560.
[194]Newman M E J, Watts D J. Renormalization group analysis of the small-world network model[J]. Phys. Lett. A,1999,263:341-346.
[195]New M E J, Moore C, Watts D J. Mean field solution of the small-world network model[J]. Physical Review Lettes,2000,84:3201-3204.
[196]Cohen R, Havlin S. Scale-free networks are ultrasmall[J]. Physical Review Letters,2003,86:3682-3685.
[197]Fonczak A, Fonczak P, Holyst J A. Mean-field theory for clustering coefficients in Barabasi-Albert network[J]. Physical Review E, 2003,68:46126.
[198]普洛斯中国.普洛斯解决方案成功案例[EB/OL]. [2010/12/26]. http://www.glprop.com/zh_cn/solutions.
[199]何美玲.供应链一体化条件下物流链研究及选择模型应用分析[D].成都：西南交通大学,2006.
[200]Current J, Min H, Schilling D A. Multiobjective analysis of facility location decisions [J]. European Journal of Operational Research, 1990,49(3):295-307.
[201]Murray A, Ross A. Capacitated service and regional constraints in location-allocation modeling[J]. Location Science,1997,5(2):103-118.
[202]Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science,1959,6(1):80-91.
[203]Watson-Gandy C, Dohrn P. Depot location with van salesmen--a practical approach[J], Omega Journal of Management Science,1973,1(3):321-329.
[204]Averbakh I, Berman O. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science,1994,28(2):162-166.
[205]教材编写组运筹学.运筹学(第三版)[M].北京：清华大学出版社,2005.
[206]Wolpert D H, Macready W G. No free lunch theorems for optimization[J]. IEEE Transactions on Evolutionary Computation,1997,1 (1):67-82.
[207]刑文训,谢金星.现代优化计算方法(第2版)[M].2.北京：清华大学出版社,2005.
[208]Holland J H. Adaptation in Natural and Artificial Systems[M]. Ann Arbor, MI:University of Michigan Press,1975.
[209]徐兵.多用户多准则随机交通均衡理论与应用研究——基于变分不等式 方法[D].上海：复旦大学,2006.
[210]徐庆,朱道立,鲁其辉.Nash均衡、变分不等式和广义均衡问题的关系[J].管理科学学报,2005,8(3)：1-7.
[211]王志平,王众托.超网络理论及其应用[M].北京：科学出版社,2008.
[212]黄海军.城市交通网络平衡分析理论与实践[M].1.北京：人民交通出版社,1994.
[213]周晶.随机交通均衡配流模型及其等价的变分不等式问题[J].系统科学与数学,2003,23(1)：120-127.
[2]Goetschalckx M, Vidal C J, Dogan K. Modeling and design of global logistics systems:A review of integrated strategic and tactical models and design algorithms [J]. European Journal of Operational Research,2002,143(1):1-18.
[3]Bowersox D. J., Closs D. J., Cooper M. B.供应链物流管理(原书第3版)[M].北京：机械工业出版社,2009.
[4]Thanh P N, Peton O, Bostel N. A linear relaxation-based heuristic approach for logistics network design[J]. Computers & Industrial Engineering, 2010,59(4):964-975.
[5]Chiou S W. A fast polynomial time algorithm for logistics network flows[J]. Applied Mathematics and Computation,2008,199(1):162-170.
[6]Lin L, Gen M, Wang X. Integrated multistage logistics network design by using hybrid evolutionary algorithm[J]. Computers & Industrial Engineering, 2009,56(3):854-873.
[7]Nakatsu R T. Designing business logistics networks using model-based reasoning and heuristic-based searching[J]. Expert Systems with Applications, 2005,29(4):735-745.
[8]Gen M, Syarif A. Hybrid genetic algorithm for multi-time period production/distribution planning[J]. Computers & Industrial Engineering, 2005,48(4):799-809.
[9]Gen M, Altiparamk F, Lin L. A genetic algorithm for two-stage transportation problem using priority-based encoding[J]. OR Spectrum,2006,28(3):337-354.
[10]Altiparmak F, Gen M, Lin L. A genetic algorithm approach for multi-objective optimization of supply chain networks[J]. Computer and Industrial Engineering,2006,51(1):196-215.
[11]Bidhandi H M, Yusuff R M, Ahmad M M H M, et al. Development of a new approach for deterministic supply chain network design[J]. European Journal of Operational Research,2009,198(1):121-128.
[12]Hinojosa Y, Kalcsics J, Nickel S, et al. Dynamic supply chain design with inventory[J]. Computers & Operations Research,2008,35(2):373-391.
[13]Melo M T, Nickel S, Gama F S D. Dynamic multi-commodity capacitated facility location:a mathematical modeling framework for strategic supply chain planning [J]. Computers & Operations Research,2006,33(1):181-208.
[14]Melo M T, Nickel S, Gama F S D. Facility location and supply chain management - A review[J]. European Journal of Operational Research, 2009,196(2):401-412.
[15]Filho V J M F, Galvao R D. A tabu search heuristic for the concentrator location problem[J]. Location Science,1998,6(1-4):189-209.
[16]Gong D, Gen M, Yamazaki G, et al. Computers and Industrial EngineeringHybrid evolutionary method for capacitated location-allocation problem[J]. Computers and Industrial Engineering,1997,33(3):577-580.
[17]Jaramillo J H, Bhadury J, Batta R. On the use of genetic algorithms to solve location problems[J]. Computers & Operations Research, 2002,29(6):761-779.
[18]鞠颂东,徐杰.物流网络理论及其研究意义和方法[J].中国流通经济,2007(8)：10-13.
[19]孙杨,宋瑞,何世伟.分层物流网络设计及启发式算法求解研究[J].物流技术,2009,28(1)：55-59.
[20]石琴,陈朝阳,覃运梅.多目标物流网络优化模型的研究[J].中国管理科学,2005,13(4)：40-43.
[21]秦进,史峰,裴军.考虑库存控制的物流网络设计优化模型与算法[J].系统工程,2007,25(12)：24-29.
[22]张凤林,武小悦,郭波,等.物流网络可用性研究[J].系统工程理论方法应用,2002,12(1)：77-80.
[23]董文洪.关于建立物流网络可用性测度指标体系的研究[J].数学的实践与认识,2006,36(6)：35-41.
[24]卞文良,鞠颂东.网格影响下的物流网络及其对物流企业运作的作用[J].中国软科学,2006(2)：140-145.
[25]侯发欣,张旭梅,熊红,等.基于Petri网的虚拟供应链物流网络优化[J].计算机集成制造系统,2004,10(12)：1509-1513.
[26]Fleischmann M, Krikke H R, Dekker R, et al. A characterisation of logistics networks for product recovery[J]. Omega,2000,28(6):653-666.
[27]何波,杨超,任鸣鸣.基于第三方物流的产品回收物流网络优化模型及算法[J].计算机集成制造系统,2008,14(1)：39-44.
[28]狄卫民,胡培,马祖军,等.基于随机规划的制造／再制造物流网络优化设计[J].系统仿真学报,2008,20(9)：2368-2374.
[29]周永圣,汪寿阳.一种逆向物流网络设计模型[J].交通运输系统工程与信息,2008,8(3)：71-78.
[30]戴更新,侯云章.基于模拟退火算法的逆向物流网络设计研究[J].青岛大学学报(工程技术版),2005,20(3)：27-31.
[31]彭勇.物流网络建模及遗传算法研究[J].重庆交通大学学报(自然科学版),2008,27(3)：479-483.
[32]冯勤超,顾宁生.逆向物流网络优化设计模型[J].东南大学学报(自然科学版),2007,37(增刊(Ⅱ))：321-326.
[33]马祖军,代颖.再制造物流网络优化设计的扩展模型[J].交通运输工程学报,2007,7(3)：121-126.
[34]Weber A. On the location of industries[M]. Chicago:Uniersity of Chicago Press,1929.
[35]Hakimi S L. Optimum locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research,1964,12(3):450-459.
[36]Curry G L, Skeith R W. A dynamic programming algorithm for facility location and allocation[J]. American Institute of Industrial Engineers Transactions,1969(1):133-138.
[37]Scott A J. Dynamic location-allocation systems:some basic planning strategies[J]. Environment and Planing,1971 (3):73-82.
[38]Tapiero C S. Transportation-location-allocation problems over time[J]. Journal of Regional Science,1971,11 (3):377-384.
[39]Geoffrion A M, Graves G W. Multicommodity distribution system design by benders decomposition[J]. Management Science,1974,20(5):822-844.
[40]Wesolowsky G O, Truscott W G. The multiperiod location-allocation problem with relocation of facilities[J]. Management Science,1975,22(1):57-65.
[41]Goodchild M F. Spatial choice in location-allocation problems:the role of endogenous attraction[J]. Geographical Analysis,1978,10(1):65-72.
[42]Goodchild M F. The aggregation problem in location-allocation[J]. Geographical Analysis,1979,11:240-255.
[43]Hodson M J. Toward more realistic allocation in location-allocation models: An interaction approach[J]. Environment and Planning A, 1978,10(11):1273-1285.
[44]Alan T M, Ross A G. Capacitated service and regional constraints in location-allocation modeling[J]. Location Science,1997,5(2):103-118.
[45]Mariaonv V, Serra D. Location-allocation of multiple-server service centers with constrained queues or waiting times[J]. Annals of Operations Research, 2002,111:35-50.
[46]Gong D J, Gen M S, Yamazaki G J. Hybrid evolutionary method for capacitated location-allocation problem[J]. Computers Industrial Engineering, 1997,33(3-4):577-580.
[47]Masood A B. Combining the analytic hierarchy process and goal programming for global facility location-allocation problem[J]. International Journal of Production Economics,1999,62(3):237-248.
[48]Dias J, Captivo M E, Climaco J. Capacitated dynamic location problems with opening, closure and reopening of facilities[J]. IMA Journal of Management Mathematics,2006,17(4):317-348.
[49]张潜,高立群,胡祥培.集成化物流中的定位-配给问题的启发式算法[J].东北大学学报(自然科学版),2004,25(7)：637-640.
[50]章海峰,郝春艳,杨超.带三重容量限制的中转物流选址-分配模型[J].管理工程学报,2008,22(1)：62-66.
[51]胡丹丹,杨超,刘智伟.带有响应时间承诺的选址-分配问题研究[J].管理科学,2010,23(1)：114-121.
[52]王继强,李国君.基于设施选址问题的费用分配问题的近似算法[J].计算机工程与应用,2006(13)：13-14.
[53]戢守峰,李峰,董云龙,等.基于遗传算法的三级逆向物流网络设计模型研究[J].中国管理科学,2007,15(6)：86-90.
[54]郑称德,黄达.客户需求驱动的多层物流网络选址规划模型与算法[J].系统管理学报,2009,18(2)：232-236.
[55]王文峰,刘新亮,郭波.综合多准则决策的保障设施选址-分派方法[J].系统工程理论与实践,2008(5)：148-155.
[56]Current J, Min H, Schilling D. Multiobjective analysis of facility location decisions[J]. European Journal of Operational,1990,49(2):295-307.
[57]胡运权,郭耀煌.运筹学教程[M].北京：清华大学出版社,1998.
[58]Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science,1959,6(1):80-91.
[59]Garey M R, Johnson D S. Computers and intractability:a guide to the theory of Np-completeness[M]. New York:W. H. Freeman & Co.,1979.
[60]刘云忠,宣慧玉.车辆路径问题的模型及算法研究综述[J].管理工程学报,2005,19(1)：124-130.
[61]孙丽君,胡祥培,王征.车辆路径规划问题及其求解方法研究进展[J].系统工程,2006,24(11)：31-37.
[62]Bodin L, Golden B, Assad A, et al. Routing and scheduling of vehicles and crews:The state of the art[J]. Computers and Opertions Research, 1983,10(2):63-211.
[63]Laporte G, Mercure H, Nobert Y. An exact algorithm for the asymmetrical capacitated vehicle routing problem[J]. Networks,1986,16(1):33-46.
[64]Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning the shortest path relaxation[J]. Mathematical Programming,1981,20(1):255-282.
[65]Fisher M L. Optimal solution of vehicle routing problems using minimum k-trees[J]. Operations Research,1994,42(4):626-642.
[66]Eilon S, Watson-Gandy C D T, Christofides N. Distribution management: mathematical modelling and practical analysis [M]. London:Griffin,1971.
[67]祝崇隽,刘民,吴澄.供应链中车辆路径问题的研究进展及前景[J].计算 机集成制造系统,2001,7(11)：1-5.
[68]Balinski M, Quandt R. On an integer program for a delivery problem[J]. Operations Research,1964,12(2):300-304.
[69]Rao M R, Zionts S. Allocation of Transportation Units to Alternative Trips-A Column Generation Scheme with Out-Of-Kilter Subproblems[J]. Operations Research,1968,16(1):52-63.
[70]Laporte G, Nobert Y, Desrocher M. Optimal routing under capacity and distance restritions[J]. Operations Research,1985,33(5):1050-1073.
[71]李相勇.车辆路径问题模型及算法研究[D].上海：上海交通大学,2007.
[72]Clarke G, Wright J R. Scheduling of vehicle routing problem from a central depot to a number of delivery points[J]. Operations Research, 1964,12(4):568-581.
[73]Gaskell T J. Bases for vehicle fleet scheduling[J]. Operation Research Quarterly,1967,18(3):281-295.
[74]Yellow P. A computational modification to the savings method of vehicle scheduling[J]. Operation Research Quarterly,1970,21 (2):281-283.
[75]Wark P, Holt J. A repeated matching heuristic for the vehicle routing problem[J]. Journal of Operational Research Society,1994,45(10):1156-1167.
[76]祁文祥,陆志强,孙小明.带软时间窗的集货与送货多车辆路径问题节约算法[J].交通运输工程学报,2010,10(2)：99-103.
[77]Gillett B E, Miller L R. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research,1974,22(2):340-349.
[78]Foster B A, Ryan D M. An integer programming approach to the vehicle scheduling problem[J]. Operational Research Quarterly,1976,27(2):367-384.
[79]Renaud J, Boctor F F, Laporte G. An improved petal heuristic for the vehicle routing problem[J]. The Journal of the Operational Research Society, 1996,42(2):329-336.
[80]Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicle routing[J]. Networks,1981,11 (2):109-124.
[81]Thompson P M, Psaraftis H N. Cyclic transfer algorithms for multivehicle routing and scheduling problems[J]. Operations Research, 1993,41(5):935-946.
[82]Scheuerer S. A tabu search heuristic for the truck and trailer routing problem[J]. Computers & Operations Research,2006,33(4):894-909.
[83]Brandao J. A tabu search algorithm for the open vehicle routing problem[J]. European Journal of Operational Research,2004,157(3):552-564.
[84]Ho S C, Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries[J]. Computers & Operations Research, 2004,31(12):1947-1964.
[85]Montane FAT, Galvao R D. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research,2006,33(3):595-619.
[86]李相勇,田澎.带时间窗和随机事件车辆路径问题：模型和算法[J].系统工程理论与实践,2009,29(8)：81-90.
[87]Robuste F, Daganzo C F, Souleyrette R R. Implementing vehicle routing models[J]. Transportation Research Part B:Methodological, 1990,24(4):263-286.
[88]Ulungu E L, Teghem J. Multi-objective combinatorial optimization problems: a survey[J]. Journal of Multi-Criteria Decision Analysis,1994,3(2):83-104.
[89]Osman I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J]. Annals of Operations Research, 1993,41(4):421-451.
[90]Lawrence S, Mohammad A. Parametric experimentation with a genetic algorithmic configuration for solving the vehicle routing problem: Proceedings-Annual Meeting of the Decision Sciences Insitute,1996[C].
[91]Berger J, Barkaoui M. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows[J]. Computers & Operations Research, 2004,31(12):2037-2053.
[92]潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法[J].管理科学学报,2007,10(3)：23-29.
[93]Bullnheimer B, Hartl R F, Strauss C. Applying the ant system to the vehicle routing problem:the 2nd International Conference on Metaheuristic, Sophia Anipolis,1997[C].
[94]Bullnheimer B, Hartl R F, Strauss C. An improved at system algorithm for the vehicle routing problem[J]. Annals of Operations Research, 1999,89(0):319-328.
[95]Yu B, Yang Z Z, Yao B Z. An improved ant colony optimization for vehicle routing problem[J]. European Journal of Operational Research, 2009,196(1):171-176.
[96]Zhang X X, Tang L X. A new hybrid ant colony optimization algorithm for the vehicle routing problem[J]. Pattern Recognition Letters, 2009,30(9):848-855.
[97]Balseiro S R, Loiseau I, Ramonet J. An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows [J]. Computers & Operations Research,2011,38(6):954-966.
[98]Gajpal Y, Abad P. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup[J]. Computers & Operations Research, 2009,36(12):3215-3223.
[99]谢秉磊,郭耀煌,郭强.动态车辆路径问题：现状与展望[J].系统工程理论 方法应用,2002,11(2)：116-120.
[100]Minkoff A S. A markov decision model and decomposition heuristic for dynamics vehicle dispatching[J]. Operations Research,1993,41(1):77-90.
[101]Swihart M R, Papastavrou J D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem[J]. European Journal of Operational Research,1999,114(3):447-464.
[102]Bertsimas D J, Ryzin G V. Stohastic and dynamic vehicle routing problem in the eucidean plane with multiple capacitated vehicles[J]. Operations Research,1993,41 (1):60-76.
[103]Averbakh I, Berman O. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science,1994,28(2):162-166.
[104]Watson-Gandy C, Dohrn R Depot location with van salesmen-a practical approach[J]. Pmega Journal of Management,1973,1(3):321-329.
[105]张潜,高立群,胡祥培.集成化物流中的定位-运输路线安排问题(LRP)优化算法评述[J].东北大学学报(自然科学学报),2003,24(1)：31-34.
[106]林岩,胡祥培,王旭茵.物流系统优化中的定位——运输路线安排问题(LRP)研究评述[J].管理工程学报,2004,18(4)：45-49.
[107]Min H, Jayaramanb V, Srivastava R. Combined location-routing problems:a synthesis and future research direction [J]. European Journal of Operational Research,1998,108(1):1-15.
[108]Madsen O B G. Methods for solving combined two level location-routing problems of realistic dimensions[J]. European Journal of Operational Research,1983,12(3):295-301.
[109]Zofrafos K G, Samara S. Combined location-routing model for hazardous waste transportation[J]. Transportation Research Record,1989(1245):52-59.
[110]List G F, Mirchandani P. An integrated network/planar multi-objective model for routing and siting for hazardous materials and wastes[J]. Transportation Science,1991,25(2):146-156.
[111]Stowers C L, Palekar U S. Location models with routing considerations for a single obnoxious facility[J]. Transportation Science,1993,27(4):350-362.
[112]Koksalan M, Siiral H, Kirca O. A location-distribution application for a beer company [J]. European Journal of Operational Research,1995,80(1):16-24.
[113]汪寿阳,赵秋红,夏国平.集成物流管理系统中定位-运输路线安排问题的研究[J].管理科学学报,2000,3(2)：69-75.
[114]张潜,高立群,刘雪梅,等.定位-运输路线安排问题的两阶段启发式算法[J].控制与决策,2004,19(7)：773-777.
[115]胡大伟,陈诚.遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007(9)：171-176.
[116]曾敏刚,崔增收,余高辉.基于应急物流的减灾系统LRP研究[J].中国 管理科学,2010,18(2)：75-80.
[117]杜纲,钟石泉.基于均衡原理的定位-运输路线安排问题模型及求解算法[J].系统管理学报,2009,18(4)：469-474.
[118]金莉,朱云龙,申海,等.集成三级物流系统的网络规划问题研究[J].计算机应用研究,2010,27(9)：3287-3289.
[119]王绍仁,马祖军.震后随机动态LRP多目标优化模型及算法[J].计算机应用研究,2010,27(9)：3283-3286.
[120]Dong M, Chen F F. Performance modeling and analysis of integrated logistic chains:An analytic framework[J]. European Journal of Poerational Research, 2004,162(1):83-98.
[121]Kim J S, Ryu K H. Optimal Routing and Unertainty Processing using Geographical Information for e-Logisitcs Chain Execution[J]. International Journal of Management Science,2004,10(2):91-119.
[122]Stevens G C. Integrating the supply chain[J]. International Journal of Physical Distribution and Material Management,1989,19(8):3-8.
[123]张晓川.物流学——系统、网络和物流链[M].北京：化学工业出版社,2005.
[124]陈宝星,李易霖,邱祝强.逆向物流链研究[J].云南科技管理,2006(5)：57-59.
[125]董彩凤,刘永明.电子商务环境下物流链扩展农村市场的探讨[J].科技与管理,2008,10(4)：27-29.
[126]刘志学,付国庆,许泽勇.物流管理与供应链管理的比较[J].计算机集成制造系统,2004,10(12)：126-130.
[127]张锦.L-OD预测理论与现代物流规划方法研究[D].成都：西南交通大学,2004.
[128]李春澜.物流链选择的非集计分析与模型研究[D].成都：西南交通大学,2005.
[129]Ljungberg D, Gebresenbet G, Aradom S. Logistics Chain of Animal Transport and Abattoir Operations[J]. Biosystems Engineering, 2007,96(2):267-277.
[130]Vergara A, Ramirez J L, Llobet E. Reducing power consumption via a discontinuous operation of temperature-modulated micro-hotplate gas sensors:Application to the logistics chain of fruit[J]. Sensors and Actuators B,2008,129(1):311-318.
[131]Lasserre F. Logistics and the Internet:transportation and location issues are crucial in the logistics chain[J]. Journal of Transport Geography,2004,12(1):73-84.
[132]Slats P A, Bhola B, Evers J J M, et al. Logistic chain modelling[J]. European Journal of Operational Research,1995,87(1):1-20.
[133]Boissiere J, Frein Y, Rapine C. Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand[J]. European Journal of Operation Research,2008,186(2):608-619.
[134]Perona M, Cigolini R, Adani M, et al. The integrated management of logistic chains in the white goods industry. A field research in Italy[J]. International Journal of Production Economics,2001,69(2):227-238.
[135]周应恒,吕超,卢凌霄.中国水产业物流链研究[J].中国渔业经济,2008,26(4)：46-51.
[136]王惠,符策,李阳,等.基于SOGSA的港口虚拟物流链构建[J].计算机工程,2007,33(13)：257-259.
[137]战书彬,郑丹.山东半岛农产品精益物流链构建[J].物流科技,2009(3)：30-32.
[138]黄祖辉,刘东英.论生鲜农产品物流链的类型与形成机理[J].中国农村经济,2006(11)：4-16.
[139]刘东英,梁佳.中国的生鲜蔬菜物流链：观察与解释——以河北省乐亭县蔬菜物流系统为例[J].中国农村经济,2007(8)：47-55.
[140]唐卫宁.基于物流链整合的物流产业集群升级模式研究[J].改革与战略,2009,25(6)：157-160.
[141]Wardrop J G. Some theoretical aspects of road traffic research,1952[C].
[142]Beckmann M J, McGuire C B, Winsten C B. Studies in the Economics of Transportation[M]. New Haven:Yale University Press,1956.
[143]Smith M J. the existence, uniquness and stability of traffic equilibria[J]. Transportation Research Part B,1979,13(4):295-304.
[144]Dafermos S. Traffic Equilibrium and Variational Inequalities[J]. Transportation Science,1980,14(1):42-54.
[145]Nagurney A. Network economics:A variational inequality approach[M]. Norwell, MA:Kluwer Academic Publisher,1993.
[146]Dial R B. A probabilistic multipath traffic assignment model which obviates path enumeration[J]. Transportation Research,1971,5(2):83-111.
[147]Daganzo C F, Sheffi Y. On stochastic models of traffic assignment[J]. Transportation Science,1977,11(3):253-274.
[148]高自友,孙会君.现代物流与交通运输系统[M].北京：人民交通出版社,2003.
[149]Nagurney A, Dong J, Zhang D. A supply chain network equilibrium model[J]. Transportation Research Part E,2002,38(5):281-303.
[150]Nagurney A. Innovations in financial and economic networks[M]. Cheltenham, England:Edward Elgar Publishing,2003.
[151]Nagurney A. On the relationship between supply chain and transportation network equilibria:A supernetwork equivalence with computations[J]. Transportation Research Part E,2006,42(4):293-316.
[152]Dong J, Zhang D, Nagurney A. A supply chain network equilibrium model with random demands[J]. European Journal of Operational Research, 2004,156(1):194-212.
[153]Nagurney A, Loo J, Dong J, et al. Supply Chain Networks and Electronic Commerce:A Theoretical Perspective [J]. Netnomics,2002,4(2):187-220.
[154]Dong J, Zhang D, Nagurney A. Transp ortation and Traffic Theory in the 21st Century[M]. Pergamon:M. A. P. Taylor,2002.
[155]徐兵,朱道立.产品随机选择下多商品流供应链网络均衡模型研究[J].系统工程理论与实践,2007(3)：82-90.
[156]滕春贤,姚锋敏,胡宪武.具有随机需求的多商品流供应链网络均衡模型的研究[J].系统工程理论与实践,2007(10).
[157]徐兵,朱道立.多用户多准则随机选择下供应链网络均衡模型[J].系统工程学报,2008,23(5)：547-553.
[158]Endos P, Renyi A. On the evolution of radom graphs[J]. Publ. Math. Inst. Hung. Acad. Sci.,1960(5):1960.
[159]Watts D J, Strogatz S H. Collective Dynamics of "Small-world" Networks[J]. Nature,1998,393(6684):440-442.
[160]Barabasi A L, Albert R. Emergence of Scaling in Random Networks[J]. Science,1999,286(5439):509-512.
[161]Albert R, Barabasi A L. Statistical mechanics of complex network[J]. Review of Modern Physics,2002,74(1):47-97.
[162]Albert R, Albert I, Nakarado G L. Structural vulnerability of the North American power grid[J]. Physical Review E,2004,69:25103.
[163]Guimera R, Amaral LAN. Modeling the world-wide airport network[J]. The European Physical Journal B,2004,38:381-385.
[164]Latora V, Marchiori M. Vulnerability and protection of infrastructure networks[J]. Physical Review E,2005,71(015103(R)).
[165]Newman M E J, Forrest S, Balthrop J. Email networks and the spread of computer viruses[J]. Physical Review E,2002,66:35101.
[166]Duan W Q, Chen Z, Liu Z R, et al. Efficient target strategies for contagion in scale-free networks[J]. Physical Review E,2005,72:26133.
[167]Gomez-Gardenes J, Echenique P, Moreno Y. Immunization of real complex communication networks[J]. The European Physical Journal B, 2006,49:259-264.
[168]Moreno Y, Nekovee M, Pacheco A F. Dynamics of rumor spreading in complex networks[J]. Physical Review E,2009,69:66130.
[169]Zanette D H. Dynamics of rumor propagation on small-world networks[J]. Physical Review E,2002,65:41908.
[170]卞文良,鞠颂东.物流复杂网络模型探究：中国数量经济学会2005年学术年会,南京,2005[C].
[171]陈国荣,鄢萍,彭军,等.一种基于成长的物流网络建模方法[J].华南理工大学学报(自然科学版),2008,36(5)：24-29.
[172]杨光华.区域物流网络结构的演化机理与优化研究[D].长沙：中南大学,2010.
[173]朱道立,龚国华,罗齐.物流和供应链管理[M].上海：复旦大学出版社,2001.
[174]王之泰.现代物流学[M].北京：中国物资出版社,1995.
[175]程赐胜,蒲云虎,王正武.高速公路物流网络规划LRP模型及算法研究[J].长沙交通学院学报,2008,24(1)：37-43.
[176]张锦.物流规划原理与方法[M].成都：西南交通大学出版社,2009.
[177]Dorogovtsev S N, Mendes J F F. Evolution of Networks[J]. Advances in Physics,2002,51(4):1079-1187.
[178]Maslov S, Sneppen K. Specificity and stability in topology of protein networks[J]. Science,2002,296:910-913.
[179]Pastor-Satorras R, Vazquez A, Vespignani A. Dynamical and correlation properties of the Internet[J]. Physical Review letters,2001,87:258701.
[180]Vazquez A, Pastor-Satorras R, Vespignani A. large-scale topological and dynamical properties of the internet[J]. Physical Review E,2002,65:66130.
[181]Newman M E J. Assortative mixing in networks[J]. Physical Review Letters, 2002,89(20):208701.
[182]Boccaletti S, Latora V, Moreno Y, et al. Complex networks:Structure and dynamics[J]. Physics Reports,2006,424:175-308.
[183]刘涛,陈忠,陈晓荣.复杂网络理论及其应用研究概述[J].系统工程,2005,23(6)：1-7.
[184]Strogatz S H. Exploring complex networks[J]. Nature,2001,410:268-276.
[185]Ravasz E, Barabasi A L. Hierarchical organization in complex networks[J]. Physical Review E,2003,67:26112.
[186]Newman M E J, Girvan M. Finding and evaluating community structure in networks[J]. Physical Review E,2004,69:026113.
[187]Newman M E J. The structure and function of complex networks[J]. SIAM Review,2003,45(2):167-256.
[188]方锦清,汪小帆,郑志刚.一门崭新的交叉科学：网络科学(上)[J].物流学进展,2007,27(3)：239-343.
[189]汪小帆,李翔,陈关荣.复杂网络理论及其应用[M].北京：清华大学出版社,2006.
[190]章忠志.复杂网络的演化模型研究[D].大连：大连理工大学,2006.
[191]吴建军.城市交通网络拓扑结构复杂性研究[D].北京：北京交通大学,2008.
[192]赵月.复杂交通网络拥堵特性及控制方法研究[D].成都：西南交通大学,2009.
[193]Barrat A, Weigt M. On the properties of small workd networks[J]. Eur. Phys. J. B,2000,13:547-560.
[194]Newman M E J, Watts D J. Renormalization group analysis of the small-world network model[J]. Phys. Lett. A,1999,263:341-346.
[195]New M E J, Moore C, Watts D J. Mean field solution of the small-world network model[J]. Physical Review Lettes,2000,84:3201-3204.
[196]Cohen R, Havlin S. Scale-free networks are ultrasmall[J]. Physical Review Letters,2003,86:3682-3685.
[197]Fonczak A, Fonczak P, Holyst J A. Mean-field theory for clustering coefficients in Barabasi-Albert network[J]. Physical Review E, 2003,68:46126.
[198]普洛斯中国.普洛斯解决方案成功案例[EB/OL]. [2010/12/26]. http://www.glprop.com/zh_cn/solutions.
[199]何美玲.供应链一体化条件下物流链研究及选择模型应用分析[D].成都：西南交通大学,2006.
[200]Current J, Min H, Schilling D A. Multiobjective analysis of facility location decisions [J]. European Journal of Operational Research, 1990,49(3):295-307.
[201]Murray A, Ross A. Capacitated service and regional constraints in location-allocation modeling[J]. Location Science,1997,5(2):103-118.
[202]Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science,1959,6(1):80-91.
[203]Watson-Gandy C, Dohrn P. Depot location with van salesmen--a practical approach[J], Omega Journal of Management Science,1973,1(3):321-329.
[204]Averbakh I, Berman O. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science,1994,28(2):162-166.
[205]教材编写组运筹学.运筹学(第三版)[M].北京：清华大学出版社,2005.
[206]Wolpert D H, Macready W G. No free lunch theorems for optimization[J]. IEEE Transactions on Evolutionary Computation,1997,1 (1):67-82.
[207]刑文训,谢金星.现代优化计算方法(第2版)[M].2.北京：清华大学出版社,2005.
[208]Holland J H. Adaptation in Natural and Artificial Systems[M]. Ann Arbor, MI:University of Michigan Press,1975.
[209]徐兵.多用户多准则随机交通均衡理论与应用研究——基于变分不等式 方法[D].上海：复旦大学,2006.
[210]徐庆,朱道立,鲁其辉.Nash均衡、变分不等式和广义均衡问题的关系[J].管理科学学报,2005,8(3)：1-7.
[211]王志平,王众托.超网络理论及其应用[M].北京：科学出版社,2008.
[212]黄海军.城市交通网络平衡分析理论与实践[M].1.北京：人民交通出版社,1994.
[213]周晶.随机交通均衡配流模型及其等价的变分不等式问题[J].系统科学与数学,2003,23(1)：120-127.