Hanyu Gu
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
Hanyu Gu has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Yakov Zinder
University of Technology Sydney
17 shared publications - Julia Memar
University of Technology Sydney
6 shared publications - Oliver G. Czibula
Univ Technol Sydney, Sch Math & Phys Sci, 15 Broadway, Ultimo, NSW 2007, Australia
4 shared publications Yugeng Xi
Department of Automation , School of Electronics , Information and Electrical Engineering, Shanghai Jiaotong University, Shanghai 200240, China
4 shared publications- Alireza Etminaniesfahani
School of Mathematical and Physical Sciences, University of Technology Sydney, Sydney, Australia
3 shared publications - Andreas Schutt
DATA61, CSIRO
3 shared publications
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 137-155
Last-Mile Logistics in Retail: Maximising the Number of Customers Served and Minimising the Total Travel Time
- 2 January 2026
- Published by Springer Nature
- p. 137-155
Last-Mile Logistics in Retail: Maximising the Number of Customers Served and Minimising the Total Travel Time
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 9154-9168
Making Knowledge Distillation Open Again
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 35, 9154-9168
Making Knowledge Distillation Open Again
- 6 July 2025
- Published by Springer Nature
- p. 270-285
An Improved Discrete Optimisation Procedure with Comparison to Constraint Programming
- 6 July 2025
- Published by Springer Nature
- p. 270-285
An Improved Discrete Optimisation Procedure with Comparison to Constraint Programming
- 23 December 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 41-68
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- 23 December 2023
- Published by Springer Nature in Annals of Operations Research
- Vol. 338 (1) , 41-68
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
- 10 January 2023
- Published by Springer Nature in Journal of Heuristics
- Vol. 29 (1) , 139-175
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem
- 10 January 2023
- Published by Springer Nature in Journal of Heuristics
- Vol. 29 (1) , 139-175
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem
- 17 December 2022
- Published by Springer Nature in SN Computer Science
- Vol. 4 (2) , 1-10
A Forward–Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
- 17 December 2022
- Published by Springer Nature in SN Computer Science
- Vol. 4 (2) , 1-10
A Forward–Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem
- Open Access
- 18 November 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 328 (1) , 821-857
Minimizing patients total clinical condition deterioration in operating theatre departments
The operating theatre is the most crucial and costly department in a hospital due to its expensive resources and high patient admission rate. Efficiently allocating operating theatre resources to patients provides hospital management with better utilization and patient flow. In this paper, we tackle both tactical and operational planning over short-term to medium-term horizons. The main goal is to determine an allocation of blocks of time on each day to surgical specialties while also assigning each patient a day and an operating room for surgery. To create a balance between improving patients welfare and satisfying the expectations of hospital administrators, we propose six novel deterioration rates to evaluate patients total clinical condition deterioration. Each deterioration rate is defined as a function of the clinical priorities of patients, their waiting times, and their due dates. To optimize the objective functions, we present mixed integer programming (MIP) models and two dynamic programming based heuristics. Computational experiments have been conducted on a novel well-designed and carefully chosen benchmark dataset, which simulates realistic-sized instances. The results demonstrate the capability of the MIP models in finding excellent solutions (maximum average gap of 4.71% across all instances and objective functions), though, requiring large run-times. The heuristic algorithms provide a time-efficient alternative, where high quality solutions can be found in under a minute. We also analyse each objective function’s ability in generating high quality solutions from different perspectives such as patients waiting times, the number of scheduled patients, and operating rooms utilization rates. We provide managerial insights to the decision makers in cases where their intention is to meet KPIs and/or maintaining trade-offs between patients and administrators expectations, more fair assignments, or ensuring that the most urgent patients are taken care of first.
- 18 November 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 328 (1) , 821-857
Open AccessMinimizing patients total clinical condition deterioration in operating theatre departments
The operating theatre is the most crucial and costly department in a hospital due to its expensive resources and high patient admission rate. Efficiently allocating operating theatre resources to patients provides hospital management with better utilization and patient flow. In this paper, we tackle both tactical and operational planning over short-term to medium-term horizons. The main goal is to determine an allocation of blocks of time on each day to surgical specialties while also assigning each patient a day and an operating room for surgery. To create a balance between improving patients welfare and satisfying the expectations of hospital administrators, we propose six novel deterioration rates to evaluate patients total clinical condition deterioration. Each deterioration rate is defined as a function of the clinical priorities of patients, their waiting times, and their due dates. To optimize the objective functions, we present mixed integer programming (MIP) models and two dynamic programming based heuristics. Computational experiments have been conducted on a novel well-designed and carefully chosen benchmark dataset, which simulates realistic-sized instances. The results demonstrate the capability of the MIP models in finding excellent solutions (maximum average gap of 4.71% across all instances and objective functions), though, requiring large run-times. The heuristic algorithms provide a time-efficient alternative, where high quality solutions can be found in under a minute. We also analyse each objective function’s ability in generating high quality solutions from different perspectives such as patients waiting times, the number of scheduled patients, and operating rooms utilization rates. We provide managerial insights to the decision makers in cases where their intention is to meet KPIs and/or maintaining trade-offs between patients and administrators expectations, more fair assignments, or ensuring that the most urgent patients are taken care of first.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (2) , 747-772
Planning rolling stock maintenance: Optimization of train arrival dates at a maintenance center
A railway network is an indispensable part of the public transportation system in many major cities around the world. In order to provide a safe and reliable service, a fleet of passenger trains must undergo regular maintenance. These maintenance operations are lengthy procedures, which are planned for one year or a longer period. The planning specifies the dates of trains' arrival at the maintenance center and should take into account the uncertain duration of maintenance operations, the periods of validity of the previous maintenance, the desired number of trains in service, and the capacity of the maintenance center. The paper presents a nonlinear programming formulation of the considered problem and several optimization procedures which were compared by computational experiments using real world data. The results of these experiments indicate that the presented approach is capable to be used in real world planning process.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (2) , 747-772
Planning rolling stock maintenance: Optimization of train arrival dates at a maintenance center
A railway network is an indispensable part of the public transportation system in many major cities around the world. In order to provide a safe and reliable service, a fleet of passenger trains must undergo regular maintenance. These maintenance operations are lengthy procedures, which are planned for one year or a longer period. The planning specifies the dates of trains' arrival at the maintenance center and should take into account the uncertain duration of maintenance operations, the periods of validity of the previous maintenance, the desired number of trains in service, and the capacity of the maintenance center. The paper presents a nonlinear programming formulation of the considered problem and several optimization procedures which were compared by computational experiments using real world data. The results of these experiments indicate that the presented approach is capable to be used in real world planning process.
- 17 August 2021
- Published by Springer Nature
- p. 86-97
A Bayesian Optimisation Approach for Multidimensional Knapsack Problem
- 17 August 2021
- Published by Springer Nature
- p. 86-97
A Bayesian Optimisation Approach for Multidimensional Knapsack Problem