2018
DOI: 10.1016/j.ejor.2018.01.017
|View full text |Cite
|
Sign up to set email alerts
|

Non-additive shortest path in the context of traffic assignment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 32 publications
0
1
0
Order By: Relevance
“…Secondly, overlapping effect should be studied under route choice models which consider the correlations between routes, such as Probit model (Daganzo and Sheffi, 1977), C-logit model (Cascetta et al,1996;Zhou et al, 2012), Nested Logit (NL) model (McFadden, 1978), path-size logit (PSL) model (Chen et al, 2012). Adapting fast path-based algorithms for traffic assignment to these route choice model is also interesting (Chen et al, 2001;Perederieieva et al, 2018;Du et al, 2020). Finally, various route choice models and their paradoxical features should be applied to a broader range of problems, such as network design (Cantarella et al, 2006;Hosseininasab et al, 2018), network evaluation (Han et al, 2008), combined modal split and traffic assignment problem (Xu et al, 2008;Ryu et al, 2017).…”
Section: Discussionmentioning
confidence: 99%
“…Secondly, overlapping effect should be studied under route choice models which consider the correlations between routes, such as Probit model (Daganzo and Sheffi, 1977), C-logit model (Cascetta et al,1996;Zhou et al, 2012), Nested Logit (NL) model (McFadden, 1978), path-size logit (PSL) model (Chen et al, 2012). Adapting fast path-based algorithms for traffic assignment to these route choice model is also interesting (Chen et al, 2001;Perederieieva et al, 2018;Du et al, 2020). Finally, various route choice models and their paradoxical features should be applied to a broader range of problems, such as network design (Cantarella et al, 2006;Hosseininasab et al, 2018), network evaluation (Han et al, 2008), combined modal split and traffic assignment problem (Xu et al, 2008;Ryu et al, 2017).…”
Section: Discussionmentioning
confidence: 99%
“…In the future study, it is noteworthy to design a computationally efficient algorithm to apply the proposed model on the real network. The computational efficiency mentioned here means that the algorithm can generate the route when needed (e.g., [48]), i.e., no route enumeration is needed.…”
Section: (B)mentioning
confidence: 99%
“…Traffic assignment (TA) problem plays a central role in urban transportation network analysis (Sheffi, 1985). It has been widely used for various purposes, for example, transportation system assessment (Kitthamkesorn and Chen, 2017), impact prediction of projects and policies (Huang and Li, 2007;Cantarella et al, 2015), traffic restraints with respect to congestion or emission (Chen et al, 2011), time-cost tradeoff in traffic assignment (Leurent, 1993;Chen et al, 2010Chen et al, , 2012Perederieieva et al, 2018), traffic management strategy (Yang and Bell, 1997;Tan et al, 2019), signal control optimization (Chiou, 2007), road network design (Yin et al, 2009;Szeto et al, 2015), paradox analysis (Yang and Bell, 1998;Yang and Chen, 2009;Yao et al, 2019), etc. The stochastic user equilibrium (SUE) problem is one of the important models of the TA problem.…”
Section: Introductionmentioning
confidence: 99%