2020
DOI: 10.1109/tits.2019.2932053
|View full text |Cite
|
Sign up to set email alerts
|

Estimation of Link Travel Time Distribution With Limited Traffic Detectors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0
2

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 36 publications
0
1
0
2
Order By: Relevance
“…To simplify the problem, we consider a scenario where a taxi aims to travel along the route with the smallest distance. This assumption is also commonly adopted in numerous research studies, such as [35][36][37]. Hereafter, given x nm = 1, that is, the nth taxi is recommended to pick up the mth potential passenger from zone z i , we then have a group of possible cruising routes for the nth taxi, denoted by C z i nm , which has a size of |z i |.…”
Section: Estimation Of R C Nm and R O Nmmentioning
confidence: 99%
“…To simplify the problem, we consider a scenario where a taxi aims to travel along the route with the smallest distance. This assumption is also commonly adopted in numerous research studies, such as [35][36][37]. Hereafter, given x nm = 1, that is, the nth taxi is recommended to pick up the mth potential passenger from zone z i , we then have a group of possible cruising routes for the nth taxi, denoted by C z i nm , which has a size of |z i |.…”
Section: Estimation Of R C Nm and R O Nmmentioning
confidence: 99%
“…The presence of a large number of neurons and weight parameters in the classical bilinear recurrent neural network makes the network structure complex and the convergence speed of the algorithm slow, and the convergence speed of the algorithm is related to the dynamic performance of the prediction model [20][21][22][23][24]. Therefore, in order to improve the convergence speed of the BRNN model and enhance the reliability of traffic flow prediction results, the particle swarm algorithm is integrated with the bilinear recurrent neural network algorithm, so as to prune the redundant neurons and weights in the classical BRNN model to reduce the complexity of the network, prevent it from falling into local optimum and improve the computational speed [25][26][27][28][29][30][31].…”
Section: Brnn Optimization Modelmentioning
confidence: 99%
“…A maior parte dos modelos de previsão de tráfego veicular se aplica a dados de rodovias (VLAHOGIANNI; KARLAFTIS; GOLIAS, 2014), considerando que o tráfego urbano apresenta maior nível de complexidade. Para contornar essa di culdade, observou-se nos últimos anos o surgimento de métodos capazes de extrair as dependências temporais e espaciais entre arestas da malha viária para melhor compreender a dinâmica de tráfego veicular em contexto urbano (ERMAGUN; LEVINSON, 2018;RYU et al, 2018).…”
Section: Previsão Do Fluxo De Tráfegounclassified
“…Uma forma direta de fornecer intervalos de credibilidade e, portanto, a incerteza de previsões, é por meio de distribuições de probabilidade. Entretanto, distribuições de uxos de tráfego são pouco comuns na literatura, sendo mais frequentes a utilização de distribuições de headways (LI; CHEN, 2017) e tempos de viagem (GUESSOUS et al, 2014;DUAN et al, 2019;GHADER;DARZI;ZHANG, 2019). A primeira, e até então única aplicação de distribuições de uxos de tráfego na pesquisa em transportes foi proposta por Djenouri, Zimek e Chiarandini (2018) para detecção de outliers em séries temporais.…”
Section: Modelos Baseados Em Dadosunclassified