Search

This paper proposes an elastic demand network equilibrium model for networks with transit and walking modes. In Hong Kong, the multi-mode transit system services over 90% of the total journeys and the demand on it is continuously increasing. Transit and walking modes are related to each other as transit passengers have to walk to and from transit stops. In this paper, the multi-mode elastic-demand network equilibrium problem is formulated as a variational inequality problem where the combined mode and route choices are modeled in a hierarchical logit structures and the total travel demand for each origin-destination pair is explicitly given by an elastic demand function. In addition, the capacity constraint for transit vehicles and the effects of bi-directional flows on walkways are considered in the proposed model. All these congestion effects are taken into account for modeling the travel choices. A solution algorithm is developed to solve the multi-mode elastic-demand network equilibrium model. It is based on a Block Gauss-Seidel decomposition approach coupled with the method of successive averages. A numerical example is used to illustrate the application of the proposed model and solution algorithm. [ABSTRACT FROM AUTHOR]

An airport gate is the core resource of an airport operation, which is an important place for passengers to get on and off the aircraft and for maintaining aircraft. It is the prerequisite for other related dispatch. Effective and reasonable allocation of gates can reduce airport operating costs and increase passenger satisfaction. Therefore, an airport gate assignment problem (AGAP) needs to be urgently solved in the actual operation of the airport. In this paper, considering the actual operation of the airport, we formulate an integer programming model for AGAP by considering multiple constraints. The model aims to maximize the number of passengers on flights parked at the gate. A tabu search-based algorithm is designed to solve the problem. In the process of algorithm design, an effective initial solution is obtained. A unique neighborhood structure and search strategy for tabu search are designed. The algorithm can adapt to the dynamic scheduling of airports. Finally, tests are performed using actual airport data selected from Kunming Changshui International Airport in China. The experimental results indicate that the proposed method can enhance the local search ability and global search ability and get satisfactory results in a limited time. These results provide an effective support for the actual gate assignment in airport operations. [ABSTRACT FROM AUTHOR]

In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision-making has been confirmed by the positive feedback that was obtained from survey questionnaires. [ABSTRACT FROM AUTHOR]