基于服务质量的物流保障网络路径规划研究
|
摘要
未来高技术战争中军用物资需求品种繁多、数量巨大、时间紧迫,为确保战争胜利,参战部队必须获得迅速及时、安全可靠、经济有效的物资保障服务,为此对物流保障系统提出了更高的服务质量要求。物流保障网络是服务于现代化战争,以基地、仓库等保障实体为依托,以各种运输保障通道为连接,以满足部队需求为目标,把各种保障资源按一定的要求和原则合理部署,在空间上成网络化布局的物流保障系统。
网络路径规划技术是当前研究的热点之一,军事领域的物流保障网络路径规划技术研究更引起军内外学者的广泛注意,在现有物流保障网络设施基础上,通过对物资运输路径进行规划,对提高我军物资保障能力,确保战争胜利具有关键作用。
本文在综述网络路径规划技术研究现状的基础上,重点研究了物流保障系统的定义及建模、物流保障网络及服务质量参数体系、关键网络资源调度策略、网络路径规划技术等内容,主要研究工作如下:
在分析物流保障系统组成结构、基本功能及影响要素的基础上,给出了物流保障网络的建模与分析方法、网络化模型以及明确物流保障网络路径规划技术的研究范围。
提出了建立物流保障网络服务质量参数体系基本原则。在研究分析计算机网络、通信网络、交通物流网络服务质量参数基础上,建立了物流保障网络层次模型,即网络拓扑层、网络传输层、网络应用层;提出了各个层次上的服务质量参数,包括任务完成率等若干新的参数,建立了物流保障网络服务质量参数体系。在分析保障物资分割运输属性的基础上,讨论了单任务网络路径规划问题。
根据物资流在网络上传输时完全不可分割、基于时间可分割、基于空间可分割三种属性,考虑用户对物资保障的规模性、时效性、安全性、经济性等服务质量要求,运用运筹学、图论、计算机仿真等理论和方法,分别建立基于不同传输性质的网络路径规划模型,设计相应的算法,求解满足网络拓扑属性约束和服务质量要求的网络路径规划方案。
针对多个保障任务可能同时发生的情形,研究了多任务网络路径规划问题。首先,根据不同保障任务对关键网络资源使用需求程度以及对整个保障网络系统效能的贡献度为基础,提出了一种基于综合度量的关键网络资源调度策略;其次,结合物资流在网络上的传输属性,提出了基于传输时间的独立路径问题;最后,给定任务集合,以任务完成率为优化目标,建立了多任务网络路径规划模型,利用多蚁群并行优化原理,设计了多任务网络路径规划的算法,并且针对每一个任务,搜索网络时空资源相互独立的优化路径,求解任务完成率最高的网络路径规划方案。
In the future high-tech local warfare, the variety of military material requirements is various, the amount is huge and the schedule is tight. To assure the victory of warfare, each unit of the force must be supported not only in time but also reliably and effectively, which requires the logistics support system to provide higher service quality. A logistics support network (LSN), which serves modern warfare, consists of support entities such as bases and warehouses and is connected by traffic networks. LSN disposes various support resources according to some rules and requirements and comes into being a network layout system.
Recently, network path planning is the research focus in the field of network application, especially military logistics support network. Based on existing LSN, optimization of path planning is of key significance to improve the support ability and assure the victory of warfare.
Based on summarizing the current progress on path planning techniques of LSN, this thesis studies the definition and modeling of LSN, the service quality parameters system, the key network resource scheduling and the path planning of LSN. The main results are as follows.
By systematically analyzing the structure, functions and factors affecting LSN, this thesis proposes a modeling and analysis method of LSN and defines the research bound of path planning of LSN.
Some basic principles for parameters system of service quality are presented. Based on the service quality of Internet, communication network and traffic network, a three-layers parameters system of service quality of LSN is proposed, i.e., the network topology layer, the network transportation layer and the network application layer. Some new indexes such as the mission performability are proposed.
The path planning problem with single task is studied considering materials partition attributes. Taking into account the quantity, time, reliability and cost et al, for indivisible transportation, partition-transportation by time and partition-transportation by space respectively, this thesis proposes path planning model, designs according algorithms and obtains satisfied schemes with network topology constrains and service quality constrains using methods of operational research, graph theory, computer simulation et al.
The path planning problem with multitasks is studied. Firstly, based on the grade for using the key network resources and the contribution for system efficiency, a key network resource scheduling strategy based on Combined Measurement is presented. Secondly, according to transportation attribute of material flow, an irrelated path problem based on transportation time and space is presented. Lastly, given a set of tasks, aiming at the mission performability, this thesis establishes a multitasks path planning model and designs an algorithm based on the principle of multi-ant colonies parallel optimization, which searches the irrelated path on time and space for each mission and obtains a set of path planning schemes with maximal mission performability.
网络路径规划技术是当前研究的热点之一,军事领域的物流保障网络路径规划技术研究更引起军内外学者的广泛注意,在现有物流保障网络设施基础上,通过对物资运输路径进行规划,对提高我军物资保障能力,确保战争胜利具有关键作用。
本文在综述网络路径规划技术研究现状的基础上,重点研究了物流保障系统的定义及建模、物流保障网络及服务质量参数体系、关键网络资源调度策略、网络路径规划技术等内容,主要研究工作如下:
在分析物流保障系统组成结构、基本功能及影响要素的基础上,给出了物流保障网络的建模与分析方法、网络化模型以及明确物流保障网络路径规划技术的研究范围。
提出了建立物流保障网络服务质量参数体系基本原则。在研究分析计算机网络、通信网络、交通物流网络服务质量参数基础上,建立了物流保障网络层次模型,即网络拓扑层、网络传输层、网络应用层;提出了各个层次上的服务质量参数,包括任务完成率等若干新的参数,建立了物流保障网络服务质量参数体系。在分析保障物资分割运输属性的基础上,讨论了单任务网络路径规划问题。
根据物资流在网络上传输时完全不可分割、基于时间可分割、基于空间可分割三种属性,考虑用户对物资保障的规模性、时效性、安全性、经济性等服务质量要求,运用运筹学、图论、计算机仿真等理论和方法,分别建立基于不同传输性质的网络路径规划模型,设计相应的算法,求解满足网络拓扑属性约束和服务质量要求的网络路径规划方案。
针对多个保障任务可能同时发生的情形,研究了多任务网络路径规划问题。首先,根据不同保障任务对关键网络资源使用需求程度以及对整个保障网络系统效能的贡献度为基础,提出了一种基于综合度量的关键网络资源调度策略;其次,结合物资流在网络上的传输属性,提出了基于传输时间的独立路径问题;最后,给定任务集合,以任务完成率为优化目标,建立了多任务网络路径规划模型,利用多蚁群并行优化原理,设计了多任务网络路径规划的算法,并且针对每一个任务,搜索网络时空资源相互独立的优化路径,求解任务完成率最高的网络路径规划方案。
In the future high-tech local warfare, the variety of military material requirements is various, the amount is huge and the schedule is tight. To assure the victory of warfare, each unit of the force must be supported not only in time but also reliably and effectively, which requires the logistics support system to provide higher service quality. A logistics support network (LSN), which serves modern warfare, consists of support entities such as bases and warehouses and is connected by traffic networks. LSN disposes various support resources according to some rules and requirements and comes into being a network layout system.
Recently, network path planning is the research focus in the field of network application, especially military logistics support network. Based on existing LSN, optimization of path planning is of key significance to improve the support ability and assure the victory of warfare.
Based on summarizing the current progress on path planning techniques of LSN, this thesis studies the definition and modeling of LSN, the service quality parameters system, the key network resource scheduling and the path planning of LSN. The main results are as follows.
By systematically analyzing the structure, functions and factors affecting LSN, this thesis proposes a modeling and analysis method of LSN and defines the research bound of path planning of LSN.
Some basic principles for parameters system of service quality are presented. Based on the service quality of Internet, communication network and traffic network, a three-layers parameters system of service quality of LSN is proposed, i.e., the network topology layer, the network transportation layer and the network application layer. Some new indexes such as the mission performability are proposed.
The path planning problem with single task is studied considering materials partition attributes. Taking into account the quantity, time, reliability and cost et al, for indivisible transportation, partition-transportation by time and partition-transportation by space respectively, this thesis proposes path planning model, designs according algorithms and obtains satisfied schemes with network topology constrains and service quality constrains using methods of operational research, graph theory, computer simulation et al.
The path planning problem with multitasks is studied. Firstly, based on the grade for using the key network resources and the contribution for system efficiency, a key network resource scheduling strategy based on Combined Measurement is presented. Secondly, according to transportation attribute of material flow, an irrelated path problem based on transportation time and space is presented. Lastly, given a set of tasks, aiming at the mission performability, this thesis establishes a multitasks path planning model and designs an algorithm based on the principle of multi-ant colonies parallel optimization, which searches the irrelated path on time and space for each mission and obtains a set of path planning schemes with maximal mission performability.
引文
[1]陈斌,海军.美军全球配送的物资品类和配送运输[J].国防交通工程与技术. 2008, 6(2): 8-10
[2]聂斌,陈鹏.美军联合作战公路运输控制[J].国防交通工程与技术. 2007, 5(4): 7-10
[3]王宗喜,高丽英.“美伊战争”中的军事物流及启示[J].中国物流与采购. 2003, (9): 34-35
[4]国家发展改革委交通运输司.我国综合交通网络布局规划研究[M].北京; 2005
[5]杨成忠.未来高技术战争对道路运输及保障的需求[J].国防交通工程与技术. 2004, 2(4): 10-11
[6] Ahuja R K. Network flows:theory,algorithms,and applications[J]. Prentice Hall 1993 (4): 510-542
[7]高悦勋.医院医疗服务质量综合评价[J].中国医院管理. 1985, 6(10)
[8]贺松林.浅谈树立全面服务质量观[J].商业经济论坛. 1989, (009): 19-20
[9] Gronroos. An applied service marketing theory[J]. European Journal of Marketing. 1982, 16(7): 30-41
[10] Oliver R L. When consumer loyalty? [J]. Journal of Marketing. 1999, 63(4): 33-44
[11]汪芸,顾冠群.网络服务质量(QoS)参数研究[J].计算机研究与发展. 1998, 35(6): 543-547
[12]郭之晓,胡捍英.第三代移动通信网的位置服务体系结构[J].通信技术. 2002, 5: 69-72
[13] Mentzer. Logistics service quality as a segment-customized process [J]. Journal of Marketing Science. 2001, 65(4): 82-104
[14]张品.网络中QoS路由问题的研究(D).西安:电子科技大学; 2004
[15]华蓓.基于IP网络的服务质量(QoS)参数研究[J].小型微型计算机系统. 2001, 22(9): 1130-1134
[16] Aurrecoechea C, Campbell A T, Hauw L. A survey of QoS architectures[J]. Multimedia systems. 1998, 6(3): 138-151.
[17] Nahrstedt K, Steinmetz R. Multimedia: Computing, Communications and Applications: Prentice Hall, Inc,1995,5: 599-608
[18] Barberis G, Mazzei U. Traffic-based criteria for reliability and availability analysis of computer networks. 977.133-138
[19] Lee S H. Reliability evaluation of a flow network[J]. IEEE Transactions on Reliability. 1980, 29(1): 24-26
[20] Bonaventura V, Cacopardi S. Service Availability of Communication Networks. National Telecommunication Conference, 1980,1,876-899
[21] Perrault W D, Russ F. Physical distribution service: a neglected aspect of marketing management[J]. MSU Business Topics. 1974, 22(3): 37-45
[22] Woodside A , Frey L , Daly R T. Linking service quality, customer satisfaction, and behavioral intention[J]. Health Care Mark. 1989, 9(4): 5-17
[23] Mentzer J T, Gomes R, Krapfel R. Physical distribution service: A fundamental marketing concept[J]. Journal of the Academy of Marketing Science. 1989, 17(1): 53-62
[24] Bienstock C C, Mentzer J T, Bird M M. Measuring physical distribution service quality[J]. Journal of the Academy of Marketing Science. 1997, 25(1): 31-44
[25] Watson A, Sasse M A.. Measuring perceived quality of speech and video in multimedia conferencing applications. Proceedings of ACM Multimedia . Bristol.1998, 55-60
[26] Mentzer J T, Myers M B, Cheung M S. Global market segmentation for logistics services[J]. Industrial Marketing Management. 2004, 33(1): 15-20
[27]乜标.建立我国合理的物流系统结构[J].商业经济与管理. 1990, (003): 63-65
[28]金真.全方位物流服务与物流服务质量体系[J].商品储运与养护. 2000, (3): 15-17
[29]张光明,周荛阳.基于供应链的物流服务质量研究[J].第三届中国物流学术年会. 2005.
[30]刘明菲,龚韵枝,杨勋.基于顾客价值的物流服务质量体系研究[J].武汉理工大学学报. 2006, 28(012): 112-115
[31]张长根,郑金忠.物流服务质量评估的指标体系研究[J].管理现代化. 2002, 3: 13-16
[32]郑兵,董大海,金玉芳.国外物流服务质量研究述评[J].管理学报. 2007, 4(3): 373-378
[33]张蕾丽.试论物流系统的网络模式[J].华中理工大学学报. 1989, 17(4): 145-148
[34] Yi C, Ju S. Service Reliability Analysis on Logistics Network. International Conference on Service. 2006, 57-61.
[35] Ballou R H. Logistics Network Design: Modeling and Informational Considerations[J]. International journal of logistics management. 1995, 6: 39-54
[36] Brand J D, Meyer W L, Shaffer L R. The Resource Scheduling Method for Construction[J]. Civil Engineering Studies Report. 1964, 5
[37] Davis E W. Project Network Summary Measures Constrained-Resource Scheduling[J]. IIE Transactions. 1975, 7(2): 132-142
[38] Wong W K. Packet Scheduling in Wireless Systems by Token Bank Fair Queueing Algorithm. Library and Archives Canada. 2006.
[39] Ramanathan P, Agrawal P. Adapting packet fair queueing algorithms to wireless networks. ACM New York, NY, USA.1998,1-9.
[40] Choy M T, Lee T T. Huffman Fair Queueing: A Scheduling Algorithm Providing Smooth Output Traffic. International Conference Communications. 2006, 2: 796-799
[41] Khoury R, Azouzi R. Modeling the Effect of Forwarding in a Multi-hop Ad Hoc Networks with Weighted Fair Queueing[J]. Lecture notes in computer science. 2007, 5: 48-64
[42] Hosaagrahara M, Sethu H. Max-Min Fair Scheduling in Input-Queued Switches[J]. transactions on parallel and distributed systems. 2008, 19(4): 462.
[43] Liu Y E. Deadline based Network Resource Management[D]. Department of Computer Science, University of Waterloo, June 2003
[44] Becchetti L, Leonardi S, Marchetti-Spaccamela A et al. Online weighted flow time and deadline scheduling[J]. Journal of Discrete Algorithms. 2006, 4(3): 339-352
[45]王大震,王淑静,宋瀚涛等.成本/时间综合优化网络资源调度策略及价格算法[J].北京理工大学学报. 2004, 24(7): 617-621
[46]杨祥,茂谭曦.基于网络资源消费者模型的调度策略[J].计算机科学. 2003, 30(9): 105-106.
[47] Bellman R E. On a routing problem[M]. Princeton University Press.1958.
[48] Dantzig G B.. On the shortest route through a network[J]. Management Science. 1960, 6: 187-190.
[49] Dijkstra E W. A Note on Two Problems in Connection with Graphs[J]. Number Mathematics. 1959, 1: 269-271.
[50] Floyd R W. Algorithm Shortest path[J]. Comm.ACM. 1962, 5: 345.
[51] Yucaoglu E. Solution Algorithms for Resource and Route Constrained Shortest Path Problems in Time Dependent Transportation Networks[M]. Dept. of Industrial Engineering.1973.
[52] Ribeiro C C, Minoux M. A Heuristic Approach to Hard Constrained Shortest Path Problems[J]. Discrete Applied Mathematics. 1985, 10(2): 125-137
[53] Warburton A. Approximation of Pareto Optima in Multi-objective, shortest-path problems[J]. Operations Research. 1987, 35(1): 70-79
[54] Gallo G, Pallottino S. Shortest Path Algorithms[J]. Annals of Operations Research. 1988, 13(1): 1-79.
[55] Chen Y. On the Quickest Path Problem[J]. Inform. Processing Lett. 1993, 46: 125–128
[56] Carotenuto P, Giordani S, Ricciardelli S et al. A Tabu Search Approach for Scheduling Hazmat Shipments[J]. Computers and Operations Research. 2007, 34(5): 1328-1350.
[57] Carotenuto P, Giordani S, Ricciardelli S. Finding minimum and equitable risk routes for hazmat shipments[J]. Computers and Operations Research. 2007, 34(5): 1304-1327.
[58] Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerische Mathematik. 1959, 1(1): 269-271.
[59] Modesti P, Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks[J]. European Journal of Operational Research. 1998, 111(3): 495-508
[60] Aneja Y P, Nair K P K. The constrained shortest path problem[J]. Naval Research Logistics Quarterly. 1978, 25: 549–555
[61] Puri A, Tripakis S. Algorithms for the Multi-constrained Routing Problem[J]. Lecture notes in computer scince. 2002: 338-347
[62] Cheng G, Ansari N. On selecting the cost function for source routing[J]. Computer Communications. 2006, 29(17): 3602-3608
[63]武振业,宋天生,赵柯.海运集装箱运输路径选择[J].西南交通大学学报. 2006, 41(3): 269-272
[64]王斌,唐国春.航运集装箱运输路径选择优化研究[J].交通运输系统工程与信息. 2008, 8(3): 90-95
[65] Leon Garcia A, Choi J K. QoS control in next-generation networks[J]. Communications Magazine. 2007, 45(9): 114-117
[66]郑彦兴.因特网QoS路由算法研究[D].长沙:国防科学技术大学; 2005.
[67] Kuipers F, Van Mieghem P, Korkmaz T et al. An overview of constraint-based path selection algorithms for QoS routing[J]. Communications Magazine. 2002, 40(12): 50-55
[68] Xiao W, Luo Y, Song B H. An efficient heuristic algorithm for multi-constrained path problems. Vehicular Technology Conference, 2002: 1317-1321
[69] Yong Cui, Wu, K. Multi-Constrained End-to-End Admission Control in Core-Stateless Networks, Procedings of 2004 International Conference on Information Networking .2004
[70] Stewart B S, White C C. Three Solution Procedures for Multiobjective Path Problems[J]. Control-Theory and Advanced Technology. 1989, 5(4): 443-470
[71] Tarapata Z. Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms[J]. International Journal of Applied Mathematics and Computer Science. 2007, 17(2): 269-287
[72]郭波,张凤林,范英飚等.多源单汇网络资源调度路径优化探讨[J].数学的实践与认识. 2005, 35(3): 89-98
[73]王华,孟祥旭,马军.基于路径的多源多汇最大流问题研究[J].计算机工程与应用. 2005, 41(28): 117-120
[74] Yi W, Ozdamar L. A dynamic logistics coordination model for evacuation and support in disaster response activities[J]. European Journal of Operational Research. 2007, 179(3): 1177-1193
[75] Assad A, Multicommodity Network Flows: A Survey: Massachusetts Institute of Technology, Industrial Liaison Program,1975.
[76] Trip J J, Bontekoning Y. (2002). Integration of small freight flows in the intermodal transport system[J]. Journal of Transport Geography, 2003,10(3): 221-229
[77] Macharis C, and Bontekoning Y M. Opportunities for OR in intermodal freighttransport research: A review[J]. European Journal of Operational Research 2004,153:400-416
[78] James H, and Neil S.Intermodal Routing of Canada-Mexico Shipments under NAFTA[J]. Logistics and Transportation Review. 1998,34(4): 289-303
[79] Chang T S. Best routes selection in international intermodal networks[J]. Computers & Operations Research. 2004: 158-166.
[80] Ford L R, Fulkerson D R. Network flow[M]: Princeton University Press. 1962
[81] Hoppe B E. Efficient dynamic network flow algorithms[M]: Cornell University; 1995
[82] Chabini I, Zeid M A. The minimum cost flow problem in capacitated dynamic networks. Submitted to the TRB 82nd Annual Meeting, Washington D C. 2003.
[83] Chabini I, Zeid M A. The Minimum travel time Flow Problem in Capacitated Dynamic Networks[J]. 2003
[84] Lozovanu D. Optimal Dynamic Multicommodity Flows in Networks[D]. Electronic Note in Discrete Mathematics. Academy of science of Moldova. 2006
[85] Meyers P. Network Flow Problems and Congestion Games: Complexity and Approximation Results[D]. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center.2006
[86] Flerscher L. Quickest Flows Over Time[J]. SLAM Journal on computing. 2001, 36(8): 1600-1630
[87] Aronson J E. A survey of dynamic network flows[J]. Annals of Operations Research. 1989, 20(1): 1-66
[88]董振宁,刘家壮.无容量限制的最小费用流问题[J].数学研究与评论. 2004, 24(4): 751-757
[89]陈智博.有预算限制的最大多物资流问题[J].数学的实践与认识. 2006, 36(12):23-26
[90] Bertalanffy L. General system theory: Foundations, development, applications[M]. George Braziller.1968
[91]贝塔朗菲,林康义,魏宏森.一般系统论[M].北京:社会科学文献出版社, 1987
[92]钱学森,王海云.系统思想和系统工程[M].湖南长沙:科学技术出版社, 1980
[93]李作敏.交通工程学[M].北京:人民交通出版社, 2000
[94]铁道部.铁路线路设计规范[S].北京:中国计划出版社,1999
[95]胡思继.交通运输学[M].北京:人民交通出版社,2004
[96]民航总局.民用机场飞行区技术标准[S].北京, 2000
[97]李宁,皱彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践. 2004, 4: 25-30
[98]刘阳,高军.应急作战装备物资供应链研究[J].军械工程学院学报. 2005, (4): 45-48
[99]钟先文.构建具有我军特色的军事采购保障体系[J].中国物流与采购. 2004, (24): 60-62
[100]陈兆仁,鲍平鑫.军事运输学[M].北京:解放军出版社,2001.
[101]陈春妹,任福田.路网容量研究综述[J].公路交通科技. 2002, 19(3): 97-101.
[102]翁朝曦,周源泉.可靠性增长[M].北京:科学出版社, 1992.
[103]杨为民.可靠性维修性保障性总论[M].北京:国防工业出版社,2004
[104]江光杰,李德毅.通信网络的可靠性评估[J].通信学报. 1997, 18(8): 85-89
[105]张建勇,郭耀煌.一种多式联运网络的最优分配模式研究[J].铁道学报. 2002, 24(004): 114-116.
[106] Cohen H, Southworth F. On the Measurement and Valuation of Travel Time Variability Due to Incidents on Freeways[J]. Journal of Transportation and Statistics. 1999, 2(2): 23-132
[107] Noland R B, Polak J W. Travel time variability: a review of theoretical and empirical issues[J]. Transport Reviews. 2002, 22(1): 39-54
[108] Grove, S., Fisk, R., John, J. The future of services marketing: forecasts from ten services experts. Journal of Services Marketing. 2003,17( 2): 107-121
[109] Stephen W, Brown E G, Edvardsson B. Service Quality: Multidisciplinary and Multinational Perspectives. Lexington, 1991.
[110]户田岩.网络服务质量技术.北京:科学出版社,2003.
[111]刘韵洁,张云勇,张智江.下一代网络服务质量技术[M].电子工业出版社, 2005.
[112]熊志华.道路网行程时间可靠性基础理论与方法研究[D].北京:北京交通大学, 2006.
[113]许国志.系统科学[M].上海:上海科技教育出版社; 2000
[114]戴汝为.系统科学及系统复杂性研究[J].系统仿真学报. 2002, 14(011): 1411-1416
[115]陈春妹.路网容量研究[D].北京:北京工业大学, 2002.
[116] Best routes selection in international intermodal networks .Computers& Operations Research,In Press,Corrected Proof.2007
[117]李晓濛,刘增基,赵斌.基于测量的QoS参数估计及其应用[J].软件学报. 2002, 13(7).
[118] Colorni A, Maniezzo V, et al. Distributed optimization by ant colonies. In: Proceeding or the 1st European Conference on Artificial Life.1991:134-142.
[119] Gutjahr W J. A graph-based ant system and its convergence[J]. Future Generation System. 2000, (16): 873-888
[120] Stutzle T, Dorigo M. A short convergence proof for a class of ant colony optimizationalgorithms[J]. Transactions on evolutionary computation. 2002, 6(4): 358-365
[121] Wang G, Gong W R, DeRenzi B et al. Ant colony optimizations for resource- and timing-constrained operation scheduling[J]. Transactions on Computer Aided Design of Integrated Circuits and Systems. 2007, 26(6): 1010-1029
[122]段海滨.蚁群算法原理及其应用.北京:科学出版社, 2005
[123]张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报. 2004, 17(001): 79-81.
[124]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报. 2004, 19(6): 596-600.
[125]梁艳春,冯大鹏.遗传算法求解旅行商问题时的基因片段保序[J].系统工程理论与实践. 2000, 20(4): 7-12
[126]姜大立,杜文.车辆路径问题的遗传算法研究[J].系统工程理论与实践. 1999, 19(6): 40-45
[127]郎茂祥.基于遗传算法的物流配送路径优化问题研究[J].中国公路学报. 2002, 15(3): 76-79
[128]柳林,朱建荣.基于遗传算法的物流配送路径优化问题的研究[J].计算机工程与应用. 2005, 41(27): 227-229
[129]马炫.求解k条最优路径问题的遗传算法[J].计算机工程与应用. 2006, 42(12): 100-101
[130]刘伟,刘景泉.资源约束下的时间-费用交换问题研究[J].系统工程理论与实践. 2002, 22(9): 42-46.
[131]杨耀红,张俊华.模式约束和资源约束下的多模式时间-费用交换问题研究[J].华北水利水电学院学报. 2006, 27(1): 35-38.
[132]韩凯,王京春.实时数据库调度策略综述[J].计算机工程与应用. 2004, 40(32): 172-176
[133] Tower B, Kondo D, Mysore M et al. Resource Scheduling in Real-Time Systems: A Survey[J]. 1999
[134] Bonvicini S S. A hazmat multi-commodity routing model satisfying risk criteria: A case study[J]. Journal of Loss Prevention in the Process Industries. 2007:233-239
[135]路易斯.马尚.一个广义的概念-城市的时间和空间消耗.天津:交通综合研究组, 1986.
[136]张凤林,郭波,刘卫华等.有限需求量的网络路径优选研究[J].系统工程. 2004, 22(11): 106-110
[137]谭龙亮.无线分组网络中公平排队算法[J].哈尔滨商业大学学报. 2004, 20(2):134-139
[138]于滨,杨忠振,程春田.并行蚁群算法在公交线网优化中应用[J].大连理工大学学报. 2007, 47(2): 211-214
[139]段海滨,丁全心,常俊杰等.基于并行蚁群优化的多UCAV任务分配仿真平台[J].航空学报. 2008, 29(5): 192-197
[140]王厚卿,张兴业.战役学[M].北京:解放军出版社,2000.
[141]吴树照.海军战役学[M].北京:海军出版社, 2001.
[142]张凤林,武小悦,郭波等.物流网络可用性研究[J].系统工程理论方法应用. 2003, 12(1): 77-80
[2]聂斌,陈鹏.美军联合作战公路运输控制[J].国防交通工程与技术. 2007, 5(4): 7-10
[3]王宗喜,高丽英.“美伊战争”中的军事物流及启示[J].中国物流与采购. 2003, (9): 34-35
[4]国家发展改革委交通运输司.我国综合交通网络布局规划研究[M].北京; 2005
[5]杨成忠.未来高技术战争对道路运输及保障的需求[J].国防交通工程与技术. 2004, 2(4): 10-11
[6] Ahuja R K. Network flows:theory,algorithms,and applications[J]. Prentice Hall 1993 (4): 510-542
[7]高悦勋.医院医疗服务质量综合评价[J].中国医院管理. 1985, 6(10)
[8]贺松林.浅谈树立全面服务质量观[J].商业经济论坛. 1989, (009): 19-20
[9] Gronroos. An applied service marketing theory[J]. European Journal of Marketing. 1982, 16(7): 30-41
[10] Oliver R L. When consumer loyalty? [J]. Journal of Marketing. 1999, 63(4): 33-44
[11]汪芸,顾冠群.网络服务质量(QoS)参数研究[J].计算机研究与发展. 1998, 35(6): 543-547
[12]郭之晓,胡捍英.第三代移动通信网的位置服务体系结构[J].通信技术. 2002, 5: 69-72
[13] Mentzer. Logistics service quality as a segment-customized process [J]. Journal of Marketing Science. 2001, 65(4): 82-104
[14]张品.网络中QoS路由问题的研究(D).西安:电子科技大学; 2004
[15]华蓓.基于IP网络的服务质量(QoS)参数研究[J].小型微型计算机系统. 2001, 22(9): 1130-1134
[16] Aurrecoechea C, Campbell A T, Hauw L. A survey of QoS architectures[J]. Multimedia systems. 1998, 6(3): 138-151.
[17] Nahrstedt K, Steinmetz R. Multimedia: Computing, Communications and Applications: Prentice Hall, Inc,1995,5: 599-608
[18] Barberis G, Mazzei U. Traffic-based criteria for reliability and availability analysis of computer networks. 977.133-138
[19] Lee S H. Reliability evaluation of a flow network[J]. IEEE Transactions on Reliability. 1980, 29(1): 24-26
[20] Bonaventura V, Cacopardi S. Service Availability of Communication Networks. National Telecommunication Conference, 1980,1,876-899
[21] Perrault W D, Russ F. Physical distribution service: a neglected aspect of marketing management[J]. MSU Business Topics. 1974, 22(3): 37-45
[22] Woodside A , Frey L , Daly R T. Linking service quality, customer satisfaction, and behavioral intention[J]. Health Care Mark. 1989, 9(4): 5-17
[23] Mentzer J T, Gomes R, Krapfel R. Physical distribution service: A fundamental marketing concept[J]. Journal of the Academy of Marketing Science. 1989, 17(1): 53-62
[24] Bienstock C C, Mentzer J T, Bird M M. Measuring physical distribution service quality[J]. Journal of the Academy of Marketing Science. 1997, 25(1): 31-44
[25] Watson A, Sasse M A.. Measuring perceived quality of speech and video in multimedia conferencing applications. Proceedings of ACM Multimedia . Bristol.1998, 55-60
[26] Mentzer J T, Myers M B, Cheung M S. Global market segmentation for logistics services[J]. Industrial Marketing Management. 2004, 33(1): 15-20
[27]乜标.建立我国合理的物流系统结构[J].商业经济与管理. 1990, (003): 63-65
[28]金真.全方位物流服务与物流服务质量体系[J].商品储运与养护. 2000, (3): 15-17
[29]张光明,周荛阳.基于供应链的物流服务质量研究[J].第三届中国物流学术年会. 2005.
[30]刘明菲,龚韵枝,杨勋.基于顾客价值的物流服务质量体系研究[J].武汉理工大学学报. 2006, 28(012): 112-115
[31]张长根,郑金忠.物流服务质量评估的指标体系研究[J].管理现代化. 2002, 3: 13-16
[32]郑兵,董大海,金玉芳.国外物流服务质量研究述评[J].管理学报. 2007, 4(3): 373-378
[33]张蕾丽.试论物流系统的网络模式[J].华中理工大学学报. 1989, 17(4): 145-148
[34] Yi C, Ju S. Service Reliability Analysis on Logistics Network. International Conference on Service. 2006, 57-61.
[35] Ballou R H. Logistics Network Design: Modeling and Informational Considerations[J]. International journal of logistics management. 1995, 6: 39-54
[36] Brand J D, Meyer W L, Shaffer L R. The Resource Scheduling Method for Construction[J]. Civil Engineering Studies Report. 1964, 5
[37] Davis E W. Project Network Summary Measures Constrained-Resource Scheduling[J]. IIE Transactions. 1975, 7(2): 132-142
[38] Wong W K. Packet Scheduling in Wireless Systems by Token Bank Fair Queueing Algorithm. Library and Archives Canada. 2006.
[39] Ramanathan P, Agrawal P. Adapting packet fair queueing algorithms to wireless networks. ACM New York, NY, USA.1998,1-9.
[40] Choy M T, Lee T T. Huffman Fair Queueing: A Scheduling Algorithm Providing Smooth Output Traffic. International Conference Communications. 2006, 2: 796-799
[41] Khoury R, Azouzi R. Modeling the Effect of Forwarding in a Multi-hop Ad Hoc Networks with Weighted Fair Queueing[J]. Lecture notes in computer science. 2007, 5: 48-64
[42] Hosaagrahara M, Sethu H. Max-Min Fair Scheduling in Input-Queued Switches[J]. transactions on parallel and distributed systems. 2008, 19(4): 462.
[43] Liu Y E. Deadline based Network Resource Management[D]. Department of Computer Science, University of Waterloo, June 2003
[44] Becchetti L, Leonardi S, Marchetti-Spaccamela A et al. Online weighted flow time and deadline scheduling[J]. Journal of Discrete Algorithms. 2006, 4(3): 339-352
[45]王大震,王淑静,宋瀚涛等.成本/时间综合优化网络资源调度策略及价格算法[J].北京理工大学学报. 2004, 24(7): 617-621
[46]杨祥,茂谭曦.基于网络资源消费者模型的调度策略[J].计算机科学. 2003, 30(9): 105-106.
[47] Bellman R E. On a routing problem[M]. Princeton University Press.1958.
[48] Dantzig G B.. On the shortest route through a network[J]. Management Science. 1960, 6: 187-190.
[49] Dijkstra E W. A Note on Two Problems in Connection with Graphs[J]. Number Mathematics. 1959, 1: 269-271.
[50] Floyd R W. Algorithm Shortest path[J]. Comm.ACM. 1962, 5: 345.
[51] Yucaoglu E. Solution Algorithms for Resource and Route Constrained Shortest Path Problems in Time Dependent Transportation Networks[M]. Dept. of Industrial Engineering.1973.
[52] Ribeiro C C, Minoux M. A Heuristic Approach to Hard Constrained Shortest Path Problems[J]. Discrete Applied Mathematics. 1985, 10(2): 125-137
[53] Warburton A. Approximation of Pareto Optima in Multi-objective, shortest-path problems[J]. Operations Research. 1987, 35(1): 70-79
[54] Gallo G, Pallottino S. Shortest Path Algorithms[J]. Annals of Operations Research. 1988, 13(1): 1-79.
[55] Chen Y. On the Quickest Path Problem[J]. Inform. Processing Lett. 1993, 46: 125–128
[56] Carotenuto P, Giordani S, Ricciardelli S et al. A Tabu Search Approach for Scheduling Hazmat Shipments[J]. Computers and Operations Research. 2007, 34(5): 1328-1350.
[57] Carotenuto P, Giordani S, Ricciardelli S. Finding minimum and equitable risk routes for hazmat shipments[J]. Computers and Operations Research. 2007, 34(5): 1304-1327.
[58] Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerische Mathematik. 1959, 1(1): 269-271.
[59] Modesti P, Sciomachen A. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks[J]. European Journal of Operational Research. 1998, 111(3): 495-508
[60] Aneja Y P, Nair K P K. The constrained shortest path problem[J]. Naval Research Logistics Quarterly. 1978, 25: 549–555
[61] Puri A, Tripakis S. Algorithms for the Multi-constrained Routing Problem[J]. Lecture notes in computer scince. 2002: 338-347
[62] Cheng G, Ansari N. On selecting the cost function for source routing[J]. Computer Communications. 2006, 29(17): 3602-3608
[63]武振业,宋天生,赵柯.海运集装箱运输路径选择[J].西南交通大学学报. 2006, 41(3): 269-272
[64]王斌,唐国春.航运集装箱运输路径选择优化研究[J].交通运输系统工程与信息. 2008, 8(3): 90-95
[65] Leon Garcia A, Choi J K. QoS control in next-generation networks[J]. Communications Magazine. 2007, 45(9): 114-117
[66]郑彦兴.因特网QoS路由算法研究[D].长沙:国防科学技术大学; 2005.
[67] Kuipers F, Van Mieghem P, Korkmaz T et al. An overview of constraint-based path selection algorithms for QoS routing[J]. Communications Magazine. 2002, 40(12): 50-55
[68] Xiao W, Luo Y, Song B H. An efficient heuristic algorithm for multi-constrained path problems. Vehicular Technology Conference, 2002: 1317-1321
[69] Yong Cui, Wu, K. Multi-Constrained End-to-End Admission Control in Core-Stateless Networks, Procedings of 2004 International Conference on Information Networking .2004
[70] Stewart B S, White C C. Three Solution Procedures for Multiobjective Path Problems[J]. Control-Theory and Advanced Technology. 1989, 5(4): 443-470
[71] Tarapata Z. Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms[J]. International Journal of Applied Mathematics and Computer Science. 2007, 17(2): 269-287
[72]郭波,张凤林,范英飚等.多源单汇网络资源调度路径优化探讨[J].数学的实践与认识. 2005, 35(3): 89-98
[73]王华,孟祥旭,马军.基于路径的多源多汇最大流问题研究[J].计算机工程与应用. 2005, 41(28): 117-120
[74] Yi W, Ozdamar L. A dynamic logistics coordination model for evacuation and support in disaster response activities[J]. European Journal of Operational Research. 2007, 179(3): 1177-1193
[75] Assad A, Multicommodity Network Flows: A Survey: Massachusetts Institute of Technology, Industrial Liaison Program,1975.
[76] Trip J J, Bontekoning Y. (2002). Integration of small freight flows in the intermodal transport system[J]. Journal of Transport Geography, 2003,10(3): 221-229
[77] Macharis C, and Bontekoning Y M. Opportunities for OR in intermodal freighttransport research: A review[J]. European Journal of Operational Research 2004,153:400-416
[78] James H, and Neil S.Intermodal Routing of Canada-Mexico Shipments under NAFTA[J]. Logistics and Transportation Review. 1998,34(4): 289-303
[79] Chang T S. Best routes selection in international intermodal networks[J]. Computers & Operations Research. 2004: 158-166.
[80] Ford L R, Fulkerson D R. Network flow[M]: Princeton University Press. 1962
[81] Hoppe B E. Efficient dynamic network flow algorithms[M]: Cornell University; 1995
[82] Chabini I, Zeid M A. The minimum cost flow problem in capacitated dynamic networks. Submitted to the TRB 82nd Annual Meeting, Washington D C. 2003.
[83] Chabini I, Zeid M A. The Minimum travel time Flow Problem in Capacitated Dynamic Networks[J]. 2003
[84] Lozovanu D. Optimal Dynamic Multicommodity Flows in Networks[D]. Electronic Note in Discrete Mathematics. Academy of science of Moldova. 2006
[85] Meyers P. Network Flow Problems and Congestion Games: Complexity and Approximation Results[D]. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center.2006
[86] Flerscher L. Quickest Flows Over Time[J]. SLAM Journal on computing. 2001, 36(8): 1600-1630
[87] Aronson J E. A survey of dynamic network flows[J]. Annals of Operations Research. 1989, 20(1): 1-66
[88]董振宁,刘家壮.无容量限制的最小费用流问题[J].数学研究与评论. 2004, 24(4): 751-757
[89]陈智博.有预算限制的最大多物资流问题[J].数学的实践与认识. 2006, 36(12):23-26
[90] Bertalanffy L. General system theory: Foundations, development, applications[M]. George Braziller.1968
[91]贝塔朗菲,林康义,魏宏森.一般系统论[M].北京:社会科学文献出版社, 1987
[92]钱学森,王海云.系统思想和系统工程[M].湖南长沙:科学技术出版社, 1980
[93]李作敏.交通工程学[M].北京:人民交通出版社, 2000
[94]铁道部.铁路线路设计规范[S].北京:中国计划出版社,1999
[95]胡思继.交通运输学[M].北京:人民交通出版社,2004
[96]民航总局.民用机场飞行区技术标准[S].北京, 2000
[97]李宁,皱彤,孙德宝.带时间窗车辆路径问题的粒子群算法[J].系统工程理论与实践. 2004, 4: 25-30
[98]刘阳,高军.应急作战装备物资供应链研究[J].军械工程学院学报. 2005, (4): 45-48
[99]钟先文.构建具有我军特色的军事采购保障体系[J].中国物流与采购. 2004, (24): 60-62
[100]陈兆仁,鲍平鑫.军事运输学[M].北京:解放军出版社,2001.
[101]陈春妹,任福田.路网容量研究综述[J].公路交通科技. 2002, 19(3): 97-101.
[102]翁朝曦,周源泉.可靠性增长[M].北京:科学出版社, 1992.
[103]杨为民.可靠性维修性保障性总论[M].北京:国防工业出版社,2004
[104]江光杰,李德毅.通信网络的可靠性评估[J].通信学报. 1997, 18(8): 85-89
[105]张建勇,郭耀煌.一种多式联运网络的最优分配模式研究[J].铁道学报. 2002, 24(004): 114-116.
[106] Cohen H, Southworth F. On the Measurement and Valuation of Travel Time Variability Due to Incidents on Freeways[J]. Journal of Transportation and Statistics. 1999, 2(2): 23-132
[107] Noland R B, Polak J W. Travel time variability: a review of theoretical and empirical issues[J]. Transport Reviews. 2002, 22(1): 39-54
[108] Grove, S., Fisk, R., John, J. The future of services marketing: forecasts from ten services experts. Journal of Services Marketing. 2003,17( 2): 107-121
[109] Stephen W, Brown E G, Edvardsson B. Service Quality: Multidisciplinary and Multinational Perspectives. Lexington, 1991.
[110]户田岩.网络服务质量技术.北京:科学出版社,2003.
[111]刘韵洁,张云勇,张智江.下一代网络服务质量技术[M].电子工业出版社, 2005.
[112]熊志华.道路网行程时间可靠性基础理论与方法研究[D].北京:北京交通大学, 2006.
[113]许国志.系统科学[M].上海:上海科技教育出版社; 2000
[114]戴汝为.系统科学及系统复杂性研究[J].系统仿真学报. 2002, 14(011): 1411-1416
[115]陈春妹.路网容量研究[D].北京:北京工业大学, 2002.
[116] Best routes selection in international intermodal networks .Computers& Operations Research,In Press,Corrected Proof.2007
[117]李晓濛,刘增基,赵斌.基于测量的QoS参数估计及其应用[J].软件学报. 2002, 13(7).
[118] Colorni A, Maniezzo V, et al. Distributed optimization by ant colonies. In: Proceeding or the 1st European Conference on Artificial Life.1991:134-142.
[119] Gutjahr W J. A graph-based ant system and its convergence[J]. Future Generation System. 2000, (16): 873-888
[120] Stutzle T, Dorigo M. A short convergence proof for a class of ant colony optimizationalgorithms[J]. Transactions on evolutionary computation. 2002, 6(4): 358-365
[121] Wang G, Gong W R, DeRenzi B et al. Ant colony optimizations for resource- and timing-constrained operation scheduling[J]. Transactions on Computer Aided Design of Integrated Circuits and Systems. 2007, 26(6): 1010-1029
[122]段海滨.蚁群算法原理及其应用.北京:科学出版社, 2005
[123]张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报. 2004, 17(001): 79-81.
[124]李宁,邹彤,孙德宝.车辆路径问题的粒子群算法研究[J].系统工程学报. 2004, 19(6): 596-600.
[125]梁艳春,冯大鹏.遗传算法求解旅行商问题时的基因片段保序[J].系统工程理论与实践. 2000, 20(4): 7-12
[126]姜大立,杜文.车辆路径问题的遗传算法研究[J].系统工程理论与实践. 1999, 19(6): 40-45
[127]郎茂祥.基于遗传算法的物流配送路径优化问题研究[J].中国公路学报. 2002, 15(3): 76-79
[128]柳林,朱建荣.基于遗传算法的物流配送路径优化问题的研究[J].计算机工程与应用. 2005, 41(27): 227-229
[129]马炫.求解k条最优路径问题的遗传算法[J].计算机工程与应用. 2006, 42(12): 100-101
[130]刘伟,刘景泉.资源约束下的时间-费用交换问题研究[J].系统工程理论与实践. 2002, 22(9): 42-46.
[131]杨耀红,张俊华.模式约束和资源约束下的多模式时间-费用交换问题研究[J].华北水利水电学院学报. 2006, 27(1): 35-38.
[132]韩凯,王京春.实时数据库调度策略综述[J].计算机工程与应用. 2004, 40(32): 172-176
[133] Tower B, Kondo D, Mysore M et al. Resource Scheduling in Real-Time Systems: A Survey[J]. 1999
[134] Bonvicini S S. A hazmat multi-commodity routing model satisfying risk criteria: A case study[J]. Journal of Loss Prevention in the Process Industries. 2007:233-239
[135]路易斯.马尚.一个广义的概念-城市的时间和空间消耗.天津:交通综合研究组, 1986.
[136]张凤林,郭波,刘卫华等.有限需求量的网络路径优选研究[J].系统工程. 2004, 22(11): 106-110
[137]谭龙亮.无线分组网络中公平排队算法[J].哈尔滨商业大学学报. 2004, 20(2):134-139
[138]于滨,杨忠振,程春田.并行蚁群算法在公交线网优化中应用[J].大连理工大学学报. 2007, 47(2): 211-214
[139]段海滨,丁全心,常俊杰等.基于并行蚁群优化的多UCAV任务分配仿真平台[J].航空学报. 2008, 29(5): 192-197
[140]王厚卿,张兴业.战役学[M].北京:解放军出版社,2000.
[141]吴树照.海军战役学[M].北京:海军出版社, 2001.
[142]张凤林,武小悦,郭波等.物流网络可用性研究[J].系统工程理论方法应用. 2003, 12(1): 77-80