An Algorithm for the Traffic Assignment Problem.pdf
0 likes9 views
This article presents an algorithm for solving the traffic assignment problem. The algorithm aims to model how traffic flows on a transportation network based on travel costs and route choices. It works by iteratively updating route costs and flows until an equilibrium is reached where no user can reduce their cost by switching routes. The algorithm was published in 1974 in the journal Transportation Science.
![This article was downloaded by: [3.236.55.199] On: 06 June 2020, At: 07:38
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
INFORMS is located in Maryland, USA
Transportation Science
Publication details, including instructions for authors and subscription information:
http:/ / pubsonline.informs.org
An Algorithm for the Traffic Assignment Problem
Sang Nguyen,
To cite this article:
Sang Nguyen, (1974) An Algorithm for the Traffic Assignment Problem. Transportation Science 8(3):203-216. https:/ /
doi.org/ 10.1287/ trsc.8.3.203
Full terms and conditions of use: https://pubsonline.informs.org/Publications/Librarians-Portal/PubsOnLine-Terms-and-
Conditions
This article may be used only for the purposes of research, teaching, and/ or private study. Commercial use
or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher
approval, unless otherwise noted. For more information, contact permissions@informs.org.
The Publisher does not warrant or guarantee the article’s accuracy, completeness, merchantability, fitness
for a particular purpose, or non-infringement. Descriptions of, or references to, products or publications, or
inclusion of an advertisement in this article, neither constitutes nor implies a guarantee, endorsement, or
support of claims made of that product, publication, or service.
© 1974 INFORMS
Please scroll down for article—
it is on subsequent pages
With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.)
and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual
professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to
transform strategic visions and achieve better outcomes.
For more information on INFORMS, its publications, membership, or meetings visit http:/ / www.informs.org](https://image.slidesharecdn.com/analgorithmforthetrafficassignmentproblem-230807180320-5425a2e4/85/An-Algorithm-for-the-Traffic-Assignment-Problem-pdf-1-320.jpg)
An Algorithm for the Traffic Assignment Problem.pdf
- 1. This article was downloaded by: [3.236.55.199] On: 06 June 2020, At: 07:38 Publisher: Institute for Operations Research and the Management Sciences (INFORMS) INFORMS is located in Maryland, USA Transportation Science Publication details, including instructions for authors and subscription information: http:/ / pubsonline.informs.org An Algorithm for the Traffic Assignment Problem Sang Nguyen, To cite this article: Sang Nguyen, (1974) An Algorithm for the Traffic Assignment Problem. Transportation Science 8(3):203-216. https:/ / doi.org/ 10.1287/ trsc.8.3.203 Full terms and conditions of use: https://pubsonline.informs.org/Publications/Librarians-Portal/PubsOnLine-Terms-and- Conditions This article may be used only for the purposes of research, teaching, and/ or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact permissions@informs.org. The Publisher does not warrant or guarantee the article’s accuracy, completeness, merchantability, fitness for a particular purpose, or non-infringement. Descriptions of, or references to, products or publications, or inclusion of an advertisement in this article, neither constitutes nor implies a guarantee, endorsement, or support of claims made of that product, publication, or service. © 1974 INFORMS Please scroll down for article— it is on subsequent pages With 12,500 members from nearly 90 countries, INFORMS is the largest international association of operations research (O.R.) and analytics professionals and students. INFORMS provides unique networking and learning opportunities for individual professionals, and organizations of all types and sizes, to better understand and use O.R. and analytics tools and methods to transform strategic visions and achieve better outcomes. For more information on INFORMS, its publications, membership, or meetings visit http:/ / www.informs.org