Dynamic vehicle routing problem for flexible buses considering stochastic requests. (March 2023)
- Record Type:
- Journal Article
- Title:
- Dynamic vehicle routing problem for flexible buses considering stochastic requests. (March 2023)
- Main Title:
- Dynamic vehicle routing problem for flexible buses considering stochastic requests
- Authors:
- Ma, Wanjing
Zeng, Lin
An, Kun - Abstract:
- Highlights: A demand responsive flexible bus system is proposed using minibuses and the bus route changes in real-time to service the dynamic demand. A two-stage stochastic programming model with recourse is constructed to handle the dynamic current requests and stochastic future requests. A vector-similarity-based clustering and adaptive large neighborhood searching solution algorithm is proposed to solve the problem. The proposed framework is tested under four real cases in Shanghai based on the taxi order data. Abstract: Flexible buses provide on-demand services to one or more local communities in a specific geographical area. Bus routes can be adjusted dynamically according to real-time passenger demand in a cost-effective manner. This study investigated the dynamic bus-routing problem considering stochastic future passenger demand. A two-stage stochastic programming model was formulated to minimise the total vehicle travel time cost and penalty for rejecting requests. A rolling horizon scheme was adopted to handle the dynamic changes in passenger requests and vehicle routes. A vector-similarity-based clustering and adaptive large neighbourhood searching (VSC-ALNS) algorithm was developed to solve this problem. Vehicles and passengers were matched and clustered into groups based on vector similarity, and vehicle routes were generated using an adaptive large-neighbourhood search algorithm for each cluster. The effectiveness of the proposed method was evaluated in fourHighlights: A demand responsive flexible bus system is proposed using minibuses and the bus route changes in real-time to service the dynamic demand. A two-stage stochastic programming model with recourse is constructed to handle the dynamic current requests and stochastic future requests. A vector-similarity-based clustering and adaptive large neighborhood searching solution algorithm is proposed to solve the problem. The proposed framework is tested under four real cases in Shanghai based on the taxi order data. Abstract: Flexible buses provide on-demand services to one or more local communities in a specific geographical area. Bus routes can be adjusted dynamically according to real-time passenger demand in a cost-effective manner. This study investigated the dynamic bus-routing problem considering stochastic future passenger demand. A two-stage stochastic programming model was formulated to minimise the total vehicle travel time cost and penalty for rejecting requests. A rolling horizon scheme was adopted to handle the dynamic changes in passenger requests and vehicle routes. A vector-similarity-based clustering and adaptive large neighbourhood searching (VSC-ALNS) algorithm was developed to solve this problem. Vehicles and passengers were matched and clustered into groups based on vector similarity, and vehicle routes were generated using an adaptive large-neighbourhood search algorithm for each cluster. The effectiveness of the proposed method was evaluated in four cases with different demand intensities using Shanghai taxi order data. The results indicate that flexible buses are more suitable for moderate demand cases, ranging from 20 to 50 requests per square kilometre per hour. … (more)
- Is Part Of:
- Transportation research. Volume 148(2023)
- Journal:
- Transportation research
- Issue:
- Volume 148(2023)
- Issue Display:
- Volume 148, Issue 2023 (2023)
- Year:
- 2023
- Volume:
- 148
- Issue:
- 2023
- Issue Sort Value:
- 2023-0148-2023-0000
- Page Start:
- Page End:
- Publication Date:
- 2023-03
- Subjects:
- Flexible bus -- Dynamic routing -- Passenger–vehicle matching -- Two-stage stochastic programming -- Adaptive large neighbourhood search
Transportation -- Periodicals
Transportation -- Technological innovations -- Periodicals
388.011 - Journal URLs:
- http://www.sciencedirect.com/science/journal/0968090X ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.trc.2023.104030 ↗
- Languages:
- English
- ISSNs:
- 0968-090X
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 9026.274620
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 25939.xml