Traffic flows on transportation networks, by G. F. Newell, MIT Press, 1980, 276 pp. Price: $30.00

Networks ◽  
1983 ◽  
Vol 13 (1) ◽  
pp. 156-157
Author(s):  
Richard Steinberg
Keyword(s):  
Transportation Networks ◽  
Traffic Flows

Analyzing power and dynamic traffic flows in coupled power and transportation networks

2021 ◽  
Vol 135 ◽  
pp. 110083
Author(s):  
Zhe Zhou ◽  
Xuan Zhang ◽  
Qinglai Guo ◽  
Hongbin Sun
Keyword(s):  
Transportation Networks ◽  
Traffic Flows ◽  
Dynamic Traffic ◽  
Analyzing Power

A Two-Stage Spatiotemporal Approach for Mining Traffic Flows across Multiple Networks

2011 ◽  
Vol E94-A (1) ◽  
pp. 440-442
Author(s):  
Weisong HE ◽  
Guangmin HU ◽  
Yingjie ZHOU ◽  
Haiyan JIN
Keyword(s):  
Traffic Flows ◽  
Two Stage ◽  
Multiple Networks

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

scholarly journals A Middleware-Based Approach for Multi-Scale Mobility Simulation

2021 ◽  
Vol 13 (2) ◽  
pp. 22
Author(s):  
Xavier Boulet ◽  
Mahdi Zargayouna ◽  
Gérard Scemama ◽  
Fabien Leurent
Keyword(s):  
Modeling And Simulation ◽  
Transportation Networks ◽  
External Control ◽  
Independent Mobility ◽  
Time Step ◽  
Time Representation ◽  
Multi Scale ◽  
Networks Analysis ◽  
Maximal Benefit ◽  
Do So

Modeling and simulation play an important role in transportation networks analysis. In the literature, authors have proposed many traffic and mobility simulations, with different features and corresponding to different contexts and objectives. They notably consider different scales of simulations. The scales refer to the represented entities, as well as to the space and the time representation of the transportation environment. However, we often need to represent different scales in the same simulation, for instance to represent a neighborhood interacting with a wider region. In this paper, we advocate for the reuse of existing simulations to build a new multi-scale simulation. To do so, we propose a middleware model to couple independent mobility simulations, working at different scales. We consider all the necessary processing and workflow to allow for a coherent orchestration of these simulations. We also propose a prototype implementation of the middleware. The results show that such a middleware is capable of creating a new multi-scale mobility simulation from existing ones, while minimizing the incoherence between them. They also suggest that, to have a maximal benefit from the middleware, existing mobility simulation platforms should allow for an external control of the simulations, allowing for executing a time step several times if necessary.

Sign in / Sign up

Export Citation Format

Share Document