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

A Time-Space Network-Based Optimization Method for Scheduling Depot Drivers

Author

Listed:
  • Fei Peng

    (School of Automotive Engineering, Beijing Polytechnic, Beijing 100176, China)

  • Xian Fan

    (School of Automotive and Transportation Engineering, Hefei University of Technology, Hefei 230009, China)

  • Puxin Wang

    (School of Automotive Engineering, Beijing Polytechnic, Beijing 100176, China)

  • Mingan Sheng

    (School of Automotive and Transportation Engineering, Hefei University of Technology, Hefei 230009, China)

Abstract

The driver scheduling problem at Chinese electric multiple-unit train depots becomes more and more difficult in practice and is studied in very little research. This paper focuses on defining, modeling, and solving the depot driver scheduling problem which can determine driver size and driver schedule simultaneously. To solve this problem, we first construct a time-space network based on which we formulate the problem as a minimum-cost multi-commodity network flow problem. We then develop a Lagrangian relaxation heuristic to solve this network flow problem, where the upper bound heuristic is a two-phase method consisting of a greedy heuristic and a local search method. We conduct a computational study to test the effectiveness of our Lagrangian relaxation heuristic. The computational results also report the significance of the ratio of driver size to task size in the depot.

Suggested Citation

  • Fei Peng & Xian Fan & Puxin Wang & Mingan Sheng, 2022. "A Time-Space Network-Based Optimization Method for Scheduling Depot Drivers," Sustainability, MDPI, vol. 14(21), pages 1-19, November.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:21:p:14431-:d:962405
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/21/14431/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/21/14431/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Silke Jütte & Marc Albers & Ulrich W. Thonemann & Knut Haase, 2011. "Optimizing Railway Crew Scheduling at DB Schenker," Interfaces, INFORMS, vol. 41(2), pages 109-122, April.
    2. Ata Allah Taleizadeh & Aria Zaker Safaei & Arijit Bhattacharya & Alireza Amjadian, 2022. "Online peer-to-peer lending platform and supply chain finance decisions and strategies," Annals of Operations Research, Springer, vol. 315(1), pages 397-427, August.
    3. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    4. Maaike Hoogeboom & Wout Dullaert & David Lai & Daniele Vigo, 2020. "Efficient Neighborhood Evaluations for the Vehicle Routing Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 54(2), pages 400-416, March.
    5. Kim-Lin Chew & Johnny Pang & Qizhang Liu & Jihong Ou & Chung-Piaw Teo, 2001. "An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT," Annals of Operations Research, Springer, vol. 108(1), pages 111-122, November.
    6. M. Pour, Shahrzad & Drake, John H. & Ejlertsen, Lena Secher & Rasmussen, Kourosh Marjani & Burke, Edmund K., 2018. "A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(1), pages 341-352.
    7. Ralf Borndörfer & Christof Schulz & Stephan Seidl & Steffen Weider, 2017. "Integration of duty scheduling and rostering to increase driver satisfaction," Public Transport, Springer, vol. 9(1), pages 177-191, July.
    8. Jiaxi Wang & Manfred Gronalt & Yan Sun, 2017. "A two-stage approach to the depot shunting driver assignment problem with workload balance considerations," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-23, July.
    9. Lin, Boliang & Wu, Jianping & Lin, Ruixi & Wang, Jiaxi & Wang, Hui & Zhang, Xuhui, 2019. "Optimization of high-level preventive maintenance scheduling for high-speed trains," Reliability Engineering and System Safety, Elsevier, vol. 183(C), pages 261-275.
    10. Xu, Xiaoming & Li, Chung-Lun & Xu, Zhou, 2018. "Integrated train timetabling and locomotive assignment," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 573-593.
    11. Jorge Amaya & Paula Uribe, 2018. "A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 383-402, October.
    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. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    2. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.
    3. Breugem, T. & van Rossum, B.T.C. & Dollevoet, T. & Huisman, D., 2022. "A column generation approach for the integrated crew re-planning problem," Omega, Elsevier, vol. 107(C).
    4. Neufeld, Janis S. & Scheffler, Martin & Tamke, Felix & Hoffmann, Kirsten & Buscher, Udo, 2021. "An efficient column generation approach for practical railway crew scheduling with attendance rates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1113-1130.
    5. Zhang, Fengxia & Shen, Jingyuan & Liao, Haitao & Ma, Yizhong, 2021. "Optimal preventive maintenance policy for a system subject to two-phase imperfect inspections," Reliability Engineering and System Safety, Elsevier, vol. 205(C).
    6. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    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. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    9. Fuentes, Manuel & Cadarso, Luis & Marín, Ángel, 2019. "A hybrid model for crew scheduling in rail rapid transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 248-265.
    10. Lin, Boliang & Zhao, Yinan, 2021. "Synchronized optimization of EMU train assignment and second-level preventive maintenance scheduling," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    11. Viera Sukalova & Zuzana Stofkova & Jana Stofkova, 2022. "Human Resource Management in Sustainable Development," Sustainability, MDPI, vol. 14(21), pages 1-16, November.
    12. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    13. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2021. "Optimal operation and maintenance scheduling in m-out-of-n standby systems with reusable elements," Reliability Engineering and System Safety, Elsevier, vol. 211(C).
    14. Aarabi, Fatemeh & Batta, Rajan, 2020. "Scheduling spatially distributed jobs with degradation: Application to pothole repair," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).
    15. Tri Basuki Joewono & Muhamad Rizki & Jeanly Syahputri, 2021. "Does Job Satisfaction Influence the Productivity of Ride-Sourcing Drivers? A Hierarchical Structural Equation Modelling Approach for the Case of Bandung City Ride-Sourcing Drivers," Sustainability, MDPI, vol. 13(19), pages 1-17, September.
    16. Christian Rählmann & Ulrich W. Thonemann, 2020. "Railway crew scheduling with semi-flexible timetables," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 835-862, December.
    17. Zhao, Xian & Dai, Ying & Qiu, Qingan & Wu, Yaguang, 2022. "Joint optimization of mission aborts and allocation of standby components considering mission loss," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    18. Arjun Paul & Ravi Shankar Kumar & Chayanika Rout & Adrijit Goswami, 2021. "A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 962-993, December.
    19. Adisorn Leelasantitham & Thammavich Wongsamerchue & Yod Sukamongkol, 2024. "Economic Pricing in Peer-to-Peer Electrical Trading for a Sustainable Electricity Supply Chain Industry in Thailand," Energies, MDPI, vol. 17(5), pages 1-19, March.
    20. Kai Kang & Wei Pu & Yanfang Ma & Xiaoyu Wang, 2018. "Bi-objective inventory allocation planning problem with supplier selection and carbon trading under uncertainty," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-25, November.

    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:14:y:2022:i:21:p:14431-:d:962405. 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.