Controllability of flow-conservation networks

2017 ◽  
Vol 96 (1) ◽  
Author(s):  
Chen Zhao ◽  
An Zeng ◽  
Rui Jiang ◽  
Zhengzhong Yuan ◽  
Wen-Xu Wang
2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Minhua Shao ◽  
Lijun Sun ◽  
Xianzhi Shao

The sensor location problem (SLP) discussed in this paper is to find the minimum number and optimum locations of the flow counting points in the road network so that the traffic flows over the whole network can be inferred uniquely. Flow conservation system at intersections is formulated firstly using the turning ratios as the prior information. Then the coefficient matrix of the flow conservation system is proved to be nonsingular. Based on that, the minimal number of counting points is determined to be the total number of exclusive incoming roads and dummy roads, which are added to the network to represent the trips generated on real roads. So the task of SLP model based on turning ratios is just to determine the optimal sensor locations. The following analysis in this paper shows that placing sensors on all the exclusive incoming roads and dummy roads can always generate a unique network flow vector for any network topology. After that, a detection set composed of only real roads is proven to exist from the view of feasibility in reality. Finally, considering the roads importance and cost of the sensors, a weighted SLP model is formulated to find the optimal detection set. The greedy algorithm is proven to be able to provide the optimal solution for the proposed weighted SLP model.


2021 ◽  
Vol 148 ◽  
pp. 107262
Author(s):  
Hon Huin Chin ◽  
Petar Sabev Varbanov ◽  
Jiří Jaromír Klemeš ◽  
Peng Yen Liew

Transport ◽  
2008 ◽  
Vol 23 (1) ◽  
pp. 73-77 ◽  
Author(s):  
Shu-Guang Li

We present a genetic algorithm for solving dynamic simultaneous route and departure time equilibrium problem. Not only can a flow‐swapping process in the algorithm guarantee the flow conservation constraints between OD pair, but also accelerate the convergence velocity of the algorithm. Finally, a simulation example shows feasibility and validity of genetic algorithm.


PARKS ◽  
2013 ◽  
Vol 19 (1) ◽  
pp. 115-125 ◽  
Author(s):  
James Fitzsimons ◽  
Ian Pulsford ◽  
Geoff Wescott

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Wei Chen ◽  
Bo Zhou

In this paper, we adapt the fractional derivative approach to formulate the flow-conservation transportation networks, which consider the propagation dynamics and the users’ behaviors in terms of route choices. We then investigate the controllability of the fractional-order transportation networks by employing the Popov-Belevitch-Hautus rank condition and the QR decomposition algorithm. Furthermore, we provide the exact solutions for the full controllability pricing controller location problem, which includes where to locate the controllers and how many controllers are required at the location positions. Finally, we illustrate two numerical examples to validate the theoretical analysis.


2018 ◽  
Vol 13 (1) ◽  
pp. 108-116
Author(s):  
Phanindra Prasad Bhandari ◽  
Shree Ram Khadka

 An attempt of shifting as more people as possible and/or their logistics from a dangerous place to a safer place is an evacuation planning problem. Such problems modeled on network have been extensively studied and the various efficient solution procedures have been established. The solution strategies for these problems are based on source-sink path augmentation and the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at node necessarily could also be used to model the evacuation planning problem. This paper proposes a model for maximum flow evacuation planning problem on a single-source-single-sink static network with integral arc capacities with holding capability of evacuees in the temporary shelter at intermediate nodes and extends the model into the dynamic case. Journal of the Institute of Engineering, 2017, 13(1): 108-116


2019 ◽  
Vol 10 (2) ◽  
pp. 257-260 ◽  
Author(s):  
Mikhail Y. Verbitsky ◽  
Michel Crucifix ◽  
Dmitry M. Volobuev

Abstract. Palaeoclimate records display a continuous background of variability connecting centennial to 100 kyr periods. Hence, the dynamics at the centennial, millennial, and astronomical timescales should not be treated separately. Here, we show that the nonlinear character of ice sheet dynamics, which was derived naturally from the ice-flow conservation laws, provides the scaling constraints to explain the structure of the observed spectrum of variability.


Sign in / Sign up

Export Citation Format

Share Document