期刊文献+

基于多目标决策交巡警服务平台的设置与调度问题研究

The Settings and Scheduling Problems of Traffic Patrol Service Platform Based on the Multi- Objective Decision- Making
下载PDF
导出
摘要 由于警务资源有限,交巡警服务平台的设置与合理调度问题是警务部门面临的一个实际问题.本文利用多目标决策方法为此设计最优的解决方案.首先,结合城区的交通网络图及Floyd算法确定各交巡警服务平台管辖范围,建立平台设置的优化模型.然后利用0-1规划法提出了平台合理的调度方案,并运用模糊综合评价对原有交巡警服务平台的设置进行评价. Owing to limited police resources,the settings and reasonable scheduling problems of traffic patrol service platform are practical problems faced by police department. In this paper,we use the multi- objective decision- making method to design the optimal solution. First of all,combined with urban traffic network diagram and Floyd algorithm to determine the scope of traffic patrol service platform,and establish the optimization model of the platform. Then using 0- 1 programming,reasonable scheduling scheme is proposed,and we use the fuzzy comprehensive evaluation to evaluate the original traffic patrol service platform.
作者 夏秀男
出处 《泰山学院学报》 2013年第6期20-25,共6页 Journal of Taishan University
关键词 交巡警服务平台 最短路径 FLOYD算法 0-1规划 多目标决策方法 模糊综合评价 traffic patrol service platform shortest path Floyd algorithm 0-1 programming multi-objective decision-making method fuzzy comprehensive evaluation
  • 相关文献

参考文献7

二级参考文献14

  • 1Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerische Math, 1959,(1):269-271. 被引量:1
  • 2Pettie A, Ramachandran V. Computing shortest paths with comparisons and additions[A]. Proceedings 13th Symposium on Discrete Algorithms[C]. 2002.267-276. 被引量:1
  • 3Pettie S, Ramachandran V. On the Comparison-Addition Complexity of All-pairs Shortest Paths[A]. 13th Annual International Symposium on Algorithms and Computation[C]. 2002. 被引量:1
  • 4Pettie W. A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs[J]. Theoretical Computer Science, 2002,312(1):47-74. 被引量:1
  • 5Meyer Ulrich, Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds[J]. Journal of Algorithms, 2003,48(1):91-134. 被引量:1
  • 6Kolliopoulos Stavros G, Clifford Stein. Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time[J]. Journal of Algorithms, 1998,28(1):125-141. 被引量:1
  • 7Cherkassky B V, Goldberg A V. Negative-cycle detection algorithms[J]. Mathematical Programming, 1999,(19):277-311. 被引量:1
  • 8Thorup M. Undirected single source shortest paths in linear time[J]. J. ACM. 1999,46(3):362-394. 被引量:1
  • 9Thorup M. Float, Integers, and Single Source Shortest Paths[J]. J. Algorithms, 2000,35(2):189-201. 被引量:1
  • 10Johnson D B. A note on Dijkstra's shortest path Algorithm[J]. J.ACM, 1973,20:385-388. 被引量:1

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部