A Multi-Objective Programming Approach to Design Feeder Bus Route for High-Speed Rail Stations

Abstract

The quality of route design can greatly affect the operational efficiency of feeder bus service for high-speed rail stations. A bi-objective optimization formulation is established to consider the trade-off between two conflicting optimization objectives, namely maximizing the travel demand that can be served and minimizing the feeder bus route length. The Pareto optimal solutions of the discrete mathematical formulation are generated by the exact ε-constraint method. We test the proposed approach with a numerical example on an actual size scale. The results indicate that the computational efficiency of the solution approach is encouraging, and a series of route design plans and location stop plans are generated simultaneously in a short time. A numerical example also shows that as the passengers’ maximum acceptable walking distance increases, more travel demand can be served when the route length does not change much. Benefits brought by increasing feeder bus route length are analyzed and the robustness of obtained solutions is verified. The comparison of our approach and an existing approach is also presented to demonstrate that our approach can generate better solutions.

Bus Route Design Problem for Rural Tourism Objectives: A Multiobjective Approach

“…Feng et al set up a new bus network optimization model that reduced passenger transit time and transfer times by optimizing route design [25]. Similarly, in the two-level optimization model established by Guo et al, the researchers regarded maximizing the serviceable demand as the upper objective and minimizing the length of the receiving bus line as the lower objective, and they fnally generated the route scheme under the actual road network conditions [26]. To solve these transit route design models, a common solution includes the generation of an initial set of routes, the selection of feasible routes based on objectives and constraints, and the evaluation of efciency.…”

Locating Movable Parcel Lockers under Stochastic Demands

“…Guo et al [25] studied the integrated optimization of community shuttle stops and routes, and developed a non-dominated sorting genetic based algorithm to solve the proposed bi-objective programing formulation. Guo et al [26] determined the stop location and running route of the feeder bus service for high-speed rail stations through a bi-objective mathematical model, and used the exact ε-constraint method to solve the problem. However, there is less research on the location optimization of parcel lockers.…”

Compatibility-Based Approach for Routing and Scheduling the Demand Responsive Connector

“…The optimization goal is to minimize the disutility of passengers and the operation cost. For type P passengers, the disutility is measured by the weighted sum of passengers' arrival time deviations and their ride time deviations (see (36)). Similarly, the disutility of type D passengers is calculated as the weighted sum of passenger's boarding time deviations and their ride time deviations (see (37)).…”

“…Focus on FBNDP, [35] optimized the collection points and vehicle routes to minimize the access cost of passengers and the operation cost. Guo et al designed an exact -constraint method to solve the FBNDP, and discussed the influence of maximum walk time of passengers and route length constraint [36]. Lee et al extended the regional DRC to allow alternative transit stations for passengers [37].…”