Lian Qun Ouyang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lian Qun Ouyang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Di Huang
School of Economics and Management, Beijing Jiaotong University, Beijing, China
2 shared publications - Di Huang
School of Economics and Management, Beihang University, Beijing, China
1 shared publication - Dianrun Huang
School of Electronic and Information Engineering, Beihang University, Beijing, China
1 shared publication - Hong Zhou
Beihang University
1 shared publication - Lingling Xiao
School of Economics and Management, Beijing Jiaotong University, Beijing, China
1 shared publication - William H. K. Lam
Department of Civil and Environmental Engineering The Hong Kong Polytechnic University Hong Kong China
1 shared publication
Latest Publications
- Open Access
- 14 July 2025
- Published by Faculty of Transport and Traffic Sciences in Promet - Traffic&Transportation
- Vol. 37 (4) , 911-930
An Activity-Journey-Network Approach for Modelling Travel Behaviour of Multiple User Classes Under Time Constraints
The flow pattern on a given transportation network at a given moment results from many users’ travel decisions which are made for some purposes, for example, participating in necessary activities such as work, eating and shopping. Consequently, the explicit modelling of the interaction between users’ activity and travel choice behaviour serves as a basic building block for long-term transportation planning and management. In this paper, an activity-based network user equilibrium model is proposed to study the dynamic activity-travel scheduling problem with multiple classes of users under time constraints. A simple supernetwork representation approach is introduced to generate the activity-journey-network (AJN) which expands the basic transportation network in both time and space dimensions. With the supernetwork representation, the dynamic activity-travel scheduling problem is transformed into a static network flow assignment problem. A heuristic algorithm is developed to find the path with the maximum utility in the AJN from the start node to the end node for each user. A numerical study is conducted to illustrate the application of the proposed model and solution algorithm for several transportation networks including large-scale real-world networks. It is shown that both the individual’s travel choice and group travel behaviour in a transportation network can be well studied by the proposed model.
- 14 July 2025
- Published by Faculty of Transport and Traffic Sciences in Promet - Traffic&Transportation
- Vol. 37 (4) , 911-930
Open AccessAn Activity-Journey-Network Approach for Modelling Travel Behaviour of Multiple User Classes Under Time Constraints
The flow pattern on a given transportation network at a given moment results from many users’ travel decisions which are made for some purposes, for example, participating in necessary activities such as work, eating and shopping. Consequently, the explicit modelling of the interaction between users’ activity and travel choice behaviour serves as a basic building block for long-term transportation planning and management. In this paper, an activity-based network user equilibrium model is proposed to study the dynamic activity-travel scheduling problem with multiple classes of users under time constraints. A simple supernetwork representation approach is introduced to generate the activity-journey-network (AJN) which expands the basic transportation network in both time and space dimensions. With the supernetwork representation, the dynamic activity-travel scheduling problem is transformed into a static network flow assignment problem. A heuristic algorithm is developed to find the path with the maximum utility in the AJN from the start node to the end node for each user. A numerical study is conducted to illustrate the application of the proposed model and solution algorithm for several transportation networks including large-scale real-world networks. It is shown that both the individual’s travel choice and group travel behaviour in a transportation network can be well studied by the proposed model.
- Open Access
- 1 October 2018
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 25 (5) , 1530-1537
An Activity-Based Model for the Estimation of Origin-Destination Matrix on Road Networks
Travel demand forecasting in terms of origin-destination (O-D) matrix estimation on transportation networks is an important topic in transportation research. The motivation of each trip is the user’s desire of conducting a compulsory...
- 1 October 2018
- Published by University of Slavonski Brod in Tehnicki vjesnik - Technical Gazette
- Vol. 25 (5) , 1530-1537
Open AccessAn Activity-Based Model for the Estimation of Origin-Destination Matrix on Road Networks
Travel demand forecasting in terms of origin-destination (O-D) matrix estimation on transportation networks is an important topic in transportation research. The motivation of each trip is the user’s desire of conducting a compulsory...
- 31 July 2012
- Published by Elsevier in International Journal of Production Economics
- Vol. 138 (1) , 117-124
Note on: Managing multi-echelon multi-item channels with trade allowances under credit period
- 31 July 2012
- Published by Elsevier in International Journal of Production Economics
- Vol. 138 (1) , 117-124
Note on: Managing multi-echelon multi-item channels with trade allowances under credit period
- 1 January 2011
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2254 (1) , 131-139
Network User Equilibrium Model for Scheduling Daily Activity Travel Patterns in Congested Networks
Travel demands are derived from the needs and the desires for participating in various activities, such as work, eating, and shopping. An understanding of the interaction between people's activity and travel choice behavior can serve as a base for long-term transport service planning and policy evaluation purposes. This paper proposes an activity-based network user equilibrium model for dealing with daily activity travel pattern (DATP) scheduling problems in congested networks, in which interdependency between people's activity and travel choices is comprehensively investigated. A diagonalization solution algorithm is developed to solve the scheduling problems. A remarkable merit of the developed solution algorithm is that it enables an automatic generation of individuals’ DATPs, implying obviation of an explicit enumeration of those patterns that often were required in many previous related studies. A numerical example is provided to illustrate the application of the proposed model and solution algorithm.
- 1 January 2011
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2254 (1) , 131-139
Network User Equilibrium Model for Scheduling Daily Activity Travel Patterns in Congested Networks
Travel demands are derived from the needs and the desires for participating in various activities, such as work, eating, and shopping. An understanding of the interaction between people's activity and travel choice behavior can serve as a base for long-term transport service planning and policy evaluation purposes. This paper proposes an activity-based network user equilibrium model for dealing with daily activity travel pattern (DATP) scheduling problems in congested networks, in which interdependency between people's activity and travel choices is comprehensively investigated. A diagonalization solution algorithm is developed to solve the scheduling problems. A remarkable merit of the developed solution algorithm is that it enables an automatic generation of individuals’ DATPs, implying obviation of an explicit enumeration of those patterns that often were required in many previous related studies. A numerical example is provided to illustrate the application of the proposed model and solution algorithm.