A Transportation Network Efficiency Measure that Captures Flows, Behavior, and Costs With Applications to Network Component Importance Identification and Vulnerability

Abstract The identification of key nodes plays an important role in improving the robustness of the transportation network. For different types of transportation networks, the effect of the same identification method may be different. It is of practical significance to study the key nodes identification methods corresponding to various types of transportation networks. Based on the knowledge of complex networks, the metro networks and the bus networks are selected as the objects, and the key nodes are identified by the node degree identification method, the neighbor node degree identification method, the weighted k-shell degree neighborhood identification method (KSD), the degree k-shell identification method (DKS), and the degree k-shell neighborhood identification method (DKSN). Take the network efficiency and the largest connected subgraph as the effective indicators. The results show that the KSD identification method that comprehensively considers the elements has the best recognition effect and has certain practical significance.

Download Full-text

Supply chain equilibrium and transportation network efficiency based on MSA algorithms and multilayer decision model

Journal of Intelligent & Fuzzy Systems ◽

10.3233/jifs-179077 ◽

2019 ◽

Vol 37 (1) ◽

pp. 193-204

Author(s):

Xiaoxun Ouyang ◽

Yuqin Dai

Keyword(s):

Supply Chain ◽

Decision Model ◽

Transportation Network ◽

Network Efficiency

Download Full-text

Effects of Bus Lane Operation on Transportation Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.1030-1032.2019 ◽

2014 ◽

Vol 1030-1032 ◽

pp. 2019-2023 ◽

Cited By ~ 2

Author(s):

Yi Luo ◽

Da Lin Qian

Keyword(s):

Public Transportation ◽

User Equilibrium ◽

Mass Transportation ◽

Network Efficiency ◽

Travel Costs ◽

Congested Networks ◽

Before And After ◽

Bus Lane ◽

Transit Operation ◽

Network Efficiency Measure

In this paper, we proposed a network efficiency measure for congested networks based on the user equilibrium, travel costs, demand and road resources being occupied. Compares the network efficiency on expressway before and after the bus lane operation, the results show that the exclusive bus lane stimulates demand for mass transportation, which greatly improves the efficiency of transit operation. Finally, combined with the survey data, we are clear that how to improve the level of services of public transportation and how to attract more travelers to use buses for commuting.

Download Full-text

A Novel On-Ramp Merging Strategy for Connected and Automated Vehicles Based on Game Theory

Journal of Advanced Transportation ◽

10.1155/2020/2529856 ◽

2020 ◽

Vol 2020 ◽

pp. 1-11

Author(s):

Haigen Min ◽

Yukun Fang ◽

Runmin Wang ◽

Xiaochi Li ◽

Zhigang Xu ◽

...

Keyword(s):

Game Theory ◽

Travel Time ◽

Fuel Consumption ◽

Transportation Network ◽

Control Algorithms ◽

Traffic Density ◽

Automated Vehicles ◽

Network Efficiency ◽

Total Travel Time ◽

The Cost

Connected and automated vehicles (CAVs) have attracted much attention of researchers because of its potential to improve both transportation network efficiency and safety through control algorithms and reduce fuel consumption. However, vehicle merging at intersection is one of the main factors that lead to congestion and extra fuel consumption. In this paper, we focused on the scenario of on-ramp merging of CAVs, proposed a centralized approach based on game theory to control the process of on-ramp merging for all agents without any collisions, and optimized the overall fuel consumption and total travel time. For the framework of the game, benefit, loss, and rules are three basic components, and in our model, benefit is the priority of passing the merging point, represented via the merging sequence (MS), loss is the cost of fuel consumption and the total travel time, and the game rules are designed in accordance with traffic density, fairness, and wholeness. Each rule has a different degree of importance, and to get the optimal weight of each rule, we formulate the problem as a double-objective optimization problem and obtain the results by searching the feasible Pareto solutions. As to the assignment of merging sequence, we evaluate each competitor from three aspects by giving scores and multiplying the corresponding weight and the agent with the higher score gets comparatively smaller MS, i.e., the priority of passing the intersection. The simulations and comparisons are conducted to demonstrate the effectiveness of the proposed method. Moreover, the proposed method improved the fuel economy and saved the travel time.

Download Full-text