2010 Sixth International Conference on Natural Computation 2010
DOI: 10.1109/icnc.2010.5584513
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic shortest path in stochastic traffic networks based on fluid neural network and Particle Swarm Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Then X (0) and P (0) are set as 0 vectors. And the input is used for parameter estimation through Kalman Filtering Algorithm [17]. Finally traffic flows are forecast.…”
Section: Methodsmentioning
confidence: 99%
“…Then X (0) and P (0) are set as 0 vectors. And the input is used for parameter estimation through Kalman Filtering Algorithm [17]. Finally traffic flows are forecast.…”
Section: Methodsmentioning
confidence: 99%
“…3.1.3 Dynamic optimal path finding. There have been many models proposed recently to optimize the routing of the whole traffic network by searching for the best path for each individual such as the models by Deng et al, 25 Hua and Pei, 26 Nannicini et al, 27 Efentakis et al, 28 This paper introduces an algorithm to dynamically optimize the routing at the system level of a transportation network. In this algorithm, each individual will be recommended to follow a path which depends on the current traffic capacity and the user preferences such that the overall throughput of the traffic network is maximized as well as the user preferences being satisfied.…”
Section: Behaviormentioning
confidence: 99%
“…It is based on the natural process of group communication to share individual knowledge when a group of birds or insects search food or migrate and so forth in a searching space, although all birds or insects do not know where the best position is. But from the nature of the social behavior, if any member can find out a desirable path to go, the rest of the members will follow quickly [6] [7].…”
Section: Accelerated Particle Swarm Optimization Algorithmmentioning
confidence: 99%