Yichen Qin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yichen Qin has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Felix Tung Sun Chan
Department of Decision Sciences, Macau University of Science and Technology, Macao SAR, China
4 shared publications - Kam K. H. Ng
The Hong Kong Polytechnic University
4 shared publications - Sai-Ho Chung
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
2 shared publications T. Qu
2 shared publicationsXuting Sun
Shanghai University
2 shared publications- Zhengxu Wang
School of Business Administration, Institute of Supply Chain Analytics, Dongbei University of Finance and Economics, Dalian, China
2 shared publications
Latest Publications
- 20 September 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Drone pharmaceutical delivery network design considering operational risks
- 20 September 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Drone pharmaceutical delivery network design considering operational risks
- 1 February 2026
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (15) , 1-29
Synchronising electric vehicle fleet’s routing and recharging with recharge pile renting at external stations: a column generation-based approach
- 1 February 2026
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (15) , 1-29
Synchronising electric vehicle fleet’s routing and recharging with recharge pile renting at external stations: a column generation-based approach
- 25 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3498-3509
Promoting Riders’ Delivery Safety and Customer Satisfaction Through a Horizontal Collaboration Mechanism—An Optimization Approach Under Meals’ Preparation Delay
Online food delivery (OFD) is a prevalent business mode in cities. Besides customer satisfaction improvements, riders’ safety issues have received much attention. Overwhelming customer orders and merchants’ tardiness in preparing meals are two causes leading to road accidents, as the rider needs to absorb the meal delay on the route. To promote riders’ delivery safety, an order exchange and redispatch mechanism is proposed to establish a horizontal collaboration coordinated by OFD platform. The mechanism enables riders to return their undertaking order back to the OFD platform through smart phone when deem it necessary. Based on the real-time information collected from mobile devices, the OFD platform identifies potential riders then encourages them to intake the returned orders with an extra incentive. Several optimization models are formulated to describe the actions from different parties. A tailored Artificial Bee Conoly (ABC) algorithm is designed, which efficiently solves the order redispatch and pricing problems for platform. The collaboration mechanism is validated through extensive computational experiments, and the problem instances are created based on the data collected from one new town in Shanghai City. Managerial insights suggest that the extra incentive should be increased at a moderate level to balance the solution efficiency and quality.
- 25 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 3498-3509
Promoting Riders’ Delivery Safety and Customer Satisfaction Through a Horizontal Collaboration Mechanism—An Optimization Approach Under Meals’ Preparation Delay
Online food delivery (OFD) is a prevalent business mode in cities. Besides customer satisfaction improvements, riders’ safety issues have received much attention. Overwhelming customer orders and merchants’ tardiness in preparing meals are two causes leading to road accidents, as the rider needs to absorb the meal delay on the route. To promote riders’ delivery safety, an order exchange and redispatch mechanism is proposed to establish a horizontal collaboration coordinated by OFD platform. The mechanism enables riders to return their undertaking order back to the OFD platform through smart phone when deem it necessary. Based on the real-time information collected from mobile devices, the OFD platform identifies potential riders then encourages them to intake the returned orders with an extra incentive. Several optimization models are formulated to describe the actions from different parties. A tailored Artificial Bee Conoly (ABC) algorithm is designed, which efficiently solves the order redispatch and pricing problems for platform. The collaboration mechanism is validated through extensive computational experiments, and the problem instances are created based on the data collected from one new town in Shanghai City. Managerial insights suggest that the extra incentive should be increased at a moderate level to balance the solution efficiency and quality.
- 7 June 2022
- Published by Taylor & Francis in Transportation Letters
- Vol. 15 (6) , 584-607
The impacts of longitudinal separation, efficiency loss, and cruise speed adjustment in robust terminal traffic flow problem under uncertainty
Minimization of approaching time and maximization of the utilization of air route and airport resources are the two ultimate goals of air traffic control. This research considers arrival sequence and the uncertain arrival times at entry waypoints of flights and investigates the impact of air traffic controller specific parameters in the model. The two-stage optimization framework will first determine a deterministic schedule and optimize the approaching time while considering additional longitudinal separation, efficiency loss from deterministic schedule, and cruise speed adjustment in the second-stage optimization model via sample average approximation. The numerical experiments suggested an efficiency loss of 20%, which can absorb the empirical probabilistic lateness at entry waypoints with the real-world data. The proposed method could determine the estimated average delay time at runways with different settings of additional buffer for longitudinal separation and trade-off parameters between the estimated average delay time and estimated penalty cost of cruise speed adjustment.
- 7 June 2022
- Published by Taylor & Francis in Transportation Letters
- Vol. 15 (6) , 584-607
The impacts of longitudinal separation, efficiency loss, and cruise speed adjustment in robust terminal traffic flow problem under uncertainty
Minimization of approaching time and maximization of the utilization of air route and airport resources are the two ultimate goals of air traffic control. This research considers arrival sequence and the uncertain arrival times at entry waypoints of flights and investigates the impact of air traffic controller specific parameters in the model. The two-stage optimization framework will first determine a deterministic schedule and optimize the approaching time while considering additional longitudinal separation, efficiency loss from deterministic schedule, and cruise speed adjustment in the second-stage optimization model via sample average approximation. The numerical experiments suggested an efficiency loss of 20%, which can absorb the empirical probabilistic lateness at entry waypoints with the real-world data. The proposed method could determine the estimated average delay time at runways with different settings of additional buffer for longitudinal separation and trade-off parameters between the estimated average delay time and estimated penalty cost of cruise speed adjustment.
- 1 April 2020
- Published by Elsevier in Applied Soft Computing
- Vol. 89
A two-stage robust optimisation for terminal traffic flow problem
- 1 April 2020
- Published by Elsevier in Applied Soft Computing
- Vol. 89
A two-stage robust optimisation for terminal traffic flow problem
- 1 March 2019
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 67, 491-509
A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- 1 March 2019
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 67, 491-509
A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
- Open Access
- 26 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-16
A Family of Heuristic-Based Inequalities for Maximizing Overall Safety Margins in Aircraft Parking Stands Arrangement Problems
We consider the problem of arranging a set of aircraft in a maintenance hangar operated by an independent aircraft service provider. The overall safety margins of the parking layout need to be maximized within the limited available space, measured by the weighted sum of the individual discrete safety margins of each aircraft. A mixed-integer linear programming model is developed, and the positions of the aircraft are determined by the position-controlling binary variables associated with a set of revised No-Fit Polygons (NFPs). Due to the nonconvex irregular shape of aircraft, the model involves a great number of binary variables associated with the revised NFP. The default branch-and-bound algorithm is inefficient in solving such a model as the infeasibility information of the precedent visited solution cannot be directly utilized by the default method to update the bounds. A heuristic algorithm is developed to provide practical solutions, and the intermediate infeasible solutions identified during searching are utilized to develop valid and approximate inequalities, tightening the optimality gap. The computational results demonstrate that the addition of inequalities improves the computational efficiency in solving a wide range of instances and in tightening the optimality gap while the stopping criterion is met.
- 26 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-16
Open AccessA Family of Heuristic-Based Inequalities for Maximizing Overall Safety Margins in Aircraft Parking Stands Arrangement Problems
We consider the problem of arranging a set of aircraft in a maintenance hangar operated by an independent aircraft service provider. The overall safety margins of the parking layout need to be maximized within the limited available space, measured by the weighted sum of the individual discrete safety margins of each aircraft. A mixed-integer linear programming model is developed, and the positions of the aircraft are determined by the position-controlling binary variables associated with a set of revised No-Fit Polygons (NFPs). Due to the nonconvex irregular shape of aircraft, the model involves a great number of binary variables associated with the revised NFP. The default branch-and-bound algorithm is inefficient in solving such a model as the infeasibility information of the precedent visited solution cannot be directly utilized by the default method to update the bounds. A heuristic algorithm is developed to provide practical solutions, and the intermediate infeasible solutions identified during searching are utilized to develop valid and approximate inequalities, tightening the optimality gap. The computational results demonstrate that the addition of inequalities improves the computational efficiency in solving a wide range of instances and in tightening the optimality gap while the stopping criterion is met.