IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i23p10268-d1527904.html
   My bibliography  Save this article

Research on the Optimization of Urban–Rural Passenger and Postal Integration Operation Scheduling Based on Uncertainty Theory

Author

Listed:
  • Yunqiang Xue

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China
    Jiangxi Provincial Key Laboratory of Comprehensive Stereoscopic Traffic Information Perception and Fusion, East China Jiaotong University, Nanchang 330013, China)

  • Jiayu Liu

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China)

  • Haokai Tu

    (School of Transportation Engineering, Nanchang Jiaotong Institute, Nanchang 330013, China)

  • Guangfa Bao

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China)

  • Tong He

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China)

  • Yang Qiu

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China)

  • Yuhan Bi

    (School of Transportation Engineering, East China Jiaotong University, Nanchang 330013, China)

  • Hongzhi Guan

    (College of Architecture and Civil Engineering, Beijing University of Technology, Beijing 100124, China
    Xinjiang Key Laboratory of Green Construction and Smart Traffic Control of Transportation Infrastructure, Xinjiang University, Urumqi 830017, China)

Abstract

The integration of postal and passenger transport is an effective measure to enhance the utilization efficiency of passenger and freight transportation resources and to promote the sustainable development of urban–rural transit and logistics. This paper considers the uncertainty in passenger and freight demand as well as transit operation times, constructing an optimization model for integrated urban–rural transit and postal services based on uncertainty theory. Passenger and freight demand, along with the inverse uncertain distribution of events, serve as constraints, while minimizing passenger travel time and the cost for passenger transport companies are the optimization objectives. Taking into account the uncertainty of urban–rural bus travel time, the scheduling model is transformed into a robust form for scenarios involving single and multiple origin stations. The model is solved using an improved NSGA-II (Nondominated Sorting Genetic Algorithm II) to achieve effective coordinated scheduling of both passenger and freight services. Through a case study in Lotus County, Jiangxi Province, vehicle routing plans with varying levels of conservativeness were obtained. Comparing the results from different scenarios, it was found that when the total vehicle operating mileage increased from 1.96% to 62.26%, passenger transport costs rose from 2.95% to 62.66%, while the total passenger travel time decreased from 55.99% to 172.31%. In terms of optimizing costs and improving passenger travel efficiency, operations involving multiple starting stations for a single vehicle demonstrated greater advantages. Meanwhile, at a moderate level of robustness, it was easier to achieve a balance between operational costs and passenger travel time. The research findings provide theoretical support for improving travel conditions and resource utilization in rural areas, which not only helps enhance the operational efficiency of urban–rural transit but also contributes positively to promoting balanced urban–rural sustainable development and narrowing the urban–rural gap.

Suggested Citation

  • Yunqiang Xue & Jiayu Liu & Haokai Tu & Guangfa Bao & Tong He & Yang Qiu & Yuhan Bi & Hongzhi Guan, 2024. "Research on the Optimization of Urban–Rural Passenger and Postal Integration Operation Scheduling Based on Uncertainty Theory," Sustainability, MDPI, vol. 16(23), pages 1-24, November.
    • Handle: RePEc:gam:jsusta:v:16:y:2024:i:23:p:10268-:d:1527904
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/23/10268/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/16/23/10268/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    2. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    3. Goetschalckx, Marc & Jacobs-Blecha, Charlotte, 1989. "The vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 42(1), pages 39-51, September.
    4. Teodor Gabriel Crainic & Nicoletta Ricciardi & Giovanni Storchi, 2009. "Models for Evaluating and Planning City Logistics Systems," Transportation Science, INFORMS, vol. 43(4), pages 432-454, November.
    5. Yang, Tiannuo & Chu, Zhongzhu & Wang, Bailin, 2023. "Feasibility on the integration of passenger and freight transportation in rural areas: A service mode and an optimization model," Socio-Economic Planning Sciences, Elsevier, vol. 88(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    2. Yang, Senyan & Ning, Lianju & Shang, Pan & (Carol) Tong, Lu, 2020. "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    3. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    4. Rocio de la Torre & Canan G. Corlu & Javier Faulin & Bhakti S. Onggo & Angel A. Juan, 2021. "Simulation, Optimization, and Machine Learning in Sustainable Transportation Systems: Models and Applications," Sustainability, MDPI, vol. 13(3), pages 1-21, February.
    5. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    6. Daniele Crotti & Elena Maggi, 2023. "Social Responsibility and Urban Consolidation Centres in Sustainable Freight Transport Markets," Italian Economic Journal: A Continuation of Rivista Italiana degli Economisti and Giornale degli Economisti, Springer;Società Italiana degli Economisti (Italian Economic Association), vol. 9(2), pages 829-850, July.
    7. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    8. repec:plo:pone00:0151676 is not listed on IDEAS
    9. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    10. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
    11. Ali Najmi & Taha H. Rashidi & Alireza Abbasi & S. Travis Waller, 2017. "Reviewing the transport domain: an evolutionary bibliometrics and network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(2), pages 843-865, February.
    12. Wang, Jian & He, Xiaozheng & Peeta, Srinivas & Wang, Wei, 2022. "Globally convergent line search algorithm with Euler-based step size-determination method for continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 119-144.
    13. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    14. Abhishek, & Legros, Benjamin & Fransoo, Jan C., 2021. "Performance evaluation of stochastic systems with dedicated delivery bays and general on-street parking," Other publications TiSEM 09ed9572-d59c-4f28-a9c4-b, Tilburg University, School of Economics and Management.
    15. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    16. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    17. Harshad Khadilkar, 2017. "Data-Enabled Stochastic Modeling for Evaluating Schedule Robustness of Railway Networks," Transportation Science, INFORMS, vol. 51(4), pages 1161-1176, November.
    18. Tommaso Schettini & Michel Gendreau & Ola Jabali & Federico Malucelli, 2024. "A pattern-based timetabling strategy for a short-turning metro line," Public Transport, Springer, vol. 16(1), pages 1-37, March.
    19. Reinhardt, Line Blander & Clausen, Tommy & Pisinger, David, 2013. "Synchronized dial-a-ride transportation of disabled passengers at airports," European Journal of Operational Research, Elsevier, vol. 225(1), pages 106-117.
    20. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    21. Agnieszka Merkisz-Guranowska & Natalya Shramenko & Marcin Kiciński & Vladyslav Shramenko, 2023. "Simulation Model for Operational Planning of City Cargo Transportation by Trams in Conditions of Stochastic Demand," Energies, MDPI, vol. 16(10), pages 1-20, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:16:y:2024:i:23:p:10268-:d:1527904. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.