Stochastic programming model for integrating bus network design and dial-a-ride scheduling

ABSTRACT

Travel demands in remote areas are scattered and unstable. Thus, the integration of different types of transportation can be beneficial for improving the service level of transportation systems in remote areas. This study proposes a two-stage stochastic programming (SP) model for the integrated planning of a fixed-route–fixed-schedule bus service and dial-a-ride (DAR) transportation (DART) in remote areas. In the first stage, the route and timetable of a bus line are optimized as a set partitioning problem. In the second stage, DART is formulated as a pickup and delivery vehicle routing problem with time windows (PDVRPTW). A hybrid algorithm is developed to solve the two-stage SP problem. Case studies are presented to validate the planning model and the solution algorithm. Results show that the integration of bus and DAR services and the implementation of DART as PDVRPTW considerably reduce unserved demands and improve the service of the entire system.

KEYWORDS:

• Public transit
• bus
• dial-a-ride transportation
• vehicle routing
• stochastic programming
• heuristic

Acknowledgments

The first author is supported by the Minister of Science and Technology of Taiwan through research grant MOST 108-2628-E-002-003-MY3 and National Taiwan University through research grant NTUCDP-108L7751. The second author thanks the Minister of Science and Technology of Taiwan for the support of grant MOST 107-2119-M-002-018.

Disclosure statement

No potential conflict of interest was reported by the authors.Figure 9

Compliance with ethical standards

The authors declare that they have no conflict of interest. This paper does not contain any studies with human participants or animals performed by any of authors. Informed consent was obtained from all individual participants included in the study.