A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks
This paper studies a class of gradient-descent heuristic algorithms for the bi-level demand adjustment problem (DAP), which seeks to adjust origin-destination (OD) matrices based on observed link flows in congested transportation networks. We first present a general gradient-descent solution framewo...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2023/8862759 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546688917569536 |
|---|---|
| author | Lan Cheng Jun Xie Jun Huang Liyang Feng Qianni Wang Hongtai Yang |
| author_facet | Lan Cheng Jun Xie Jun Huang Liyang Feng Qianni Wang Hongtai Yang |
| author_sort | Lan Cheng |
| collection | DOAJ |
| description | This paper studies a class of gradient-descent heuristic algorithms for the bi-level demand adjustment problem (DAP), which seeks to adjust origin-destination (OD) matrices based on observed link flows in congested transportation networks. We first present a general gradient-descent solution framework for the bi-level DAP and then examine and further develop its two building blocks, namely, the gradient approximation and stepsize calculation. This paper presents two gradient approximation and four stepsize calculation methods, of which two stepsize methods are newly developed. Similarities and differences between these algorithms, as well as the relevant implementation issues are discussed in great detail. The numerical results show that algorithms employing the new stepsize calculation strategies consistently outperform existing algorithms in terms of both computational precision and efficiency. |
| format | Article |
| id | doaj-art-b152bee13b094f39a33d2886a9461b6c |
| institution | Kabale University |
| issn | 2042-3195 |
| language | English |
| publishDate | 2023-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-b152bee13b094f39a33d2886a9461b6c2025-02-03T06:47:29ZengWileyJournal of Advanced Transportation2042-31952023-01-01202310.1155/2023/8862759A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic NetworksLan Cheng0Jun Xie1Jun Huang2Liyang Feng3Qianni Wang4Hongtai Yang5School of Transportation and LogisticsSchool of Transportation and LogisticsSchool of Transportation and LogisticsSchool of Transportation and LogisticsDepartment of Civil and Environmental EngineeringSchool of Transportation and LogisticsThis paper studies a class of gradient-descent heuristic algorithms for the bi-level demand adjustment problem (DAP), which seeks to adjust origin-destination (OD) matrices based on observed link flows in congested transportation networks. We first present a general gradient-descent solution framework for the bi-level DAP and then examine and further develop its two building blocks, namely, the gradient approximation and stepsize calculation. This paper presents two gradient approximation and four stepsize calculation methods, of which two stepsize methods are newly developed. Similarities and differences between these algorithms, as well as the relevant implementation issues are discussed in great detail. The numerical results show that algorithms employing the new stepsize calculation strategies consistently outperform existing algorithms in terms of both computational precision and efficiency.http://dx.doi.org/10.1155/2023/8862759 |
| spellingShingle | Lan Cheng Jun Xie Jun Huang Liyang Feng Qianni Wang Hongtai Yang A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks Journal of Advanced Transportation |
| title | A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks |
| title_full | A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks |
| title_fullStr | A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks |
| title_full_unstemmed | A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks |
| title_short | A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks |
| title_sort | class of efficient algorithms for the bi level demand adjustment problems in congested traffic networks |
| url | http://dx.doi.org/10.1155/2023/8862759 |
| work_keys_str_mv | AT lancheng aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT junxie aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT junhuang aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT liyangfeng aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT qianniwang aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT hongtaiyang aclassofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT lancheng classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT junxie classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT junhuang classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT liyangfeng classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT qianniwang classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks AT hongtaiyang classofefficientalgorithmsforthebileveldemandadjustmentproblemsincongestedtrafficnetworks |