Pith. sign in

REVIEW

Modeling Route Choice with Real-Time Information: Comparing the Recursive and Non-Recursive Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.05783 v2 pith:TUXDP3ZB submitted 2020-05-08 eess.SY cs.SYstat.AP

classification eess.SYcs.SYstat.AP
keywords choicelinkroutingmodelmodelspolicynextnon-recursive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study the routing policy choice problems in a stochastic time-dependent (STD) network. A routing policy is defined as a decision rule applied at the end of each link that maps the realized traffic condition to the decision on the link to take next. Two types of routing policy choice models are formulated with perfect online information (POI): recursive logit model and non-recursive logit model. In the non-recursive model, a choice set of routing policies between an origin-destination (OD) pair is generated, and a probabilistic choice is modeled at the origin, while the choice of the next link at each link is a deterministic execution of the chosen routing policy. In the recursive model, the probabilistic choice of the next link is modeled at each link, following the framework of dynamic discrete choice models. The two models are further compared in terms of computational efficiency in estimation and prediction, and flexibility in systematic utility specification and modeling correlation.

Discussion (0). Continue with ORCID to comment.

Pith tools