Kyle Robert Harrison
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
Kyle Robert Harrison has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Terence Weir
Defence Science and Technology Group, Department of Defence, Canberra ACT 2610, Australia
6 shared publicationsIvan L. Garanovich
Defence Science and Technology Group, Department of Defence, Canberra ACT 2610, Australia
4 shared publicationsSaber M. Elsayed
School of Engineering and Information Technology, University of New South Wales, Canberra ACT 2600, Australia
4 shared publicationsSharon G. Boswell
Defence Science and Technology Group, Department of Defence, Canberra ACT 2610, Australia
4 shared publications- Debiao Li
Fuzhou University
2 shared publications - Ivan Leonidovich Garanovich
Nonlinear Physics Center, Research School of Physics and Engineering, Australian National University, Canberra ACT 0200, Australia
2 shared publications
Latest Publications
- 18 November 2024
- Published by Springer Nature
- p. 354-365
An Improved Prescriptive Tree-Based Model for Stochastic Parallel Machine Scheduling
- 18 November 2024
- Published by Springer Nature
- p. 354-365
An Improved Prescriptive Tree-Based Model for Stochastic Parallel Machine Scheduling
- Open Access
- 9 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 146
Surrogate-assisted analysis of the parameter configuration landscape for meta-heuristic optimisation
- 9 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 146
Open AccessSurrogate-assisted analysis of the parameter configuration landscape for meta-heuristic optimisation
- Open Access
- 25 April 2022
- Published by Elsevier in Data in Brief
- Vol. 42, 108208
Generating datasets for the project portfolio selection and scheduling problem
- 25 April 2022
- Published by Elsevier in Data in Brief
- Vol. 42, 108208
Open AccessGenerating datasets for the project portfolio selection and scheduling problem
- 7 March 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 112
Solving a novel multi-divisional project portfolio selection and scheduling problem
- 7 March 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 112
Solving a novel multi-divisional project portfolio selection and scheduling problem
- 14 November 2021
- Published by Springer Nature
- p. 89-123
A New Model for the Project Portfolio Selection and Scheduling Problem with Defence Capability Options
- 14 November 2021
- Published by Springer Nature
- p. 89-123
A New Model for the Project Portfolio Selection and Scheduling Problem with Defence Capability Options
- 14 November 2021
- Published by Springer Nature
- p. 1-8
Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling: An Introduction
- 14 November 2021
- Published by Springer Nature
- p. 1-8
Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling: An Introduction
- 19 July 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (4) , 4161-4191
Image-based benchmarking and visualization for large-scale global optimization
- 19 July 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (4) , 4161-4191
Image-based benchmarking and visualization for large-scale global optimization
- Open Access
- 3 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 83410-83430
A Hybrid Multi-Population Approach to the Project Portfolio Selection and Scheduling Problem for Future Force Design
Future Force Design (FFD) is a strategic planning activity that decides the programming of defence capability options. This is a complex problem faced by the Australian Department of Defence (DoD) and requires the simultaneous selection and scheduling of projects. Specifically, this is a NP-hard problem known as the Project Portfolio Selection and Scheduling Problem (PPSSP). While the PPSSP is a complex problem itself, its complexity is further increased when coupled with the additional characteristics that arise in the context of defence-oriented planning, such as long planning periods and complex operational constraints. As a result, many previous studies examined only a small number of projects over a short planning period and are largely unsuitable for the scale required in the defence sector. To address this issue, two primary contributions are made in this paper. Firstly, this study describes a complex practical PPSSP, inspired by the FFD process, and develops a corresponding mathematical model. Problem instances are derived from real-world, publicly-available defence data. Secondly, to address instances of the problem, two existing meta-heuristics are considered and a hybrid, multi-population approach is proposed. Results are compared against those attained by a commercial exact solver and indicate that there is no statistically significant difference in performance between the proposed multi-population approach and the exact solver. A key benefit of the proposed meta-heuristic approach is that its run time is not significantly influenced by the complexity of the problem instance. Additionally, many interesting practical insights regarding the solution of selection and scheduling problems are uncovered.
- 3 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 83410-83430
Open AccessA Hybrid Multi-Population Approach to the Project Portfolio Selection and Scheduling Problem for Future Force Design
Future Force Design (FFD) is a strategic planning activity that decides the programming of defence capability options. This is a complex problem faced by the Australian Department of Defence (DoD) and requires the simultaneous selection and scheduling of projects. Specifically, this is a NP-hard problem known as the Project Portfolio Selection and Scheduling Problem (PPSSP). While the PPSSP is a complex problem itself, its complexity is further increased when coupled with the additional characteristics that arise in the context of defence-oriented planning, such as long planning periods and complex operational constraints. As a result, many previous studies examined only a small number of projects over a short planning period and are largely unsuitable for the scale required in the defence sector. To address this issue, two primary contributions are made in this paper. Firstly, this study describes a complex practical PPSSP, inspired by the FFD process, and develops a corresponding mathematical model. Problem instances are derived from real-world, publicly-available defence data. Secondly, to address instances of the problem, two existing meta-heuristics are considered and a hybrid, multi-population approach is proposed. Results are compared against those attained by a commercial exact solver and indicate that there is no statistically significant difference in performance between the proposed multi-population approach and the exact solver. A key benefit of the proposed meta-heuristic approach is that its run time is not significantly influenced by the complexity of the problem instance. Additionally, many interesting practical insights regarding the solution of selection and scheduling problems are uncovered.
- Open Access
- 25 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 60152-60178
Portfolio Optimization for Defence Applications
The problem of designing an effective future defence force is quite complex and challenging. One methodology that is often employed in this domain is portfolio optimization, whereby the objective is to select a diverse set of assets that maximize the return on investment. In the defence context, the return on investment is often measured in terms of the capabilities that the investments will provide. While the field of portfolio optimization is well established, applications in the defence sector pose unique challenges not seen in other application domains. However, the literature regarding portfolio optimization for defence applications is rather sparse. To this end, this paper provides a structured review of recent applications and identifies a number of areas that warrant further investigation.
- 25 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 60152-60178
Open AccessPortfolio Optimization for Defence Applications
The problem of designing an effective future defence force is quite complex and challenging. One methodology that is often employed in this domain is portfolio optimization, whereby the objective is to select a diverse set of assets that maximize the return on investment. In the defence context, the return on investment is often measured in terms of the capabilities that the investments will provide. While the field of portfolio optimization is well established, applications in the defence sector pose unique challenges not seen in other application domains. However, the literature regarding portfolio optimization for defence applications is rather sparse. To this end, this paper provides a structured review of recent applications and identifies a number of areas that warrant further investigation.