SOLVING TRAFFIC ASSIGNMENT FROBLEM WITH LINK CAF ACITY CONSTRAINTS USING FENALTY FUNCTION

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ZOKAEI ASHTIANI H.; SHAHPAR A.H.; BABAZADEH ABAS

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Sharif Journal of Civil Engineering Year:2009 | Volume:24 | Issue:46.1 Page(s): 53-58

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,486

Download:

Cites:

Information Journal Paper

Title

SOLVING TRAFFIC ASSIGNMENT FROBLEM WITH LINK CAF ACITY CONSTRAINTS USING FENALTY FUNCTION

Author(s)

ZOKAEI ASHTIANI H. | SHAHPAR A.H. | BABAZADEH ABAS | Issue Writer Certificate

Keywords

TRAFFIC ASSIGNMENTQ2

CAPACITY CONSTRAINTQ3

PENALTY FUNCTIONQ3

Abstract

In TRAFFIC ASSIGNMENT problem (TAP) literature, methods like Frank-Wolfe have sufficient efficiency in solving the problem, assuming infinite capacities for the links, because, in these methods, each linearized sub-problem is equivalent to a shortest path problem between an origin and a destination (OD) pair. However, in reality, links have limited capacities and obtaining more realistic volumes needs those capacities to be taken into account. Explicit consideration of this type of constraint in TAP causes each linearized sub-problem to be converted to a minimal cost, multi-commodity flow problem that is difficult to solve. Another method is to consider the constraints implicitly and use some PENALTY FUNCTIONs that are sensitive to capacities, so that, by adding them to travel time functions, the CAPACITY CONSTRAINTs lead to being satisfied. In this paper, a suitable PENALTY FUNCTION is suggested and its usefulness is examined via some numerical examples. The results will be compared with the other methods of interest, such as: the inner PENALTY FUNCTION (IPF) and the augmented Lagrangian multiplier (ALM). Also, the results are presented by applying the suggested method to the network of Mashhad city, asa real case example, where the links approaches to the signalized intersections are assumed capacitated.

Cites

No record.

References

No record.

Cite

APA: Copy

ZOKAEI ASHTIANI, H., SHAHPAR, A.H., & BABAZADEH, ABAS. (2009). SOLVING TRAFFIC ASSIGNMENT FROBLEM WITH LINK CAF ACITY CONSTRAINTS USING FENALTY FUNCTION. SHARIF: CIVIL ENINEERING, 24(46.1), 53-58. SID. https://sid.ir/paper/128236/en

Vancouver: Copy

ZOKAEI ASHTIANI H., SHAHPAR A.H., BABAZADEH ABAS. SOLVING TRAFFIC ASSIGNMENT FROBLEM WITH LINK CAF ACITY CONSTRAINTS USING FENALTY FUNCTION. SHARIF: CIVIL ENINEERING[Internet]. 2009;24(46.1):53-58. Available from: https://sid.ir/paper/128236/en

IEEE: Copy

H. ZOKAEI ASHTIANI, A.H. SHAHPAR, and ABAS BABAZADEH, “SOLVING TRAFFIC ASSIGNMENT FROBLEM WITH LINK CAF ACITY CONSTRAINTS USING FENALTY FUNCTION,” SHARIF: CIVIL ENINEERING, vol. 24, no. 46.1, pp. 53–58, 2009, [Online]. Available: https://sid.ir/paper/128236/en

Related Journal Papers