产业集群中物流一体化与运输协作研究
|
摘要
产业集群是当代经济发展中的独特而广泛的现象,已经成为一个国家或地区获得竞争优势的途径。产业集群存在着资源和产品的“大进大出”,需要集群内部不同企业物流的协调一致。物流系统的服务效率和成本在很大程度上决定了产业集群的市场规模和竞争力。我国产业集群区域的物流服务提供方基本上是以中小企业为主,一定程度上阻碍了产业集群进一步发展。产业集群的动态发展、集群区域中物流总量不断增多、物流跨度逐步扩大等,对原有的物流运作模式提出了挑战。
从宏观的角度看,条块分割、部门分割、地区封锁是阻碍我国物流产业发展的主要体制束缚。为了消除物流部门间利益冲突、降低物流活动各项成本的交替损益、提高物流系统的物流管理运作效率与物流绩效、降低整个供应链成本、强化供应链核心竞争力、扩大企业竞争优势,有必要构建有效的产业集群中物流一体化运作模式与策略,并给出相关政策。
从微观的角度来看,运输成本在物流成本中占据绝大部分比例,降低运输成本可以提高物流企业竞争力。目前绝大部分物流企业采用的是车辆不协作的运输策略,即车辆在运输时,都是独立运输,车辆之间没有协作。当物流运输的客户需求或者道路信息为不确定信息时,不协作的运输策略可能会带来巨大的资源浪费,导致物流成本上升;而车辆相互协作运输不但能充分利用途中车辆的运输能力,还能缩短客户的服务时间,从而减少运输成本,提高服务质量。所以有必要设计更高效的车辆运输协作策略来进行协作运输,优化车辆路径。
基于以上原因,本文从如下几个方面研究产业集群中物流一体化与运输协作策略,期望能整合物流资源,实现整体优化,降低物流成本。
(1)提出了物流产业界定的(f,θ,D)动态相对性标准,以动态的观点来界定物流产业构成,认为物流系统应该拓展哪些业务,应该配置哪些设施,应该从物流服务的需要出发加以考虑。
(2)构建了产业集群中物流一体化运作模式与策略来整合不同物流企业的不同资源,通过不同职能部门之间或不同企业之间物流活动上的合作,期望打破我国物流产业发展的主要体制束缚,达到提高物流效率、降低物流成本的效果。
(3)研究了产业集群中的物流运输协作策略与优化问题。首先对产业集群中的小规模物流运输车辆协作策略进行了研究,在已有的一些车辆协作策略基础上提出了两辆车的LPBZS策略、三辆车的TVFDW策略与TVSD策略、四辆车的FVFD策略与FVSD策略,并对这些车辆协作策略进行了数学分析与算例分析,结果证明了这些策略能充分利用车辆在服务过程中的容量,减少了车辆因服务失败而返回车场重新装载货物后再去服务剩余顾客的装载次数,也减少了车辆服务完毕后因为有货物剩余而必须卸载的卸载次数,缩短了车辆行使距离,有效降低了物流运输成本。
(4)在上述研究的基础上设计了产业集群中的大规模物流运输车辆协作策略。设计了大规模模糊需求车辆路径问题的分区方法:基于客户需求属性的模糊聚类分区方法与改进的基地启发式分区方法,在此基础上提出了大规模模糊需求车辆路径问题的局部车辆协作策略与全局车辆协作策略,并设计了最优协作分区计算方法,还对这些分区方法与车辆协作策略进行了算例分析。结果证明分区的合理与否直接影响车辆协作优化效果,最优协作分区计算方法是非常有效的,全局协作策略要比局部协作策略效果更好。
(5)最后有针对性地研究了基于车辆运输协作策略的求解模糊需求车辆路径问题的有效算法。设计了求解该类问题的基于不同规模车辆协作策略下的混合禁忌搜索算法、混合遗传算法与混合蚁群算法,最后用不同客户数量、不同车辆容量的测试实例对这些算法的性能进行了算例分析,结果证明了这些算法的有效性,尤其对于物流企业降低运输成本、装载与卸载成本来说很有意义。
Industrial cluster is the distinct and extensive economic phenomena, and it is the approach that one country or region to obtain competitive advantage. There are many natural resources and products which need coordinated logistics service provided by different logistics enterprises in industrial cluster. The efficiency and cost of logistics system determine the market size and competition of industrial clusters to a large extent. Many logistics service providers in industrial cluster region in China are small and medium-sized logistics enterprises, and they hindered the further development of industrial clusters to some extent. The traditional logistics operation mode must be improved or changed because of dynamic development of industrial clusters, the increasing logistics demands and gradually expanding range of logistics activities.
From the macro point, the traditional planning system of departmental segmentation and regional blockade stunt the growth of logistics enterprises in China. It is essential for us to build more efficient operation mode of logistics integration and relevant policies to eliminate interest conflicts between different logistics departments, cut down logistics cost, enhance logistics operation efficiency and effect, reduce the cost of supply chain, and strengthen the core competitiveness of the supply chain and enterprise competitive advantage.
From the microscopic point, transportation costs occupy the vast majority of logistics cost,cutting down transportation costs can enhance the logistics enterprise competition. But the most of logistics enterprises use vehicle uncoordinated strategy today, in which each vehicle serves its customers independently, and there is no coordination between any two vehicles. If the traffic information or customer demands are uncertain, vehicle uncoordinated strategy will result in much wastage of vehicle capacity on the way. Serving under the vehicle coordinated strategy, vehicle capacity will be used more fully on the way, the vehicle loading cost and uninstalling cost are decreased, and total traffic distance is less, such that the cost is decreased while the service quality is improved. So it is significance to design more efficient vehicle coordinated strategy for coordinated logistics transportation to optimize vehicle routing.
For these reasons, logistics integration and transportation coordinated strategy in industrial cluster region is considered from the following aspects in this paper. We want to integrate different logistics resources to achieve the overall optimization and reduce logistics costs.
(1) We design the (f,θ, D) dynamic relative standard for logistics defination. We can define the component of logistics industry by the proposed standard, thus we rationally judge the logistics business, arrange reasonable logistics facilities in the light of the logistics operation need in fact.
(2) We discuss the operation mode and strategy of logistics integration to integrate different logistics resources in different logistics enterprises based on above research. The aim is to remove the shackle of traditional planning system, improve logistics efficiency and reduce logistics cost by business cooperation between different functional departments or logistics enterprises.
(3) The logistics transportation coordinated strategy and optimization in industrial cluster region is discussed in this paper. We present several new vehicle coordinated strategies for small scale logistics transportation problem, which include two vehicle-paired strategy named LPBZS, three vehicle-paired strategy named TVFDW and TVSD, and four vehicle-paired strategy named FVFD and FVSD based on the past vehicle coordinated strategies. We analyze and test proposed strategies, the results show that these proposed strategies effectively make use of vehicle capacity on the way, decrease vehicle loading cost because of service failure and uninstalling cost due to overplus, shorten distance effectively, and cut down logistics transportation cost.
(4) We put forward vehicle coordinated strategies for large scale logistics transportation problem based on above researches. We design zoning approaches for large scale VRPFD, which include fuzzy clustering zoning approach based on the attributes of customer demands and improved base heuristics zoning approach. And we develop partial vehicle coordinated strategy and entire vehicle coordinated strategy based on the proposed zoning approaches, and present the best coordination subarea computing approach. We test these proposed approaches, the results show that the rationality of zoning approach has great influence on the optimizing effect, and entire vehicle coordinated strategy is better than partial vehicle coordinated strategy because entire vehicle coordinated strategy can make the best of vehicle capacity in the service process, cut down logistics cost, and enhance service quality.
(5) Finally we provide the algorithms for solving VRPFD based on different scale vehicle coordinated strategy. We design hybrid tabu algorithm,hybrid gene algorithm and hybrid ant colony algorithm based on different scale vehicle coordinated strategies. And we use different scale VRPFD test instances to test these proposed algorithms. The results show that these proposed algorithms are rational and effective. It is significance for the logistics enterprises to cut down logistics transportation cost, vehicle loading cost and uninstalling cost.
从宏观的角度看,条块分割、部门分割、地区封锁是阻碍我国物流产业发展的主要体制束缚。为了消除物流部门间利益冲突、降低物流活动各项成本的交替损益、提高物流系统的物流管理运作效率与物流绩效、降低整个供应链成本、强化供应链核心竞争力、扩大企业竞争优势,有必要构建有效的产业集群中物流一体化运作模式与策略,并给出相关政策。
从微观的角度来看,运输成本在物流成本中占据绝大部分比例,降低运输成本可以提高物流企业竞争力。目前绝大部分物流企业采用的是车辆不协作的运输策略,即车辆在运输时,都是独立运输,车辆之间没有协作。当物流运输的客户需求或者道路信息为不确定信息时,不协作的运输策略可能会带来巨大的资源浪费,导致物流成本上升;而车辆相互协作运输不但能充分利用途中车辆的运输能力,还能缩短客户的服务时间,从而减少运输成本,提高服务质量。所以有必要设计更高效的车辆运输协作策略来进行协作运输,优化车辆路径。
基于以上原因,本文从如下几个方面研究产业集群中物流一体化与运输协作策略,期望能整合物流资源,实现整体优化,降低物流成本。
(1)提出了物流产业界定的(f,θ,D)动态相对性标准,以动态的观点来界定物流产业构成,认为物流系统应该拓展哪些业务,应该配置哪些设施,应该从物流服务的需要出发加以考虑。
(2)构建了产业集群中物流一体化运作模式与策略来整合不同物流企业的不同资源,通过不同职能部门之间或不同企业之间物流活动上的合作,期望打破我国物流产业发展的主要体制束缚,达到提高物流效率、降低物流成本的效果。
(3)研究了产业集群中的物流运输协作策略与优化问题。首先对产业集群中的小规模物流运输车辆协作策略进行了研究,在已有的一些车辆协作策略基础上提出了两辆车的LPBZS策略、三辆车的TVFDW策略与TVSD策略、四辆车的FVFD策略与FVSD策略,并对这些车辆协作策略进行了数学分析与算例分析,结果证明了这些策略能充分利用车辆在服务过程中的容量,减少了车辆因服务失败而返回车场重新装载货物后再去服务剩余顾客的装载次数,也减少了车辆服务完毕后因为有货物剩余而必须卸载的卸载次数,缩短了车辆行使距离,有效降低了物流运输成本。
(4)在上述研究的基础上设计了产业集群中的大规模物流运输车辆协作策略。设计了大规模模糊需求车辆路径问题的分区方法:基于客户需求属性的模糊聚类分区方法与改进的基地启发式分区方法,在此基础上提出了大规模模糊需求车辆路径问题的局部车辆协作策略与全局车辆协作策略,并设计了最优协作分区计算方法,还对这些分区方法与车辆协作策略进行了算例分析。结果证明分区的合理与否直接影响车辆协作优化效果,最优协作分区计算方法是非常有效的,全局协作策略要比局部协作策略效果更好。
(5)最后有针对性地研究了基于车辆运输协作策略的求解模糊需求车辆路径问题的有效算法。设计了求解该类问题的基于不同规模车辆协作策略下的混合禁忌搜索算法、混合遗传算法与混合蚁群算法,最后用不同客户数量、不同车辆容量的测试实例对这些算法的性能进行了算例分析,结果证明了这些算法的有效性,尤其对于物流企业降低运输成本、装载与卸载成本来说很有意义。
Industrial cluster is the distinct and extensive economic phenomena, and it is the approach that one country or region to obtain competitive advantage. There are many natural resources and products which need coordinated logistics service provided by different logistics enterprises in industrial cluster. The efficiency and cost of logistics system determine the market size and competition of industrial clusters to a large extent. Many logistics service providers in industrial cluster region in China are small and medium-sized logistics enterprises, and they hindered the further development of industrial clusters to some extent. The traditional logistics operation mode must be improved or changed because of dynamic development of industrial clusters, the increasing logistics demands and gradually expanding range of logistics activities.
From the macro point, the traditional planning system of departmental segmentation and regional blockade stunt the growth of logistics enterprises in China. It is essential for us to build more efficient operation mode of logistics integration and relevant policies to eliminate interest conflicts between different logistics departments, cut down logistics cost, enhance logistics operation efficiency and effect, reduce the cost of supply chain, and strengthen the core competitiveness of the supply chain and enterprise competitive advantage.
From the microscopic point, transportation costs occupy the vast majority of logistics cost,cutting down transportation costs can enhance the logistics enterprise competition. But the most of logistics enterprises use vehicle uncoordinated strategy today, in which each vehicle serves its customers independently, and there is no coordination between any two vehicles. If the traffic information or customer demands are uncertain, vehicle uncoordinated strategy will result in much wastage of vehicle capacity on the way. Serving under the vehicle coordinated strategy, vehicle capacity will be used more fully on the way, the vehicle loading cost and uninstalling cost are decreased, and total traffic distance is less, such that the cost is decreased while the service quality is improved. So it is significance to design more efficient vehicle coordinated strategy for coordinated logistics transportation to optimize vehicle routing.
For these reasons, logistics integration and transportation coordinated strategy in industrial cluster region is considered from the following aspects in this paper. We want to integrate different logistics resources to achieve the overall optimization and reduce logistics costs.
(1) We design the (f,θ, D) dynamic relative standard for logistics defination. We can define the component of logistics industry by the proposed standard, thus we rationally judge the logistics business, arrange reasonable logistics facilities in the light of the logistics operation need in fact.
(2) We discuss the operation mode and strategy of logistics integration to integrate different logistics resources in different logistics enterprises based on above research. The aim is to remove the shackle of traditional planning system, improve logistics efficiency and reduce logistics cost by business cooperation between different functional departments or logistics enterprises.
(3) The logistics transportation coordinated strategy and optimization in industrial cluster region is discussed in this paper. We present several new vehicle coordinated strategies for small scale logistics transportation problem, which include two vehicle-paired strategy named LPBZS, three vehicle-paired strategy named TVFDW and TVSD, and four vehicle-paired strategy named FVFD and FVSD based on the past vehicle coordinated strategies. We analyze and test proposed strategies, the results show that these proposed strategies effectively make use of vehicle capacity on the way, decrease vehicle loading cost because of service failure and uninstalling cost due to overplus, shorten distance effectively, and cut down logistics transportation cost.
(4) We put forward vehicle coordinated strategies for large scale logistics transportation problem based on above researches. We design zoning approaches for large scale VRPFD, which include fuzzy clustering zoning approach based on the attributes of customer demands and improved base heuristics zoning approach. And we develop partial vehicle coordinated strategy and entire vehicle coordinated strategy based on the proposed zoning approaches, and present the best coordination subarea computing approach. We test these proposed approaches, the results show that the rationality of zoning approach has great influence on the optimizing effect, and entire vehicle coordinated strategy is better than partial vehicle coordinated strategy because entire vehicle coordinated strategy can make the best of vehicle capacity in the service process, cut down logistics cost, and enhance service quality.
(5) Finally we provide the algorithms for solving VRPFD based on different scale vehicle coordinated strategy. We design hybrid tabu algorithm,hybrid gene algorithm and hybrid ant colony algorithm based on different scale vehicle coordinated strategies. And we use different scale VRPFD test instances to test these proposed algorithms. The results show that these proposed algorithms are rational and effective. It is significance for the logistics enterprises to cut down logistics transportation cost, vehicle loading cost and uninstalling cost.
引文
[1]郭耀煌,李军.车辆优化调度.成都:成都科技大学出版社, 1994, 1-23
[2]娄山佐.车辆路径问题的建模及优化算法研究: [西北工业大学博士学位论文].西安:西北工业大学, 2006, 33-43
[3]张建勇.模糊信息条件下车辆路径问题研究: [西南交通大学博士学位论文].成都:西南交通大学, 2004, 28-40
[4]李相勇.车辆路径问题模型及算法研究: [上海交通大学博士学位论文].上海:上海交通大学, 2007, 8-10
[5] Canen A. G. , Scott L. G. . Bridging theory and practice in VRP. Journal of the Operational Research Society, 1995, 46(1): 1-8
[6]祝崇隽,刘民,吴澄.供应链中车辆路径问题的研究进展及前景.计算机集成制造系统CIMS, 2001, 7(11): 1-6
[7]袁庆达,游斌.库存--运输联合优化问题简介.物流技术, 2001,(5): 9-10
[8]郭耀煌.安排城市卡车行车路线的一种新算法.系统工程学报, 1989, 4(2): 70-78
[9]汪寿阳,赵秋红,夏国平.集成物流管理系统中定位-运输路线安排问题的研究.管理科学学报, 2000, 3(2): 69-75
[10]谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望.系统工程理论方法应用, 2002, 11(2): 116-120
[11]刘志硕,申金升,关伟.车辆路径问题的混合蚁群算法设计与实现.管理科学学报, 2007, 10(3): 15-22
[12]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究.系统工程理论与实践, 1999,(6): 40-45
[13]潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法.管理科学学报, 2007, 10(3): 23-29
[14]李军.车辆调度问题的分派启发式算法.系统工程理论与实践, 1999,(1): 27-33
[15]叶耀华,朱晓梅,陈霖.一种带时间窗口和在前约束的车辆路线问题及其算法.系统工程理论与实践, 2000, (3): 110-112
[16] Michel Gendreau. Invited Review for Stochastic Vehicle Routing. European Journal of Operations Research, 1996, 88: 3-12
[17] Gilbert Laporte. The Vehicle Routing Problem: An overview of exact andapproximate algorithms, European Journal of Operations Research, 1992,59: 345-358
[18] Gilbert Laporte. Model and exact solutions for a class of stochastic location-routing problems. European Journal of Operations Research, 1989, 39: 71-78
[19]刘兴.基于协作的车辆路径问题研究: [天津大学博士学位论文].天津:天津大学, 2006, 23-60
[20]于波,丁源.带模糊需求的多类型车辆路径问题研究.兰州交通大学学报(自然科学版), 2006, 25 (3): 137-140
[21]张建勇,李军.模糊车辆路径问题的一种混合遗传算法.管理工程学报, 2005, (2): 22-25
[22]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用, 2006, 26(11): 2639-2643
[23]张建勇,郭耀煌,李军.模糊需求信息条件下的车辆路径问题研究.系统工程学报, 2004, 19(1): 74-78
[24] Laporte G. , Mercure H. , Nobert Y. . An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks, 1986, 16: 33-46
[25] Christofides N. , Mingozzi A. , Toth P. . State space relaxation procedures for the computation of bounds to routing problems. Networks. practical analysis, 1981, (11): 145-164
[26] Balinsk M., Quandi R.. On an integer program for a delivery problem. Operations Research. 1964, (12): 300-304
[27] Laporte Ci. , 1vlercure H. , Nobert Y. . An branch-and-bound algorithm for a class of asymmetrical vehicle routing problem. Journal of the Operational Research Society, 1991
[28] Christofides N. , Mingozzi A. , Toth P. . Exact algorithm for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical programming. 1981, 20: 255-282
[29] Eilon S. , Watson-Gandy C. D. T. , Christofides N. . Distribution management: Mathematical modelling and practical analysis. London: Griffin, 1971
[30] Anily S. . The general mufti-retailer EOQ problem with vehicle routing costs. European Journal of Operational Research. 1994, 79: 451- 473
[31] Bodin L. D. , Golden B. L. Classification in vehicle routing and scheduling. Network, 1981, (11): 7-108
[32] Laporte G. . The Vehicle Routing Problem: An overview of exact andapproximate algorithms. European Journal of Operational Research. 1992, 59: 345-358
[33] Magnantj T. L. . Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Network. 1981, 11: 179-213
[34]谢秉磊.随机车辆问题研究: [西南交通大学博士学位论文].成都:西南交通大学, 2003, 6-26
[35] Taillard E. , Badeau P. . A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 1997, 31(2): 170-186
[36] Tan K. C. , Lee L. H. , Zhu Q. L. , Ou K. . Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, 2001, 15(3): 281-295
[37] Torki A. , Somhon S. , Enkawa T. . Competitive Neural Network algorithm for solving Vehicle Routing Problem. Computers & Industrial Engineering, 1997, 33: 473-476
[38] Bowerman R. L. , Calarnai P. H. , Hall G. B. . The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, European Journal of Operational Research, 1994, 76: 128-142
[39] Mosheiov G. . Vehicle routing with pick-up and delivery: Tour-partitioning heuristics. Computers & Industrial Engineering, 1998, 34(3): 669-684
[40] Kohld N. , Madsen O. B. G. . Optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research, 1997, 45(3): 395-406
[41] Toth P, Vigo D. . A heuristic algorithm for the symmetric and asymmetric routing problems with backhauls. European Journal of Operational Research, 1999, 113: 528-543
[42] Gillett B. , Miller L. . A heuristic algorithm for the vehicle dispatch problem. Operations Research Quarterly, 1976, 27: 367-384
[43] Renaud J. , Boctor F. , Laporte G. . An improved petal heuristic for the vehicle routing problem. Journal of Operational Research Society, 1996, 47: 329-336
[44] Potvin J. Y, Rousseau J. . A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 1993, 66: 331-340
[45] Clarke G. , Wright J. W. . Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 1964, 12: 568-581
[46] Solomon M. M. Algorithms for the vehicle routing and scheduling problem withtime windows constraints. Operations Research, 1987, 35: 254-265
[47] Salhi S. , Nagy G. . A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society, 1999, 50: 1034-1042
[48] Gendreau M. , Hertz A. , Laporte G. . The traveling salesman problem with backhauls. Computers & Operations Research, 1996, 23: 501-508
[49] Gendreau M. , Hertz A. , Laporte G. . A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research, 1998,43: 330-335
[50] Gendreau M. , Laporte G. , Vigo D. . Heuristic for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 1999, 26: 699-714
[51] Cordone R. , Calvo R. W. . A heuristic for the vehicle routing problem with time windows. Journal of Heuristics, 2001, 7(2): 107-129
[52] Lin S. . Computer solutions of the travelling salesman problem. Bell System Technical Journal, 1965, 44: 2245-2269
[53] Breedam A. V. . Improvement heuristic for the Vehicle Routing Problem based on Simulated Annealing. European Journal of Operational Research, 1995, 86: 480-490
[54] Teodorovic D. , Pavkovic G. . The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain. Fuzzy Set and Systems, 1996, 82: 307-317
[55] Perincherry V. , Kikuchi S. . A fuzzy approach to the transshipment problem. In: Ayyub, B.M. (Ed.), Proceedings of ISUMA '90, The First International Symposium on Uncertainty Modeling and Analysis. IEEE Computer Press, College Park, Maryland,1990, 330-335
[56] Kagaya S. , Kikuchi S. Donelly R. Use of fuzzy ralation for grouping of trip in vehicle routing and scheduling problem. European Journal of Operational Research, 1994, 76: 143-154
[57] Vukadinovic N, Teodorovic D. A fuzzy approach to the vessel dispatching problem. European Journal of Operational Research, 1994, 76: 155-164
[58] Teodorovic D. , Radivojevic G. A fuzzy logic approach to dynamic Dial-A-Ride problem. Fuzzy Set and Systems, 2000, 116: 23-33
[59]刘兴,贺国光,高文伟.一种有时间约束的多车辆协作路径模型及算法.系统工程, , 2005, 23 (4): 105-109
[60] Alan Laurence Erera, Design of Large-Scale Logistics Systems for Uncertain Environments [dissertation], California: University of colifornia, Berkeley, 2000
[61] Charnes A. , Cooper WW. . Chance-constrained programming. Management Science. 1959, 6(1): 73-79
[62] Liu B. , Iwamura K. . Modelling stochastic decision systems using dependent- chance programming. European Journal of Operational Research, 1997, 101(1): 193-203
[63]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用, 2006, 26 (11): 2639-2643
[64] B. Gillet, L. Miller. A heuristic algorithm for the vehicle dispatch problem Oper. Res. 1974,(22): 340-349
[65]萧蕴诗,李炳宇.小窗口蚁群算法.计算机工程, 2003, 29(20): 143-145
[66] ZHU Y, SHASHA D. Statstream: Statistical monitoring of thousands of data streams in real time. Proceedings of 28th International Conference on Very Large Data Bases, 2002, 358-369
[67] GAMBARDELLA LM, TAILLARD E, AGAZZI G. IDSIA-06-99, MACS-VRPTW: Vehicle Routing Problem with Time Windows, 1999
[68] TOMAS S, HOLDER HH. MAX-MIN ant system. Future Generation Computer Systems, 2000, 16(8): 889-914
[69] BULUT A, SINCH K, SWAT. Hierarchical stream summarization in large networks. IEEE International Conference on Data Engineering, 2003: 563-575
[70]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法.系统工程理论与实践, 2002, 22(3): 109-113
[71] C. F. Daganzo, A. L. Erera. On planning and design of logistics systems for uncertain environments. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin. 1999, 480: 3-21
[72] Dimitris J. Bertsimas. A Vehicle Routing Problem With Stochastic Demand. Operations Research, 1992, 40 (3): 574-585
[73] Jose Brandao, Richard Eglese. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research, 2008, 35: 1112-1126
[74] Ana Osvald, Lidija Zadnik Stirn. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. Journal of Food Engineering, 2008, 85: 285-295
[75] Burak Eksiglu, Sandra Duni Eksioglu, Pramod Jain. A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Computers & Industrial Engineering, 2008, 54: 1-11
[76] Lixing Yang, Yuan Feng. A bicriteria solid transportation problem with fixed charge under stochastic environment. Applied Mathematical Modelling, 2007, 31: 2668-2683
[77] Lixing Yang, Xiaoyu Ji, Ziyou Gao, Keping Li. Logistics distribution centers location problem and algorithm under fuzzy environment. Journal of Computational and Applied Mathematics, 2007, 208: 303-315
[78] Cheong Y M, Ong H L, Huang H C, Modeling the vehicle routing problem for a soft drink distribution company. Asia-Pacific Journal of Operational Research, 2002, 19: 17-34
[79] Beasley J E, Christofides N. Vehicle routing with a sparse feasibility graph. European Journal of Operational Research, 1997, 98(3): 499-511
[80] Golden B L, Wasil E A. Computerized vehicle routing in the soft drink industry. Operation Research, 1987, 35(1): 6-17
[81]曹二保,赖明勇,聂凯,刘长石.大规模物流配送车辆调度问题研究.湖南大学学报(自然科学版), 2007, 34(12): 89-92
[82]曲志伟,蔡临宁,李晨.大规模车辆配送/收集问题的求解框架.清华大学学报(自然科学版), 2004, 44(5) : 581-584
[83] Golden B L, Wasil E A, Kelly J P, Chao I-M. The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G, editors. Fleet management and logistic s. Boston, MA: Kluwer; 1998, 33-56
[84] Feiyue Lia, Bruce Goldenb, Edward Wasilc. Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research, 2005, 32: 1165-1179
[85]徐菡,张敏洪.大规模逆向物流网络非线性优化模型的研究.中国科学院研究生院学报, 2007, 24(6): 749-755
[86]张庆年.大规模外贸物流系统规划计算方法研究.武汉大学学报(社会科学版), 2001, 54(3): 319-324
[87]田青,郑力,齐二石,缪立新.大规模物流网络的组合遗传算法研究.工业工程与管理, 2006, (4): 46-49
[88]缪成,许维胜,吴启迪.大规模应急救援物资运输模型的构建与求解.系统工程, 2006,(11): 6-12
[89] Yves Caseau, Fran qois Laburthe.A fast heuristic forlarge routing problems.In Proceedings IFORS, l998
[90] Jacques Renaud, Fayez F. Boctor, A sweep-based algorithm for the. eetsize and mix vehicle routing problem, European Journal of Operational Research, 2002, 140: 618-628
[91] Gulay Barbarosoglu, Demet Ozgur, A tabu search algorithm for the vehicle routing problem, computers and operations research, 1999, 26: 255-270
[92]李志.区域物流产业构成及其基本特征.中国流通经济, 2008, (4): 15-17
[93]韩世莲.物流配送线路多目标优化方法研究: [东南大学博士学位论文].南京:东南大学, 2006, 81-99
[94] C. F. Daganzo, A. L. Erera, On planning and design of logistics systems for uncertain environments, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, 1999, 480: 3-21
[95]张海刚,吴燕翔,顾幸生,甘世红,刘雨青.基于改进免疫算法的带模糊需求车辆调度问题.重庆工学院学报(自然科学), 2008, 22(3): 87-91
[96]骆正山,王小完.基于模糊条件下车辆路径问题的研究.微电子学与计算机, 2005, 22(3): 181-184
[97]朱晓锋,蔡延光,李菲,莫善区,陈泽南.一类具有模糊需求运输调度问题的禁忌搜索算法.广东工业大学学报, 2008, 25(1): 15-19
[98]曹二保,赖明勇,张汉江.模糊需求车辆路径问题研究.系统工程, 2007, 25(1): 14-18
[99]姜昌华.遗传算法在物流系统优化中的应用研究: [华东师范大学博士学位论文].上海:华东师范大学, 2007, 11-22
[100] Dantzig G B, Ramser J H. The truck dispatching problem. Management Science, 1959, 6(1): 80-91
[101]张建勇,李军.具有模糊旅行时间的VRP的一种混合遗传算法.管理工程学报, 2006, 4: 13-17
[102]孙小年,陈幼林,杨东援.装卸一体化车辆路径问题的遗传算法研究.系统工程理论与实践, 2007,2: 149-152
[103]王凌.智能优化算法及其应用.北京:清华大学出版社, 2001, 18-27
[104]蔡延光,钱积新,孙优贤.多重运输调度问题基于双表的并行表搜索算法.系统工程理论与实践, 1998, 18(11): 20-26
[105]郎茂祥,胡思继.车辆路径问题的禁忌搜索算法研究.管理工程学报, 2004, (1): 81-84
[106]王永亮,袁振洲.多配送中心单向车辆调度问题的模型与禁忌搜索算法的研究.物流技术, 2008, 27(2): 41-45
[107]王雪莲,汪波,钟石泉.一类半开放式车辆路径问题及其禁忌算法研究.系统仿真学报, 2008,20(8): 1969-1973
[108] Jose Brandao. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 2004, 157: 552-564
[109] Jose Brandao. A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 2006,173: 540-555
[110] Fermín Alfredo Tang Montané, Roberto Diéguez Galvao. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 2006,33: 595-619
[111] Nicola Bianchessi, Giovanni Righini. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research, 2007,34: 578-594
[112] dSPACE. Control Desk Experiment Guide, Release3. 2 &3. 3. Paderborn: dSPACE GmbH, 2001
[113]韩建枫,李敏强,寇纪淞.一种求解TSP问题的新型遗传编码及应用.天津大学学报, 2003,36(2): 225-229
[114] David H. Wolpert, William G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Inst. , Sante Fe, New Mexico, 1995. (http: //citeseer. ist. psu. edu/wolpert95no. html)
[115] Joerg Homberger, Hermann Gehring. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, European Journal of Operational Research, 2005,162: 220-238
[116]张涛,田文馨,张玥杰,刘士新.带车辆行程约束的VRPSPD问题的改进蚁群算法.系统工程理论与实践, 2008, (1): 132-141
[117] Wade A, Salhi S. An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls. Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, Netherlands, 2004, 699-719
[118] Reimann M, Doerner K, Hartl R F. Insertion based ants for vehicle routing problems with backhauls and timewindows//ANTS: 2002 Lecture Notes in Computer Sciences, 2002, 136-148
[119] Catay B, Gokce E. I. An ant colony system approach for the capacitated vehicle routing problem with simultaneous delivery and pick-up. Working Paper, Sabanci University, 2005
[120]李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究.管理工程学报, 2006, (4): 9-12
[121]马良,项培军.蚂蚁算法在组合优化中的应用.管理科学学报, 2001,4(2): 32-37
[122]张纪会,徐心和.一种新的进化算法-蚁群算法.系统工程理论与实践, 1999, 36(3): 84-87
[123]惠宁.产业集群的区域经济效应研究[西北大学博士学位论文].西北大学, 2006, 22-37
[124] Machiel Van Pijk, Ondor Nomalor. Technological Regimes and industrial Pyramics: the Evidence from Dutch Manufacturing. Industrial and Corporate change, 2000,9(2): 173-194
[125]吴晓波,耿帅.区域集群自稔性风险成因分析.经济地理, 2003,23: 726-730
[126]王缉慈.创新的空间-企业集群与区域发展.北京:北京大学出版社, 2001, 20-28
[127]刘友金.中小企业集群式创新.北京:中国经济出版社, 2004, 11-27
[128] Spinoza L M, Quandt C. An IT-based framework for knowledge management in networked organizations. E-Business and Virtual Enterprises, 2000, 371-380
[129]魏守华,石碧华.论企业集群的竞争优势.中国工业经济, 2002,(1): 59-65
[130]张平.基于资源视角的企业集群优势分析.中国软科学, 2004, (9): 95-98
[131]卢长利,周溪召.家具制造业物流一体化信息平台建设.物流技术, 2006, (12): 88-89
[132]美国供应链管理专业协会官方网站(http://www.cscmp.org/)的物流术语定义
[133]何明珂.物流系统论.北京:高等教育出版社, 2004: 69-70
[134]中国物流与采购联合会的官方网站(http://www.cflp.org.cn/)《物流术语》修订第三稿(征求意见稿)
[135]张圣忠.物流产业组织理论研究[长安大学博士学位论文]. 2006: 14-30
[136]迈克尔.波特.国家竞争优势.(李明轩,邱如美译),华厦出版社, 2002, 1-21
[137]迈克尔.波特.竞争论.(高登北,李明轩译),中信出版社, 2003, 1-18
[138]美国仓库物流协会(http://www.iwla.com/)的物流术语定义
[139]张聪群.产业集群互动机理研究[西北农业科技大学博士学位论文].西北农业科技大学, 2007, 17-26
[140]王述英,王青.试论物流产业的属性及其组成.学习与探索, 2006, (2): 228-231
[141]昝廷全.产业经济系统研究.北京:科学出版社, 2002, 79-80
[142]物流一体化-MBA智库百科(http://wiki.mbalib.com/wiki/物流一体化), 2009-04-21
[143]高映红,何沙,苏燕平.虚拟企业运作中的信任机制研究.价值工程, 2002, (5): 9-11
[144]贺盛瑜.物流联盟企业间伙伴信任机制的建立与维护.经济师, 2004, (7): 164-165
[145]冯蔚东,陈剑.虚拟企业中伙伴收益分配比例的确定.系统工程理论与实践, 2002, (4): 45-49
[146]陈菊红,汪应洛,孙林岩.虚拟企业收益分配问题博弈研究.运筹与管理, 2002, (1): 11-16
[147]孔文.基于现代物流下的物流产业分析及政策研究[东北财经大学博士学位论文].东北财经大学, 2007, 111-130
[148]陈国庆,管来智.从财税政策上扶持上海现代物流业的发展.上海商业, 2005, (6): 14-16
[149]汪鸣.物流管理、物流经济与物流产业.中国物流产业网-现代物流报, http://www.xd56b.com/
[150] Meade L.M., Liles D.H., Sarkis J.. Justifying strategic alliances and partnering: a prerequisite for virtual enterprising. Omega, 1997, (1): 29-42
[151] Martinez M.T., Fouletier P.. Virtual enterprise: organization, evolution and control. International Journal of Production Economics, 2001, 74: 225-238
[152]王伟.基于Agent的虚拟企业合作伙伴选择方法.中国制造业信息化, 2003, 32(6): 77-80
[153]刘益,李垣,杜旖丁.关于战略联盟研究现状的分析与探讨.科学学研究, 2003, 21(12): 626-631
[154]叶永玲.虚拟经营战略.上海:上海三联书店, 2005, 165-167
[155]刘辉.产业集群与物流园区的互动发展研究.商品储运与养护, 2007, (2): 12-15
[156]何娟,朱健梅,曹洪.我国物流产业现状、约束因素和未来发展重点分析.中央财经大学学报, 2008, (8): 81-84
[157]焦文旗.对京津冀区域物流一体化障碍因素.商业时代, 2008, 35: 27-28
[158]康贻建.如何构建长三角地区物流一体化体系.商业时代, 2006, 24: 107-109
[159]梁溪.物流战略联盟向左?向右?.航运交易公报, http://info.jctrans.com/ zxzx/xwcj/2006927307523.shtml, 2006-09-27
[2]娄山佐.车辆路径问题的建模及优化算法研究: [西北工业大学博士学位论文].西安:西北工业大学, 2006, 33-43
[3]张建勇.模糊信息条件下车辆路径问题研究: [西南交通大学博士学位论文].成都:西南交通大学, 2004, 28-40
[4]李相勇.车辆路径问题模型及算法研究: [上海交通大学博士学位论文].上海:上海交通大学, 2007, 8-10
[5] Canen A. G. , Scott L. G. . Bridging theory and practice in VRP. Journal of the Operational Research Society, 1995, 46(1): 1-8
[6]祝崇隽,刘民,吴澄.供应链中车辆路径问题的研究进展及前景.计算机集成制造系统CIMS, 2001, 7(11): 1-6
[7]袁庆达,游斌.库存--运输联合优化问题简介.物流技术, 2001,(5): 9-10
[8]郭耀煌.安排城市卡车行车路线的一种新算法.系统工程学报, 1989, 4(2): 70-78
[9]汪寿阳,赵秋红,夏国平.集成物流管理系统中定位-运输路线安排问题的研究.管理科学学报, 2000, 3(2): 69-75
[10]谢秉磊,郭耀煌,郭强.动态车辆路径问题:现状与展望.系统工程理论方法应用, 2002, 11(2): 116-120
[11]刘志硕,申金升,关伟.车辆路径问题的混合蚁群算法设计与实现.管理科学学报, 2007, 10(3): 15-22
[12]姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究.系统工程理论与实践, 1999,(6): 40-45
[13]潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法.管理科学学报, 2007, 10(3): 23-29
[14]李军.车辆调度问题的分派启发式算法.系统工程理论与实践, 1999,(1): 27-33
[15]叶耀华,朱晓梅,陈霖.一种带时间窗口和在前约束的车辆路线问题及其算法.系统工程理论与实践, 2000, (3): 110-112
[16] Michel Gendreau. Invited Review for Stochastic Vehicle Routing. European Journal of Operations Research, 1996, 88: 3-12
[17] Gilbert Laporte. The Vehicle Routing Problem: An overview of exact andapproximate algorithms, European Journal of Operations Research, 1992,59: 345-358
[18] Gilbert Laporte. Model and exact solutions for a class of stochastic location-routing problems. European Journal of Operations Research, 1989, 39: 71-78
[19]刘兴.基于协作的车辆路径问题研究: [天津大学博士学位论文].天津:天津大学, 2006, 23-60
[20]于波,丁源.带模糊需求的多类型车辆路径问题研究.兰州交通大学学报(自然科学版), 2006, 25 (3): 137-140
[21]张建勇,李军.模糊车辆路径问题的一种混合遗传算法.管理工程学报, 2005, (2): 22-25
[22]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用, 2006, 26(11): 2639-2643
[23]张建勇,郭耀煌,李军.模糊需求信息条件下的车辆路径问题研究.系统工程学报, 2004, 19(1): 74-78
[24] Laporte G. , Mercure H. , Nobert Y. . An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks, 1986, 16: 33-46
[25] Christofides N. , Mingozzi A. , Toth P. . State space relaxation procedures for the computation of bounds to routing problems. Networks. practical analysis, 1981, (11): 145-164
[26] Balinsk M., Quandi R.. On an integer program for a delivery problem. Operations Research. 1964, (12): 300-304
[27] Laporte Ci. , 1vlercure H. , Nobert Y. . An branch-and-bound algorithm for a class of asymmetrical vehicle routing problem. Journal of the Operational Research Society, 1991
[28] Christofides N. , Mingozzi A. , Toth P. . Exact algorithm for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical programming. 1981, 20: 255-282
[29] Eilon S. , Watson-Gandy C. D. T. , Christofides N. . Distribution management: Mathematical modelling and practical analysis. London: Griffin, 1971
[30] Anily S. . The general mufti-retailer EOQ problem with vehicle routing costs. European Journal of Operational Research. 1994, 79: 451- 473
[31] Bodin L. D. , Golden B. L. Classification in vehicle routing and scheduling. Network, 1981, (11): 7-108
[32] Laporte G. . The Vehicle Routing Problem: An overview of exact andapproximate algorithms. European Journal of Operational Research. 1992, 59: 345-358
[33] Magnantj T. L. . Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Network. 1981, 11: 179-213
[34]谢秉磊.随机车辆问题研究: [西南交通大学博士学位论文].成都:西南交通大学, 2003, 6-26
[35] Taillard E. , Badeau P. . A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 1997, 31(2): 170-186
[36] Tan K. C. , Lee L. H. , Zhu Q. L. , Ou K. . Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, 2001, 15(3): 281-295
[37] Torki A. , Somhon S. , Enkawa T. . Competitive Neural Network algorithm for solving Vehicle Routing Problem. Computers & Industrial Engineering, 1997, 33: 473-476
[38] Bowerman R. L. , Calarnai P. H. , Hall G. B. . The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, European Journal of Operational Research, 1994, 76: 128-142
[39] Mosheiov G. . Vehicle routing with pick-up and delivery: Tour-partitioning heuristics. Computers & Industrial Engineering, 1998, 34(3): 669-684
[40] Kohld N. , Madsen O. B. G. . Optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research, 1997, 45(3): 395-406
[41] Toth P, Vigo D. . A heuristic algorithm for the symmetric and asymmetric routing problems with backhauls. European Journal of Operational Research, 1999, 113: 528-543
[42] Gillett B. , Miller L. . A heuristic algorithm for the vehicle dispatch problem. Operations Research Quarterly, 1976, 27: 367-384
[43] Renaud J. , Boctor F. , Laporte G. . An improved petal heuristic for the vehicle routing problem. Journal of Operational Research Society, 1996, 47: 329-336
[44] Potvin J. Y, Rousseau J. . A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 1993, 66: 331-340
[45] Clarke G. , Wright J. W. . Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 1964, 12: 568-581
[46] Solomon M. M. Algorithms for the vehicle routing and scheduling problem withtime windows constraints. Operations Research, 1987, 35: 254-265
[47] Salhi S. , Nagy G. . A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society, 1999, 50: 1034-1042
[48] Gendreau M. , Hertz A. , Laporte G. . The traveling salesman problem with backhauls. Computers & Operations Research, 1996, 23: 501-508
[49] Gendreau M. , Hertz A. , Laporte G. . A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research, 1998,43: 330-335
[50] Gendreau M. , Laporte G. , Vigo D. . Heuristic for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 1999, 26: 699-714
[51] Cordone R. , Calvo R. W. . A heuristic for the vehicle routing problem with time windows. Journal of Heuristics, 2001, 7(2): 107-129
[52] Lin S. . Computer solutions of the travelling salesman problem. Bell System Technical Journal, 1965, 44: 2245-2269
[53] Breedam A. V. . Improvement heuristic for the Vehicle Routing Problem based on Simulated Annealing. European Journal of Operational Research, 1995, 86: 480-490
[54] Teodorovic D. , Pavkovic G. . The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain. Fuzzy Set and Systems, 1996, 82: 307-317
[55] Perincherry V. , Kikuchi S. . A fuzzy approach to the transshipment problem. In: Ayyub, B.M. (Ed.), Proceedings of ISUMA '90, The First International Symposium on Uncertainty Modeling and Analysis. IEEE Computer Press, College Park, Maryland,1990, 330-335
[56] Kagaya S. , Kikuchi S. Donelly R. Use of fuzzy ralation for grouping of trip in vehicle routing and scheduling problem. European Journal of Operational Research, 1994, 76: 143-154
[57] Vukadinovic N, Teodorovic D. A fuzzy approach to the vessel dispatching problem. European Journal of Operational Research, 1994, 76: 155-164
[58] Teodorovic D. , Radivojevic G. A fuzzy logic approach to dynamic Dial-A-Ride problem. Fuzzy Set and Systems, 2000, 116: 23-33
[59]刘兴,贺国光,高文伟.一种有时间约束的多车辆协作路径模型及算法.系统工程, , 2005, 23 (4): 105-109
[60] Alan Laurence Erera, Design of Large-Scale Logistics Systems for Uncertain Environments [dissertation], California: University of colifornia, Berkeley, 2000
[61] Charnes A. , Cooper WW. . Chance-constrained programming. Management Science. 1959, 6(1): 73-79
[62] Liu B. , Iwamura K. . Modelling stochastic decision systems using dependent- chance programming. European Journal of Operational Research, 1997, 101(1): 193-203
[63]陈宝文,宋申民,陈兴林.模糊需求车辆路径问题及其启发式蚁群算法.计算机应用, 2006, 26 (11): 2639-2643
[64] B. Gillet, L. Miller. A heuristic algorithm for the vehicle dispatch problem Oper. Res. 1974,(22): 340-349
[65]萧蕴诗,李炳宇.小窗口蚁群算法.计算机工程, 2003, 29(20): 143-145
[66] ZHU Y, SHASHA D. Statstream: Statistical monitoring of thousands of data streams in real time. Proceedings of 28th International Conference on Very Large Data Bases, 2002, 358-369
[67] GAMBARDELLA LM, TAILLARD E, AGAZZI G. IDSIA-06-99, MACS-VRPTW: Vehicle Routing Problem with Time Windows, 1999
[68] TOMAS S, HOLDER HH. MAX-MIN ant system. Future Generation Computer Systems, 2000, 16(8): 889-914
[69] BULUT A, SINCH K, SWAT. Hierarchical stream summarization in large networks. IEEE International Conference on Data Engineering, 2003: 563-575
[70]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法.系统工程理论与实践, 2002, 22(3): 109-113
[71] C. F. Daganzo, A. L. Erera. On planning and design of logistics systems for uncertain environments. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin. 1999, 480: 3-21
[72] Dimitris J. Bertsimas. A Vehicle Routing Problem With Stochastic Demand. Operations Research, 1992, 40 (3): 574-585
[73] Jose Brandao, Richard Eglese. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research, 2008, 35: 1112-1126
[74] Ana Osvald, Lidija Zadnik Stirn. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. Journal of Food Engineering, 2008, 85: 285-295
[75] Burak Eksiglu, Sandra Duni Eksioglu, Pramod Jain. A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Computers & Industrial Engineering, 2008, 54: 1-11
[76] Lixing Yang, Yuan Feng. A bicriteria solid transportation problem with fixed charge under stochastic environment. Applied Mathematical Modelling, 2007, 31: 2668-2683
[77] Lixing Yang, Xiaoyu Ji, Ziyou Gao, Keping Li. Logistics distribution centers location problem and algorithm under fuzzy environment. Journal of Computational and Applied Mathematics, 2007, 208: 303-315
[78] Cheong Y M, Ong H L, Huang H C, Modeling the vehicle routing problem for a soft drink distribution company. Asia-Pacific Journal of Operational Research, 2002, 19: 17-34
[79] Beasley J E, Christofides N. Vehicle routing with a sparse feasibility graph. European Journal of Operational Research, 1997, 98(3): 499-511
[80] Golden B L, Wasil E A. Computerized vehicle routing in the soft drink industry. Operation Research, 1987, 35(1): 6-17
[81]曹二保,赖明勇,聂凯,刘长石.大规模物流配送车辆调度问题研究.湖南大学学报(自然科学版), 2007, 34(12): 89-92
[82]曲志伟,蔡临宁,李晨.大规模车辆配送/收集问题的求解框架.清华大学学报(自然科学版), 2004, 44(5) : 581-584
[83] Golden B L, Wasil E A, Kelly J P, Chao I-M. The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G, editors. Fleet management and logistic s. Boston, MA: Kluwer; 1998, 33-56
[84] Feiyue Lia, Bruce Goldenb, Edward Wasilc. Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research, 2005, 32: 1165-1179
[85]徐菡,张敏洪.大规模逆向物流网络非线性优化模型的研究.中国科学院研究生院学报, 2007, 24(6): 749-755
[86]张庆年.大规模外贸物流系统规划计算方法研究.武汉大学学报(社会科学版), 2001, 54(3): 319-324
[87]田青,郑力,齐二石,缪立新.大规模物流网络的组合遗传算法研究.工业工程与管理, 2006, (4): 46-49
[88]缪成,许维胜,吴启迪.大规模应急救援物资运输模型的构建与求解.系统工程, 2006,(11): 6-12
[89] Yves Caseau, Fran qois Laburthe.A fast heuristic forlarge routing problems.In Proceedings IFORS, l998
[90] Jacques Renaud, Fayez F. Boctor, A sweep-based algorithm for the. eetsize and mix vehicle routing problem, European Journal of Operational Research, 2002, 140: 618-628
[91] Gulay Barbarosoglu, Demet Ozgur, A tabu search algorithm for the vehicle routing problem, computers and operations research, 1999, 26: 255-270
[92]李志.区域物流产业构成及其基本特征.中国流通经济, 2008, (4): 15-17
[93]韩世莲.物流配送线路多目标优化方法研究: [东南大学博士学位论文].南京:东南大学, 2006, 81-99
[94] C. F. Daganzo, A. L. Erera, On planning and design of logistics systems for uncertain environments, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, 1999, 480: 3-21
[95]张海刚,吴燕翔,顾幸生,甘世红,刘雨青.基于改进免疫算法的带模糊需求车辆调度问题.重庆工学院学报(自然科学), 2008, 22(3): 87-91
[96]骆正山,王小完.基于模糊条件下车辆路径问题的研究.微电子学与计算机, 2005, 22(3): 181-184
[97]朱晓锋,蔡延光,李菲,莫善区,陈泽南.一类具有模糊需求运输调度问题的禁忌搜索算法.广东工业大学学报, 2008, 25(1): 15-19
[98]曹二保,赖明勇,张汉江.模糊需求车辆路径问题研究.系统工程, 2007, 25(1): 14-18
[99]姜昌华.遗传算法在物流系统优化中的应用研究: [华东师范大学博士学位论文].上海:华东师范大学, 2007, 11-22
[100] Dantzig G B, Ramser J H. The truck dispatching problem. Management Science, 1959, 6(1): 80-91
[101]张建勇,李军.具有模糊旅行时间的VRP的一种混合遗传算法.管理工程学报, 2006, 4: 13-17
[102]孙小年,陈幼林,杨东援.装卸一体化车辆路径问题的遗传算法研究.系统工程理论与实践, 2007,2: 149-152
[103]王凌.智能优化算法及其应用.北京:清华大学出版社, 2001, 18-27
[104]蔡延光,钱积新,孙优贤.多重运输调度问题基于双表的并行表搜索算法.系统工程理论与实践, 1998, 18(11): 20-26
[105]郎茂祥,胡思继.车辆路径问题的禁忌搜索算法研究.管理工程学报, 2004, (1): 81-84
[106]王永亮,袁振洲.多配送中心单向车辆调度问题的模型与禁忌搜索算法的研究.物流技术, 2008, 27(2): 41-45
[107]王雪莲,汪波,钟石泉.一类半开放式车辆路径问题及其禁忌算法研究.系统仿真学报, 2008,20(8): 1969-1973
[108] Jose Brandao. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 2004, 157: 552-564
[109] Jose Brandao. A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 2006,173: 540-555
[110] Fermín Alfredo Tang Montané, Roberto Diéguez Galvao. A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 2006,33: 595-619
[111] Nicola Bianchessi, Giovanni Righini. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research, 2007,34: 578-594
[112] dSPACE. Control Desk Experiment Guide, Release3. 2 &3. 3. Paderborn: dSPACE GmbH, 2001
[113]韩建枫,李敏强,寇纪淞.一种求解TSP问题的新型遗传编码及应用.天津大学学报, 2003,36(2): 225-229
[114] David H. Wolpert, William G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Inst. , Sante Fe, New Mexico, 1995. (http: //citeseer. ist. psu. edu/wolpert95no. html)
[115] Joerg Homberger, Hermann Gehring. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, European Journal of Operational Research, 2005,162: 220-238
[116]张涛,田文馨,张玥杰,刘士新.带车辆行程约束的VRPSPD问题的改进蚁群算法.系统工程理论与实践, 2008, (1): 132-141
[117] Wade A, Salhi S. An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls. Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, Netherlands, 2004, 699-719
[118] Reimann M, Doerner K, Hartl R F. Insertion based ants for vehicle routing problems with backhauls and timewindows//ANTS: 2002 Lecture Notes in Computer Sciences, 2002, 136-148
[119] Catay B, Gokce E. I. An ant colony system approach for the capacitated vehicle routing problem with simultaneous delivery and pick-up. Working Paper, Sabanci University, 2005
[120]李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究.管理工程学报, 2006, (4): 9-12
[121]马良,项培军.蚂蚁算法在组合优化中的应用.管理科学学报, 2001,4(2): 32-37
[122]张纪会,徐心和.一种新的进化算法-蚁群算法.系统工程理论与实践, 1999, 36(3): 84-87
[123]惠宁.产业集群的区域经济效应研究[西北大学博士学位论文].西北大学, 2006, 22-37
[124] Machiel Van Pijk, Ondor Nomalor. Technological Regimes and industrial Pyramics: the Evidence from Dutch Manufacturing. Industrial and Corporate change, 2000,9(2): 173-194
[125]吴晓波,耿帅.区域集群自稔性风险成因分析.经济地理, 2003,23: 726-730
[126]王缉慈.创新的空间-企业集群与区域发展.北京:北京大学出版社, 2001, 20-28
[127]刘友金.中小企业集群式创新.北京:中国经济出版社, 2004, 11-27
[128] Spinoza L M, Quandt C. An IT-based framework for knowledge management in networked organizations. E-Business and Virtual Enterprises, 2000, 371-380
[129]魏守华,石碧华.论企业集群的竞争优势.中国工业经济, 2002,(1): 59-65
[130]张平.基于资源视角的企业集群优势分析.中国软科学, 2004, (9): 95-98
[131]卢长利,周溪召.家具制造业物流一体化信息平台建设.物流技术, 2006, (12): 88-89
[132]美国供应链管理专业协会官方网站(http://www.cscmp.org/)的物流术语定义
[133]何明珂.物流系统论.北京:高等教育出版社, 2004: 69-70
[134]中国物流与采购联合会的官方网站(http://www.cflp.org.cn/)《物流术语》修订第三稿(征求意见稿)
[135]张圣忠.物流产业组织理论研究[长安大学博士学位论文]. 2006: 14-30
[136]迈克尔.波特.国家竞争优势.(李明轩,邱如美译),华厦出版社, 2002, 1-21
[137]迈克尔.波特.竞争论.(高登北,李明轩译),中信出版社, 2003, 1-18
[138]美国仓库物流协会(http://www.iwla.com/)的物流术语定义
[139]张聪群.产业集群互动机理研究[西北农业科技大学博士学位论文].西北农业科技大学, 2007, 17-26
[140]王述英,王青.试论物流产业的属性及其组成.学习与探索, 2006, (2): 228-231
[141]昝廷全.产业经济系统研究.北京:科学出版社, 2002, 79-80
[142]物流一体化-MBA智库百科(http://wiki.mbalib.com/wiki/物流一体化), 2009-04-21
[143]高映红,何沙,苏燕平.虚拟企业运作中的信任机制研究.价值工程, 2002, (5): 9-11
[144]贺盛瑜.物流联盟企业间伙伴信任机制的建立与维护.经济师, 2004, (7): 164-165
[145]冯蔚东,陈剑.虚拟企业中伙伴收益分配比例的确定.系统工程理论与实践, 2002, (4): 45-49
[146]陈菊红,汪应洛,孙林岩.虚拟企业收益分配问题博弈研究.运筹与管理, 2002, (1): 11-16
[147]孔文.基于现代物流下的物流产业分析及政策研究[东北财经大学博士学位论文].东北财经大学, 2007, 111-130
[148]陈国庆,管来智.从财税政策上扶持上海现代物流业的发展.上海商业, 2005, (6): 14-16
[149]汪鸣.物流管理、物流经济与物流产业.中国物流产业网-现代物流报, http://www.xd56b.com/
[150] Meade L.M., Liles D.H., Sarkis J.. Justifying strategic alliances and partnering: a prerequisite for virtual enterprising. Omega, 1997, (1): 29-42
[151] Martinez M.T., Fouletier P.. Virtual enterprise: organization, evolution and control. International Journal of Production Economics, 2001, 74: 225-238
[152]王伟.基于Agent的虚拟企业合作伙伴选择方法.中国制造业信息化, 2003, 32(6): 77-80
[153]刘益,李垣,杜旖丁.关于战略联盟研究现状的分析与探讨.科学学研究, 2003, 21(12): 626-631
[154]叶永玲.虚拟经营战略.上海:上海三联书店, 2005, 165-167
[155]刘辉.产业集群与物流园区的互动发展研究.商品储运与养护, 2007, (2): 12-15
[156]何娟,朱健梅,曹洪.我国物流产业现状、约束因素和未来发展重点分析.中央财经大学学报, 2008, (8): 81-84
[157]焦文旗.对京津冀区域物流一体化障碍因素.商业时代, 2008, 35: 27-28
[158]康贻建.如何构建长三角地区物流一体化体系.商业时代, 2006, 24: 107-109
[159]梁溪.物流战略联盟向左?向右?.航运交易公报, http://info.jctrans.com/ zxzx/xwcj/2006927307523.shtml, 2006-09-27