The One E-Ticket Customized Bus Service Mode for Passengers with Multiple Trips and the Routing Problem

Yunlin Guan, Yun Wang, Xuedong Yan, Haonan Guo and Yi Zhao
Additional contact information
Yunlin Guan: MOT Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Yun Wang: MOT Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Xuedong Yan: MOT Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Haonan Guo: MOT Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Yi Zhao: Standards and Metrology Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing 100081, China

Sustainability, 2022, vol. 14, issue 4, 1-17

Abstract: 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.

Keywords: customized bus; one e-ticket service mode; vehicle routing problem (VRP); multiple trips; genetic algorithm (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2071-1050/14/4/2124/pdf (application/pdf)
https://www.mdpi.com/2071-1050/14/4/2124/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:14:y:2022:i:4:p:2124-:d:748259

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().