机译:具有相关的行进时间的随机网络中可靠的最短路径查找
Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China,State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR China;
Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China;
Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China;
Department of Land Surveying & Geo-Informatics, The Hong Kong Polytechnic University, Hong Kong, PR China;
reliable shortest path problem; travel time uncertainty; spatial correlation; travel time reliability;
机译:拉格朗日松弛法在关联旅行时间相关的随机网络中α可靠路径中的应用
机译:随机时间依赖的道路网络具有可靠的最短路径,具有空间 - 时间链路相关性:北京的案例研究
机译:拉格朗日松弛,用于具有相关路段旅行时间的可靠最短路径问题
机译:关联旅行时间的网络中基于可靠最短路径的链接临界度分析
机译:考虑链路旅行时间相关性的随机网络中的路径查找和流量均衡。
机译:未走的道路:探索地图和最短网络路径学校出行路线的结构差异
机译:具有相关的链接行进时间的随机网络中可靠的最短路径发现