Saiqi Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Saiqi Zhou has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Bin Ji
5 shared publications- Bin Ji
School of Traffic & Transportation Engineering, Central South University, Changsha 410075, China
4 shared publications - Dezhi Zhang
School of Traffic and Transportation Engineering, Central South University, Changsha, China
4 shared publications Shuangyan Li
4 shared publicationsDezhi Zhang
3 shared publicationsSamson S. Yu
School of Engineering Deakin University Geelong Waurn Ponds Campus, Victoria 3216 Australia
3 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 20 (1) , e70325
Optimizing Dynamic Ambulance Scheduling in Emergency Medical Services: An Analysis of Sharing Ambulance
With increasing pressure on emergency medical services (EMS) due to population growth and natural disasters, effective scheduling is essential for optimizing ambulance resources and ensuring timely responses. This study addresses the dynamic ambulance scheduling problem in EMS, with a focus on minimizing patient waiting times and evaluating several ambulance sharing strategies. Specifically, we examine various strategies, including non‐sharing ambulances, sharing ambulances and sharing ambulances with a priority mechanism, within both static and dynamic scheduling contexts to assess their performance. To tackle the scheduling problem, we propose a solution framework that integrates initial solution construction with a dynamic insertion procedure for real‐time patient calls. Numerical experiments conducted on the EMS system of Zhuzhou City reveal significant differences between static and dynamic scheduling methods. The results indicate that while shared ambulance strategies offer limited benefits under constrained conditions, they effectively reduce patient waiting times when resources are adequate. Furthermore, the inclusion of a priority mechanism enhances efficiency by expediting ambulance assignments and maintaining matching degrees across hospitals, which provides 5.52% savings in waiting time compared to the standard sharing ambulance mode in the tested examples. This research advances the understanding of ambulance scheduling strategies and provides insights for improving service delivery.
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 20 (1) , e70325
Open AccessOptimizing Dynamic Ambulance Scheduling in Emergency Medical Services: An Analysis of Sharing Ambulance
With increasing pressure on emergency medical services (EMS) due to population growth and natural disasters, effective scheduling is essential for optimizing ambulance resources and ensuring timely responses. This study addresses the dynamic ambulance scheduling problem in EMS, with a focus on minimizing patient waiting times and evaluating several ambulance sharing strategies. Specifically, we examine various strategies, including non‐sharing ambulances, sharing ambulances and sharing ambulances with a priority mechanism, within both static and dynamic scheduling contexts to assess their performance. To tackle the scheduling problem, we propose a solution framework that integrates initial solution construction with a dynamic insertion procedure for real‐time patient calls. Numerical experiments conducted on the EMS system of Zhuzhou City reveal significant differences between static and dynamic scheduling methods. The results indicate that while shared ambulance strategies offer limited benefits under constrained conditions, they effectively reduce patient waiting times when resources are adequate. Furthermore, the inclusion of a priority mechanism enhances efficiency by expediting ambulance assignments and maintaining matching degrees across hospitals, which provides 5.52% savings in waiting time compared to the standard sharing ambulance mode in the tested examples. This research advances the understanding of ambulance scheduling strategies and provides insights for improving service delivery.
- 23 August 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 167
Pickup and delivery problem with electric vehicles and time windows considering queues
- 23 August 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 167
Pickup and delivery problem with electric vehicles and time windows considering queues
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 12216-12227
A Two-Echelon Capacitated Vehicle Routing Problem With Sharing Satellite Resources
Collaboration vehicle routing has garnered increasing attention recently because it can help enterprises reduce costs by sharing resources. This paper addresses a novel two-echelon capacitated vehicle routing problem with sharing satellite resources (2E-CVRPSSR), which arises with the development of e-commerce and the Sharing economy in city logistics. In this problem, goods are delivered within a two-echelon routing network, where satellites are used to consolidate and transfer goods between first- and second-echelon routing. Moreover, the second-echelon vehicles can depart from and return to different satellites. A mixed integer linear programming model is first presented, and an adaptive large neighborhood search algorithm with several new search operators and strategies is proposed to solve this problem. The numerical results show that the proposed algorithm can effectively solve the 2E-CVRPSSR. Moreover, an average transportation cost savings of 6.29% can be obtained by sharing satellite resources. In addition, geographic analysis indicates that the layout of the depot, satellites, and customers largely impacts the economic advantages of sharing satellite resources. Specifically, the highest economic benefits are achieved when the satellites are distributed from nearest to farthest from the depot, with customers located between nearby and distant satellites and with satellites of large enough capacity close to the depot.
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 12216-12227
A Two-Echelon Capacitated Vehicle Routing Problem With Sharing Satellite Resources
Collaboration vehicle routing has garnered increasing attention recently because it can help enterprises reduce costs by sharing resources. This paper addresses a novel two-echelon capacitated vehicle routing problem with sharing satellite resources (2E-CVRPSSR), which arises with the development of e-commerce and the Sharing economy in city logistics. In this problem, goods are delivered within a two-echelon routing network, where satellites are used to consolidate and transfer goods between first- and second-echelon routing. Moreover, the second-echelon vehicles can depart from and return to different satellites. A mixed integer linear programming model is first presented, and an adaptive large neighborhood search algorithm with several new search operators and strategies is proposed to solve this problem. The numerical results show that the proposed algorithm can effectively solve the 2E-CVRPSSR. Moreover, an average transportation cost savings of 6.29% can be obtained by sharing satellite resources. In addition, geographic analysis indicates that the layout of the depot, satellites, and customers largely impacts the economic advantages of sharing satellite resources. Specifically, the highest economic benefits are achieved when the satellites are distributed from nearest to farthest from the depot, with customers located between nearby and distant satellites and with satellites of large enough capacity close to the depot.
- 19 December 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 434
A MILP model and heuristic method for the time-dependent electric vehicle routing and scheduling problem with time windows
- 19 December 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 434
A MILP model and heuristic method for the time-dependent electric vehicle routing and scheduling problem with time windows
- 7 October 2023
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (2) , 658-691
A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
Addressed in this study is a vehicle routing problem with two‐dimensional loading constraints and time windows (2L‐CVRPTW), aiming to minimize the transportation cost while satisfying the two‐dimensional loading and routing constraints with time windows. To solve this problem, for the first time a mixed‐integer linear programming model is formulated with considering practical last‐in‐first‐out loading constraints, and a branch‐and‐price‐based (BP‐based) heuristic is proposed based on a set partitioning formulation. In the heuristic, a modified labeling algorithm is proposed for the complex pricing problem, which is a relaxation of the elementary shortest path problem with resource constraints and two‐dimensional loading constraints. Therein, an effective Tabu‐maximum open space packing heuristic is proposed to verify the feasibility of the two‐dimensional packing problem of each route generated by the labeling algorithm. In addition, effective accelerating and branching strategies are introduced to improve the solving efficiency of the heuristic. To evaluate the effectiveness and the advantages of the proposed heuristic, extensive computational experiments are performed based on the generated instances. The computational results show that the proposed BP‐based heuristic can effectively solve the 2L‐CVRPTW, in which the optimal solutions can be achieved much faster than CPLEX in small‐scale problems. Relationships between the transportation cost and the characteristics of the instances are analyzed. The stability of the algorithm and the effectiveness of the accelerating strategies are verified and discussed.
- 7 October 2023
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (2) , 658-691
A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
Addressed in this study is a vehicle routing problem with two‐dimensional loading constraints and time windows (2L‐CVRPTW), aiming to minimize the transportation cost while satisfying the two‐dimensional loading and routing constraints with time windows. To solve this problem, for the first time a mixed‐integer linear programming model is formulated with considering practical last‐in‐first‐out loading constraints, and a branch‐and‐price‐based (BP‐based) heuristic is proposed based on a set partitioning formulation. In the heuristic, a modified labeling algorithm is proposed for the complex pricing problem, which is a relaxation of the elementary shortest path problem with resource constraints and two‐dimensional loading constraints. Therein, an effective Tabu‐maximum open space packing heuristic is proposed to verify the feasibility of the two‐dimensional packing problem of each route generated by the labeling algorithm. In addition, effective accelerating and branching strategies are introduced to improve the solving efficiency of the heuristic. To evaluate the effectiveness and the advantages of the proposed heuristic, extensive computational experiments are performed based on the generated instances. The computational results show that the proposed BP‐based heuristic can effectively solve the 2L‐CVRPTW, in which the optimal solutions can be achieved much faster than CPLEX in small‐scale problems. Relationships between the transportation cost and the characteristics of the instances are analyzed. The stability of the algorithm and the effectiveness of the accelerating strategies are verified and discussed.
- 18 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 244
Two-echelon vehicle routing problem with direct deliveries and access time windows
- 18 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 244
Two-echelon vehicle routing problem with direct deliveries and access time windows
- 15 March 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 223
Hub-and-spoke network design for container shipping in inland waterways
- 15 March 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 223
Hub-and-spoke network design for container shipping in inland waterways
- Open Access
- 23 November 2022
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 10 (12) , 1811
Branch-And-Price Algorithm for the Tramp Ship Routing and Scheduling Problem Considering Ship Speed and Payload
In recent years, increasing fuel prices, depressed market conditions and air pollution issues have brought huge challenges to the tramp shipping industry. This work investigates the tramp ship routing and scheduling problem considering ship speeds and payloads, aiming at minimizing ship fuel consumption. A mixed integer non-linear programming model with a discretized speed variable and a set partitioning model for this problem is established, and a branch-and-price algorithm is proposed to solve the problem. Through the column generation approach, the problem at each branch-and-bound node is decomposed into a linear programming master problem and a pricing problem of the elementary shortest path with resource constraints. A labeling algorithm is adopted for solving the pricing problem. Multiple groups of instances are generated to test the effectiveness of the proposed model and algorithm and analyze the impacts of ship speed, payload, and speed discretization on the solution. Computational experiments are conducted, which verifies the proposed scheduling routing method for tramp ships and confirms that adopting the proposed model can effectively reduce fuel consumption of tramp ships which can not only deepen the theory of tramp routing and scheduling, but also provide theoretical guidance to tramp ship company. The branch-and-price algorithm can effectively solve large-scale tramp ship routing and scheduling problems. Reasonable number of speed discretization points can bring a desirable trade-off between solution accuracy and algorithm runtime.
- 23 November 2022
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 10 (12) , 1811
Open AccessBranch-And-Price Algorithm for the Tramp Ship Routing and Scheduling Problem Considering Ship Speed and Payload
In recent years, increasing fuel prices, depressed market conditions and air pollution issues have brought huge challenges to the tramp shipping industry. This work investigates the tramp ship routing and scheduling problem considering ship speeds and payloads, aiming at minimizing ship fuel consumption. A mixed integer non-linear programming model with a discretized speed variable and a set partitioning model for this problem is established, and a branch-and-price algorithm is proposed to solve the problem. Through the column generation approach, the problem at each branch-and-bound node is decomposed into a linear programming master problem and a pricing problem of the elementary shortest path with resource constraints. A labeling algorithm is adopted for solving the pricing problem. Multiple groups of instances are generated to test the effectiveness of the proposed model and algorithm and analyze the impacts of ship speed, payload, and speed discretization on the solution. Computational experiments are conducted, which verifies the proposed scheduling routing method for tramp ships and confirms that adopting the proposed model can effectively reduce fuel consumption of tramp ships which can not only deepen the theory of tramp routing and scheduling, but also provide theoretical guidance to tramp ship company. The branch-and-price algorithm can effectively solve large-scale tramp ship routing and scheduling problems. Reasonable number of speed discretization points can bring a desirable trade-off between solution accuracy and algorithm runtime.
- 8 September 2022
- Published by American Society of Civil Engineers (ASCE)
- p. 1202-1212
Branch-and-Price Approach for Two-Dimensional Loading Constrained Vehicle Routing Problem with Simultaneous Pickup and Delivery
This study addresses a widespread practical simultaneous pickup and delivery problem, where pickup and delivery requests for transporting are non-stackable rectangular items. To solve this problem, a branch-and-price approach is proposed based on a set partitioning formulation. In the approach, a strong labeling algorithm with an efficient packing heuristic are proposed to deal with the exploration and the packing procedure in pricing problem. Extensive experiments based on the widely used benchmarks are conducted. The results demonstrate the efficiency and superiority of the proposed approach for solving the 2L-SPD. Moreover, comparison results infer that splitting customers with both pickup and delivery into pickup-only customers and delivery-only customers increases the computational burden under the branch-and-price approach.
- 8 September 2022
- Published by American Society of Civil Engineers (ASCE)
- p. 1202-1212
Branch-and-Price Approach for Two-Dimensional Loading Constrained Vehicle Routing Problem with Simultaneous Pickup and Delivery
This study addresses a widespread practical simultaneous pickup and delivery problem, where pickup and delivery requests for transporting are non-stackable rectangular items. To solve this problem, a branch-and-price approach is proposed based on a set partitioning formulation. In the approach, a strong labeling algorithm with an efficient packing heuristic are proposed to deal with the exploration and the packing procedure in pricing problem. Extensive experiments based on the widely used benchmarks are conducted. The results demonstrate the efficiency and superiority of the proposed approach for solving the 2L-SPD. Moreover, comparison results infer that splitting customers with both pickup and delivery into pickup-only customers and delivery-only customers increases the computational burden under the branch-and-price approach.