Liyang Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Liyang Feng has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Jun Xie
School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610032, China
4 shared publications - Qianni Wang
Department of Civil and Environmental Engineering, Northwestern University, Evanston, Illinois 60208
2 shared publications - David Zhi-Wei Wang
Nanyang Technological University
1 shared publication - Hongtai Yang
School of Transportation and Logistics, National Engineering Laboratory of Integrated Transportation Big Data Application Technology, National United Engineering Laboratory of Integrated and Intelligent Transportation, Institute of System Science and Engineering, Southwest Jiaotong University, Chengdu 611756, China
1 shared publication Jiayang Li
1 shared publication- Jiayang Li
Department of Data and Systems Engineering, The University of Hong Kong, Hong Kong SAR, China
1 shared publication
Latest Publications
- 15 April 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 188
Bilevel transit timetabling with synchronization at origin and transfer stops
- 15 April 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 188
Bilevel transit timetabling with synchronization at origin and transfer stops
- 12 December 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 192
Entropy maximization in multi-class traffic assignment
- 12 December 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 192
Entropy maximization in multi-class traffic assignment
- Open Access
- 9 December 2023
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-15
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 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.
- 9 December 2023
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-15
Open AccessA 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 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.