The Experts below are selected from a list of 253128 Experts worldwide ranked by ideXlab platform
Wei Teng - One of the best experts on this subject based on the ideXlab platform.
-
SEAL - Research of undirected Network Capacity expansion based on the spanning-tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
-
research of undirected Network Capacity expansion based on the spanning tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it. discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
Kaihua Xu - One of the best experts on this subject based on the ideXlab platform.
-
SEAL - Research of undirected Network Capacity expansion based on the spanning-tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
-
research of undirected Network Capacity expansion based on the spanning tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it. discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
Hao Huang - One of the best experts on this subject based on the ideXlab platform.
-
ICNC (5) - Research of Directed Network Capacity Expansion Based on Spanning Tree Diagram
Third International Conference on Natural Computation (ICNC 2007) Vol V, 2007Co-Authors: Yuhua Liu, Hao Huang, Haiyan ZhuAbstract:This paper gives a mathematical description of the directed Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the directed Network capacities based on spanning tree diagram and even an advanced optimization algorithm. In addition, it discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of directed Network with limited costs is given, whose feasibility and process are illustrated via examples.
-
SEAL - Research of undirected Network Capacity expansion based on the spanning-tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
-
research of undirected Network Capacity expansion based on the spanning tree
Lecture Notes in Computer Science, 2006Co-Authors: Kaihua Xu, Hao Huang, Wei TengAbstract:This paper gives a mathematical description of the undirected Network Capacity definitions and theorems of computing capacities towards the Network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the undirected Network capacities based on spanning tree and even an advanced optimization algorithm. In addition, it. discusses Network Capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of undirected Network with limited costs is outlined, whose feasibility and process are illustrated via examples.
Burak Boyacı - One of the best experts on this subject based on the ideXlab platform.
-
the effect of variability of urban systems characteristics in the Network Capacity
Transportation Research Part B-methodological, 2012Co-Authors: Nikolaos Geroliminis, Burak BoyacıAbstract:Recent experimental analysis has shown that some types of urban Networks exhibit a low scatter reproducible relationship between average Network flow and density, known as the macroscopic fundamental diagram (MFD). It has also been shown that heterogeneity in the spatial distribution of density can significantly decrease the Network flow for the same value of density. Analytical theories have been developed to explore the connection between Network structure and an MFD for urban neighborhoods with cars controlled by traffic signals. However these theories have been applied only in cities with deterministic values of topological and control variables for the whole Network and by ignoring the effect of turns. In our study we are aiming to generate an MFD for streets with variable link lengths and signal characteristics and understand the effect of variability for different cities and signal structures. Furthermore, this variability gives the opportunity to mimic the effect of turning movements. Route or Network Capacity can be significantly smaller than the Capacity of a single link, because of the correlations developed through the different values of offsets. The above analysis would not be possible using standard traffic engineering techniques. This will be a key issue in planning the signal regimes such a way that maximizes the Network Capacity and/or the density range of the maximum Capacity.
-
Estimation of the Network Capacity for multimodal urban systems
Procedia - Social and Behavioral Sciences, 2011Co-Authors: Burak Boyacı, Nikolaos GeroliminisAbstract:As more people through different modes compete for the limited urban space that is set aside to serve transport, there is an increasing need to understand details of how this space is used and how it can be managed to improve accessibility for everyone. Ultimately, an important goal is to understand what sustainable level of mobility cities of different structures can achieve. Understanding these outcomes parametrically for all possible city structures and mixes of transport modes would inform the decision making process, thereby helping cities achieve their sustainability goals. In this paper we focus on the Network Capacity of multimodal systems with motorized traffic and extra emphasis in buses. More specifically, we propose to study how the throughput of passengers and vehicles depends on the geometrical and operational characteristics of the system, the level of congestion and the interactions between different modes. A methodology to estimate a macroscopic fundamental diagram and Network Capacity of cities with mixed-traffic bus-car lanes or with individual bus-only lanes is developed and examples for different city topologies are provided. The analysis is based on realistic macroscopic models of congestion dynamics and can be implemented with readily available data. (C) 2011 Published by Elsevier Ltd.
Ziyin Deng - One of the best experts on this subject based on the ideXlab platform.
-
A Model and an Algorithm of Urban Transport Network Capacity
International Conference on Transportation Engineering 2009, 2009Co-Authors: Changzhi Bian, Ziyin DengAbstract:This study deals with the problem of urban transport Network Capacity with link Capacity constraint. After a thorough review on urban transport Network Capacity modeling, a new bi-level programming model is formulated. In upper level program the Network Capacity is maximized. And a logit-based stochastic traffic assignment model with link Capacity constraint is adopted in the lower level model. Then a novel algorithm was proposed. The flow-to-Capacity ratio is used as the convergence criterion. An example is given and numerical results show the algorithm is potential for practical applications.
-
Urban Transport Network Capacity Considering Level of Service
ICCTP 2009, 2009Co-Authors: Haiwei Wang, Changzhi Bian, Ziyin DengAbstract:This study deals with the problem of urban transport Network Capacity under a given level of service. After a thorough review of urban transport Network Capacity modeling and multiple objectivity programming, a multiple objectivity bi-level programming model is formulated, which considers that the Network Capacity analysis should link the level of service of a road Network together. In an upper level program is a multiple objectivity model which includes: (i) the maximization of the Network Capacity; and (ii) the maximization of the level of service. And a logit-based stochastic traffic assignment model is adopted in the lower level model. Then the goal programming method is proposed. An example is given and numerical results show the algorithm is feasible for practical applications.
