Search

This study designs a limited-stop and local mixed bus service from the perspectives of both transit agencies and passengers based on a proposed optimization model. Close attention was paid to the increase in fares for the limited-stop service in the proposed model to offset the loss in bus fare. The objective function was to minimize the passenger travel time and bus agency costs; the decision variables were the stops for the limited-stop service and the headways of the limited-stop and local services; the constraints included the range of fare increases for the limited-stop service and other factors. The Lingo software and the genetic algorithm were compared in solving the proposed model from the aspects of solving time and results. Because the solutions for the model within the planning time and the influence of the global optimal solution upon parametric analysis were stable, the Lingo software was more suitable for the proposed model. Evaluations of the total costs for the mixed service and local-only service were carried out for different bus corridor lengths. The ratio of the fares for the limited-stop service to the fares for the local service must be within the appropriate range in order to take advantage of the limited-stop service. When the stop spacing and the bus corridor distance were longer, the mixed service was more competitive and noticeable. [ABSTRACT FROM AUTHOR]

The high-speed railways have made rapid developments in recent years. Fulfilling passenger demand and providing precise train services are the core problems to be solved in railway operation. This paper proposes an optimization strategy for demand-responsive transport to integrate train-stop planning and timetabling in high-speed railways. Passenger travel information, including their origins, destinations and expected departure times is taken as input. A mixed integer linear programming model is established to obtain an effective service plan, which consists of train stop pattern, passenger ride plan and train arrival/departure times at all stations. The optimization objective is to minimize the remaining passenger demand and train travel time. Finally, the proposed method is applied to a real-world case, and a series of several experiments are conducted to prove the efficiency and validity of the proposed model. The results suggest that the proposed approach could generate efficient service plans which are responsive to passenger demand.

This study designs a limited-stop and local mixed bus service from the perspectives of both transit agencies and passengers based on a proposed optimization model. Close attention was paid to the increase in fares for the limited-stop service in the proposed model to offset the loss in bus fare. The objective function was to minimize the passenger travel time and bus agency costs; the decision variables were the stops for the limited-stop service and the headways of the limited-stop and local services; the constraints included the range of fare increases for the limited-stop service and other factors. The Lingo software and the genetic algorithm were compared in solving the proposed model from the aspects of solving time and results. Because the solutions for the model within the planning time and the influence of the global optimal solution upon parametric analysis were stable, the Lingo software was more suitable for the proposed model. Evaluations of the total costs for the mixed service and local-only service were carried out for different bus corridor lengths. The ratio of the fares for the limited-stop service to the fares for the local service must be within the appropriate range in order to take advantage of the limited-stop service. When the stop spacing and the bus corridor distance were longer, the mixed service was more competitive and noticeable.

The Taiwan High Speed Rail (THSR) has recently added three additional stations to its original network. Although the three additional stations can improve accessibility to the system, these new stations can present difficulties in the transportation planning process, particularly for planning of train stops. The additional stations may benefit some passengers, but may also lengthen the travel time for the other passengers. Therefore, the main challenge faced by THSR is finding an efficient way to design appropriate stopping patterns. Past studies on stop planning usually adopted meta-heuristics or decomposition methods to solve this complex problem. Although these solution techniques can improve solution efficiency, none of them can guarantee the optimality of the solution and capture the transfer movement of different stopping patterns. In this research, we proposed an innovative network structure to address complex stop planning problems for high-speed rail systems. Given its special network structure, two binary integer programming models were developed to simultaneously form and determine the optimal stopping patterns for real-world THSR stop planning problems. An optimization process was also developed to accurately estimate the station transfer time corresponding to the variation in stopping patterns and passenger flow. Results of the case studies suggest that the proposed binary integer programming models exhibit superior solution quality and efficiency over existing exact optimization models. Consequently, using this stop planning optimization process can help high-speed rail system planners in designing optimal stopping patterns that correspond to passenger demand. Copyright © 2017 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Train stop planning provides appropriate service for travel demand and stations and plays a significant role in railway operation. This paper formulates stop planning from the point of view of direct travel between origin-destination (O-D) stations and proposes an analytical method to theoretically derive optimal service frequencies for O-D demand on different levels. Considering different O-D demand characteristics and train service types, we introduce the concept of stop probability to present the mathematical formulation for stop planning with the objective of minimizing per capita travel time, which is solved by an iterative algorithm combined with local search. The resulting optimal stop probabilities can be used to calculate the required service frequency for each train type serving different demand categories. Numerical examples, based on three real-life high-speed railway lines, demonstrate the validity of the proposed method. The proposed approach provides a more flexible and practical way for stop planning that explicitly takes into account the importance of different stations and passenger travel characteristics. [ABSTRACT FROM AUTHOR]