Abstract

This paper proposes a logit-based stochastic user equilibrium (SUE) problem for networks with entry-exit toll schemes that result in nonadditive path costs. First, it develops a strictly convex minimization model in terms of path flows for the problem. Second, by decomposing the original problem into two kinds of subproblems that possess the additive path costs, this study designs a novel two-stage stochastic loading algorithm exempted from path enumeration or generation. Hence, the method of successive average embedded with the proposed stochastic loading algorithm can identify the logit-based SUE link and entry-exit flows. Finally, two numerical examples are used to demonstrate the proposed model and algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.