This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears...This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.展开更多
Path marginal cost （PMC） is the change in totaltravel cost for flow on the network that arises when timedependentpath flow changes by 1 unit. Because it is hardto obtain the marginal cost on all the links, the local...Path marginal cost （PMC） is the change in totaltravel cost for flow on the network that arises when timedependentpath flow changes by 1 unit. Because it is hardto obtain the marginal cost on all the links, the local PMC,considering marginal cost of partial links, is normallycalculated to approximate the global PMC. When analyzingthe marginal cost at a congested diverge intersection, ajump-point phenomenon may occur. It manifests as alikelihood that a vehicle may unsteadily lift up （down） inthe cumulative flow curve of the downstream links. Previously,the jump-point caused delay was ignored whencalculating the local PMC. This article proposes an analyticalmethod to solve this delay which can contribute toobtaining a more accurate local PMC. Next to that, we usea simple case to calculate the previously local PMC and themodified one. The test shows a large gap between them,which means that this delay should not be omitted in thelocal PMC calculation.展开更多
Geospatial technology is a useful tool when identifying land corridors for transportation networks. The primary transit corridor between Los Angeles, CA and Las Vegas, NV is Interstate-15, approximately a four-hour au...Geospatial technology is a useful tool when identifying land corridors for transportation networks. The primary transit corridor between Los Angeles, CA and Las Vegas, NV is Interstate-15, approximately a four-hour automobile trip without traffic. Virgin Trains USA LLC proposes an alternative means of travel by constructing a high-speed railway along Interstate-15 connecting Las Vegas and Victorville, CA. This study uses least-cost path analysis to propose an optimized alternative corridor for Virgin Trains’ proposed high-speed railway through a system facilitated road and rail accessibility analysis. Previous research using least-cost path and accessibility methodologies evaluated the results of proposed high-speed railway corridors and the system facilitated accessibility changes by visually inspecting deviations from a planned corridor using single or multiple cost criteria as inputs for a weighted cost surface. However, robust analyses of previous least-cost path studies’ corridors are lacking. This proof-in-concept study proposes a less costly corridor through least-cost path analysis and measures the social impact on the stakeholders of a high-speed railway transportation system through system facilitated accessibility. This study’s proposed alternative corridor is 31% shorter than Virgin Trains’ planned corridor and system facilitated accessibility to Las Vegas, NV is increased in 99.74% of Los Angeles County’s census tracts. These results support this study’s position that geospatial technology can support transportation planning in a comprehensive method that considers the transportation corridor and benefits its stakeholders.展开更多
为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,...为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。展开更多
基金supported by NSF China(No.61960206002,62020106005,42050105,62061146002)Shanghai Pilot Program for Basic Research-Shanghai Jiao Tong University。
文摘This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost.
文摘Path marginal cost （PMC） is the change in totaltravel cost for flow on the network that arises when timedependentpath flow changes by 1 unit. Because it is hardto obtain the marginal cost on all the links, the local PMC,considering marginal cost of partial links, is normallycalculated to approximate the global PMC. When analyzingthe marginal cost at a congested diverge intersection, ajump-point phenomenon may occur. It manifests as alikelihood that a vehicle may unsteadily lift up （down） inthe cumulative flow curve of the downstream links. Previously,the jump-point caused delay was ignored whencalculating the local PMC. This article proposes an analyticalmethod to solve this delay which can contribute toobtaining a more accurate local PMC. Next to that, we usea simple case to calculate the previously local PMC and themodified one. The test shows a large gap between them,which means that this delay should not be omitted in thelocal PMC calculation.
文摘Geospatial technology is a useful tool when identifying land corridors for transportation networks. The primary transit corridor between Los Angeles, CA and Las Vegas, NV is Interstate-15, approximately a four-hour automobile trip without traffic. Virgin Trains USA LLC proposes an alternative means of travel by constructing a high-speed railway along Interstate-15 connecting Las Vegas and Victorville, CA. This study uses least-cost path analysis to propose an optimized alternative corridor for Virgin Trains’ proposed high-speed railway through a system facilitated road and rail accessibility analysis. Previous research using least-cost path and accessibility methodologies evaluated the results of proposed high-speed railway corridors and the system facilitated accessibility changes by visually inspecting deviations from a planned corridor using single or multiple cost criteria as inputs for a weighted cost surface. However, robust analyses of previous least-cost path studies’ corridors are lacking. This proof-in-concept study proposes a less costly corridor through least-cost path analysis and measures the social impact on the stakeholders of a high-speed railway transportation system through system facilitated accessibility. This study’s proposed alternative corridor is 31% shorter than Virgin Trains’ planned corridor and system facilitated accessibility to Las Vegas, NV is increased in 99.74% of Los Angeles County’s census tracts. These results support this study’s position that geospatial technology can support transportation planning in a comprehensive method that considers the transportation corridor and benefits its stakeholders.
文摘为了提高网络路由性能,提出并设计了一种基于遗传-蚁群优化算法的服务质量(quality of service,QoS)组播路由算法。首先,设计了自适应变频采集策略用于采集网络与节点信息,以此获得网络和节点的状态,为后续路由优化提供数据支持;其次,计算路径代价,将路径代价最小作为优化目标,建立QoS组播路由优化模型,并设置相关约束条件;最后,结合遗传算法和蚁群算法提出一种遗传-蚁群优化算法求解上述模型,输出最优路径,完成路由优化。实验结果表明,所提算法可有效降低路径长度与路径代价,提高搜索效率与路由请求成功率,优化后的路由时延抖动较小。
