2014
DOI: 10.1080/10556788.2014.966823
|View full text |Cite
|
Sign up to set email alerts
|

Approaches for solving the stochastic equilibrium assignment with variable demand: internal vs. external solution algorithms

Abstract: This paper proposes and compares different approaches within the general fixed-point framework that allows to deal with multi-user (stochastic) equilibrium assignment with variable demand (VD). The aim was threefold: (i) compare the efficiency and the effectiveness of the internal and the external approaches to stochastic equilibrium assignment with VD; (ii) investigate the efficiency and the effectiveness of different algorithms based on the method of successive averages and its extensions; (iii) investigate … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(7 citation statements)
references
References 67 publications
(100 reference statements)
0
7
0
Order By: Relevance
“…As can be seen, the formulation is a nonlinear mixed integer-programming model. To simplify the procedure of problem solving, we transform the original formulation into a mixed-integer linear programming (MILP) model using linearization technology [45]. Thus, we obtain the global optimal solution using the CPLEX solver on the NEOS cloud based on the classic algorithm of the branch and bound.…”
Section: Solution Methodsmentioning
confidence: 99%
“…As can be seen, the formulation is a nonlinear mixed integer-programming model. To simplify the procedure of problem solving, we transform the original formulation into a mixed-integer linear programming (MILP) model using linearization technology [45]. Thus, we obtain the global optimal solution using the CPLEX solver on the NEOS cloud based on the classic algorithm of the branch and bound.…”
Section: Solution Methodsmentioning
confidence: 99%
“…the Refresh Memory method (RM), also indicated as Restarting MSA method (RMSA), proposed by Reference [18] and applied by Reference [12], whose ξ(k) function may be formulated as follows:…”
Section: Conflicts Of Interestmentioning
confidence: 99%
“…Alternative step sequences (or weighting methods) were proposed, among others, by References [9][10][11]. More recently, Reference [12] proposed three revised versions of the traditional MSA method, namely: (i) Restarting MSA (RMSA), where the iteration counter is re-initialised after a specific number of iterations; (ii) Double RMSA (R2MSA), where the iteration counter is re-initialised to a variable value; (iii) Weighted MSA (WMSA), based on the self-regulated averaging method proposed by Reference [13] for solving the stochastic user equilibrium problem. The above-mentioned MSA schemes have been adopted by Reference [14] for solving a stochastic frequency-based assignment considering pre-trip/en-route path choice behaviour.…”
Section: Introductionmentioning
confidence: 99%
“…e MNL possesses a closed-form expression of path choice behavior but inheres in the drawback of independence of irrelevant alternative (IIA) property, that is, it is unable to account for overlapping effect and covariance among the different travel path cost [5,6]. e MNP model overcomes such a drawback by taking the path cost covariance into account, but there are relatively few studies in the area of Probit SUE, such as Lam and Xu [7], Meng et al [8], Meng and Liu [9], Cantarella et al [10], and Jing et al [11] since it does not possess a explicit closed-form expression and behavioural interpretation. Generally, the MNP model describes travelers' path choice behaviors by using some simulation-based methods [1,9,12].…”
Section: Introductionmentioning
confidence: 99%