.png){kind=icon}
.png){kind=icon}
Return
An assignment model with modified Logit, which obviates enumeration and overlapping problems
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1022598404823.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One. of the. main components of stochastic assignment models is the. route. choice. model solved with implicit or explicit path enumeration algorithms. Such models are. used both for congested networks within equilibrium or dynamic models and for non-congested networks within static or pseudo-dynamic network loading models. This paper proposes a C-Logit model specification within a Dial algorithm structure. for the. implicit assignment of network flows. The. model and its solution algorithm, called D-C-Logit, combine. several positive. features found in the. literature. for choice set generation and choices from a given choice set: generation of a set of alternatives with a selective. approach; calculation of the. path choice. probability in a closed form; simulation of the. overlapping effect among alternative. paths; computation of just one. tree for each origin avoiding explicit path enumeration. This paper has two main objectives: the. proposition of a Dial-like. algorithm to solve. a C-Logit assignment model and application of the. algorithm to different networks in order to demonstrate. certain properties.
Keywords:
assignment model
path choice model
path perception
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
2.1K
Citations:
7.1K
Organization
No organization information available