Determining capacity of multimodal multi-commodities freight transportation network from critical link volumes

The commodity transportation capacity between all origin-destination （ OD ） pairs over the multimodal multi-commodities freight transportation network （MMFTN） is determined. A multi-ob- jectives mathematical model is formulated for determining the OD capacity over the MMFTN accord- ing to a transporting capacity matrix that increased from the reference matrixes. The corresponding incremental factor for estimating the capacity matrix is obtained via the maximal likelihood estima- tion method that samples data of differences between the estimated commodity volumes and carrying capacities of the critical links. The proposed formulations are tested by an experimental highway and railroad freight transportation network in an existing literature. The relevant results of OD capacities are displayed and applicability of the algorithm is certified.

An identification model of urban critical links with macroscopic fundamental diagram theory

How to identify the critical links of the urban road network for actual traffic management and intelligent trans- portation control is an urgent problem, especially in the con- gestion environment. Most previous methods focus on traf- fic static characteristics for traffic planning and design. How- ever, actual traffic management and intelligent control need to identify relevant sections by dynamic traffic information for solving the problems of variable transportation system. Therefore, a city-wide traffic model that consists of three re- lational algorithms, is proposed to identify significant links of the road network by using macroscopic fundamental diagram （MFD） as traffic dynamic characteristics. Firstly, weighted- traffic flow and density extraction algorithm is provided with simulation modeling and regression analysis methods, based on MFD theory. Secondly, critical links identification algo- rithm is designed on the first algorithm, under specified prin- ciples. Finally, threshold algorithm is developed by cluster analysis. In addition, the algorithms are analyzed and applied in the simulation experiment of the road network of the cen- tral district in Hefei city, China. The results show that the model has good maneuverability and improves the shortcom- ings of the threshold judged by human. It provides an ap- proach to identify critical links for actual traffic management and intelligent control, and also gives a new method for eval- uating the planning and design effect of the urban road net- work.

Critical links detection in stochastic networks: application to the transport networks

Purpose–The purpose of this paper is to study a multiple-origin-multiple-destination variant of dynamic critical nodes detection problem(DCNDP)and dynamic critical links detection problem(DCLDP)in stochastic networks.DCNDP and DCLDP consist of identifying the subset of nodes and links,respectively,whose deletion maximizes the stochastic shortest paths between all origins–destinations pairs,in the graph modeling the transport network.The identification of such nodes(or links)helps to better control the road traffic and predict the necessary measures to avoid congestion.Design/methodology/approach–A Markovian decision process is used to model the shortest path problem underdynamic trafficconditions.Effectivealgorithmstodeterminethe criticalnodes(links)whileconsideringthe dynamicity of the traffic network are provided.Also,sensitivity analysis toward capacity reduction for critical links is studied.Moreover,the complexity of the underlying algorithms is analyzed and the computational efficiency resulting from the decomposition operation of the network into communities is highlighted.Findings–The numerical results demonstrate that the use of dynamic shortest path(time dependency)as a metric has a significant impact on the identification of critical nodes/links and the experiments conducted on real world networks highlight the importance of sensitive links to dynamically detect critical links and elaborate smart transport plans.Research limitations/implications–The research in this paper also revealed several challenges,which call for future investigations.First,the authors have restricted our experimentation to a small network where the only focus is on the model behavior,in the absence of historical data.The authors intend to extend this study to very large network using real data.Second,the authors have considered only congestion to assess network’s criticality;future research on this topic may include other factors,mainly vulnerability.Practical implications–Taking into consideration the dynamic and stochastic nature in problem modeling enables to be effective tools for real-time control of transportation networks.This leads to design optimized smart transport plans particularly in disaster management,to improve the emergency evacuation effeciency.Originality/value–The paper provides a novel approach to solve critical nodes/links detection problems.In contrast to the majority of research works in the literature,the proposed model considers dynamicity and betweennesswhiletakingintoaccount the stochasticaspectof transportnetworks.Thisenables theapproach to guide the traffic and analyze transport networks mainly under disaster conditions in which networks become highly dynamic.

Energy-Efficient Routing Algorithm Based on Multipath Routing in Large-Scale Networks

A reduction in network energy consumption and the establishment of green networks have become key scientific problems in academic and industrial research.Existing energy efficiency schemes are based on a known traffic matrix,and acquiring a real-time traffic matrix in current complex networks is difficult.Therefore,this research investigates how to reduce network energy consumption without a real-time traffic matrix.In particular,this paper proposes an intra-domain energy-efficient routing scheme based on multipath routing.It analyzes the relationship between routing availability and energy-efficient routing and integrates the two mechanisms to satisfy the requirements of availability and energy efficiency.The main research focus is as follows:(1)A link criticality model is evaluated to quantitatively measure the importance of links in a network.(2)On the basis of the link criticality model,this paper analyzes an energy-efficient routing technology based on multipath routing to achieve the goals of availability and energy efficiency simultaneously.(3)An energy-efficient routing algorithm based on multipath routing in large-scale networks is proposed.(4)The proposed method does not require a real-time traffic matrix in the network and is thus easy to apply in practice.(5)The proposed algorithm is verified in several network topologies.Experimental results show that the algorithm can not only reduce network energy consumption but can also ensure routing availability.