Parking planning is a key issue in the process of urban transportation planning. To formulate a high-quality planning scheme, an accurate estimate of the parking demand is critical. Most previous published studies were based primarily on parking survey data, which is both costly and inaccurate. Owing to limited data sources and simplified models, most of the previous research estimates the parking demand without consideration for the relationship between parking demand, land use, and traffic attributes, thereby causing a lack of accuracy. Thus, this study proposes a big-data-driven framework for parking demand estimation. The framework contains two steps. The first step is the parking zone division method, which is based on the statistical information grid and multidensity clustering algorithms. The second step is parking demand estimation, which is extracted by support vector machines posed in the form of a machine learning regression problem. The framework is evaluated using a case in the city center in Cangzhou, China.

To alleviate the problems of traffic congestion, excessive energy consumption, and the environmental pollution caused by private cars, it is essential to use public transportation (PT). However, passengers making multiple trips in a short time period must repeatedly make travel mode choices, purchase tickets, and wait for buses for each trip, which may negatively affect their preference for PT. In order to improve the attractiveness of PT, especially for passengers requiring multiple trips in a short time period, this paper proposes the one e-ticket customized bus service mode for passengers with multiple trips (OECBSM-PMT) by customized buses (CBs). Besides, a CB-routing optimization model for the OECBSM-PMT is also developed in this paper, formulated as a mixed-integer linear programming based on a vehicle routing problem with pickup and delivery and time windows (VRPPDTW). The model aims to maximize the profit and minimize the costs of operation with considering passengers with multi-trip requests, homogeneous CB fleets with pickup/delivery-time-window constraints, and mixed loads. A service effectiveness identification procedure based on genetic algorithm (GA) is proposed to cope with the calculation considering the characteristics of passengers with multiple trips. Finally, the proposed model and algorithm are verified and analyzed using the case of the 2022 Beijing Winter Olympic Games. It can be found from the results that the method can provide an optimized CB route plan and timetable, and the algorithm GA-I obtains better solutions than other solving strategies in most instances. The proposed OECBSM-PMT and corresponding optimized method can better adapt to diverse travel demands, significantly improve the convenience for passengers, especially those making multiple trips in a short time period and will eventually promote a higher level of public transport service.

Customized bus services typically focus on single‐trip requests, which often struggle to accommodate the growing needs for varied multiple trips in urban daily travel. This paper addresses the customized bus routing problem for passengers with multiple trips. A bi‐objective mathematical model is established for maximizing the operational profit and minimizing the travel costs by considering the characteristics of the multi‐trip requests and time‐dependent travel time. Besides, a novel profit objective function is proposed considering the service's completion status and the starting price. Since the proposed mixed integer linear programming model is an NP‐hard problem, a non‐dominated sorting genetic algorithm II‐based method is proposed to handle different sizes of instances. Finally, the instances with multi‐trip requests are carried out to test the accuracy of the model and the effectiveness of our method compared with Gurobi and the local search‐based multi‐objective algorithm approach.

With the rapid increase in vehicle population, solving difficult-to-park and inconvenient-to-park problems has become a necessity for sustainable transportation in major cities. This study investigated the parking resource allocation optimization problem based on a two-level grid model. To address this problem, first users’ travel data were matched to the map to obtain the distribution of both parking resources and demands. Second, key demand-supply imbalanced grids were identified. Subsequently, the parking resource allocation optimization problem was formulated as an integer linear programming (ILP) problem aiming to minimize the total cost, including the parking facility construction cost, users’ total walking distance, and the penalty for unserved users. Finally, a case study based on real-world data in Cangzhou was conducted to verify the feasibility and effectiveness of the proposed method. The results show that the imbalance between the supply and demand of parking resources can be effectively alleviated.