Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice-Reference-Cited by-同舟云学术

Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice

Published:1998-01 Issue:1 Volume:1617 Page:157-162
ISSN:0361-1981
Container-title:Transportation Research Record: Journal of the Transportation Research Board
language:en
Short-container-title:Transportation Research Record

Author:

Tatineni Maya¹,Edwards Henrik²,Boyce David¹

Affiliation:

1. Department of Civil and Materials Engineering, University of Illinois at Chicago, 842 W. Taylor Street, Chicago, IL 60607-7023

2. Transport Economics, VTI (Swedish Road and Transport Research Institute), S-581 95, Linköping, Sweden

Abstract

The disaggregate simplicial decomposition (DSD) method has been posed as a better alternative to existing algorithms for solving the deterministic user-optimal route choice model. The application of the DSD algorithm is compared and evaluated with the commonly used Frank-Wolfe (FW) algorithm on a large network in the Chicago area. The results indicate that the DSD algorithm performs much better than the FW with respect to reaching the optimality conditions specified by the model.

Publisher

SAGE Publications

Subject

Mechanical Engineering,Civil and Structural Engineering

Link

http://journals.sagepub.com/doi/pdf/10.3141/1617-22

Reference12 articles.

1. CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.

2. A finite algorithm to maximize certain pseudoconcave functions on polytopes

3. Simplicial decomposition in nonlinear programming algorithms

4. Finiteness in restricted simplicial decomposition

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A multimodal multicommodity network equilibrium model with service capacity and bottleneck congestion for China-Europe containerized freight flows;Transportation Research Part E: Logistics and Transportation Review;2022-08

2. On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art;Smart Delivery Systems;2020

3. A modified Physarum-inspired model for the user equilibrium traffic assignment problem;Applied Mathematical Modelling;2018-03

4. Allocation of Link Flow Detectors for Origin-Destination Matrix EstimationâA Comparative Study;Computer-Aided Civil and Infrastructure Engineering;2010-02

5. A heuristic for the bilevel origin–destination-matrix estimation problem;Transportation Research Part B: Methodological;2008-05