John McCall
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
John McCall has a total of 174 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Edward Ian Brownlee
University of Stirling, Stirling, United Kingdom
25 shared publications - Andrei Petrovski
ITMO University
20 shared publications Olivier Regnier-Coudert
Robert Gordon University, School of Computing and Digital Media, Aberdeen, Scotland
18 shared publications- Lee A. Christie
Robert Gordon University, Aberdeen, United Kingdom of Great Britain and Northern Ireland
14 shared publications - Siddhartha Shakya
Research and Innovation, BT Technology, Services and Operations
14 shared publications - Alexandru-Ciprian Zăvoianu
Robert Gordon University
10 shared publications
Latest Publications
- 24 November 2025
- Published by Springer Nature
- p. 374-387
Exam Timetabling Problem Using Cooperative Hyper-Heuristics: A Case Study of the ITC2007 Dataset
- 24 November 2025
- Published by Springer Nature
- p. 374-387
Exam Timetabling Problem Using Cooperative Hyper-Heuristics: A Case Study of the ITC2007 Dataset
- 24 November 2025
- Published by Springer Nature
- p. 21-34
Evolutionary Optimization of Autonomous Agents for Decreasing Resource Intensity on Geographically Located Interdependent Task Sets
- 24 November 2025
- Published by Springer Nature
- p. 21-34
Evolutionary Optimization of Autonomous Agents for Decreasing Resource Intensity on Geographically Located Interdependent Task Sets
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 25-36
Generating Realistic Benchmarks for Dynamic Truck and Trailer Scheduling using Gaussian Copulas
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 25-36
Open AccessGenerating Realistic Benchmarks for Dynamic Truck and Trailer Scheduling using Gaussian Copulas
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1984-1991
Evaluating a Novel Explainability Method for Metaheuristics via a User Study
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1984-1991
Open AccessEvaluating a Novel Explainability Method for Metaheuristics via a User Study
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1099-1107
Interpretable Decision Trees to Predict Solution Fitness
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1099-1107
Open AccessInterpretable Decision Trees to Predict Solution Fitness
- Open Access
- 30 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 5 (2) , 1-30
Towards Explainable Metaheuristics: Feature Mining of Search Trajectories through Principal Component Projection
While population-based metaheuristics have proven useful for refining and improving explainable AI systems, they are seldom the focus of explanatory approaches themselves. This stems from their inherently stochastic, population-driven searches, which complicate the use of standard explainability techniques. In this article, we present a method to identify which decision variables have the greatest impact during an algorithm’s trajectory from random initialsation to convergence. We apply Principal Component Analysis to project each population onto a lower-dimensional space, then introduce two metrics—Mean Variable Contribution and Proportion of Aligned Variables—to identify the variables most responsible for guiding the search. Using four different population-based methods (Particle Swarm Optimisation, Genetic Algorithm, Differential Evolution, and Covariance Matrix Adaptation Evolution Strategy) on 24 BBOB benchmark functions in 10 dimensions, we find that these metrics highlight meaningful variable relationships and provide a window into each method’s search dynamics. By comparing the features extracted across algorithms and problems, we illustrate how certain variable subsets consistently drive major improvements in solution quality. In doing so, new evolutionary algorithm variants can be designed to take advantage of these influential variables, while also identifying underutilised variables that may benefit alternative search strategies.
- 30 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 5 (2) , 1-30
Open AccessTowards Explainable Metaheuristics: Feature Mining of Search Trajectories through Principal Component Projection
While population-based metaheuristics have proven useful for refining and improving explainable AI systems, they are seldom the focus of explanatory approaches themselves. This stems from their inherently stochastic, population-driven searches, which complicate the use of standard explainability techniques. In this article, we present a method to identify which decision variables have the greatest impact during an algorithm’s trajectory from random initialsation to convergence. We apply Principal Component Analysis to project each population onto a lower-dimensional space, then introduce two metrics—Mean Variable Contribution and Proportion of Aligned Variables—to identify the variables most responsible for guiding the search. Using four different population-based methods (Particle Swarm Optimisation, Genetic Algorithm, Differential Evolution, and Covariance Matrix Adaptation Evolution Strategy) on 24 BBOB benchmark functions in 10 dimensions, we find that these metrics highlight meaningful variable relationships and provide a window into each method’s search dynamics. By comparing the features extracted across algorithms and problems, we illustrate how certain variable subsets consistently drive major improvements in solution quality. In doing so, new evolutionary algorithm variants can be designed to take advantage of these influential variables, while also identifying underutilised variables that may benefit alternative search strategies.
- Open Access
- 15 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 5 (2) , 1-2
Introduction to the Special Issue on Explainable AI in Evolutionary Computation—Part 2
- 15 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 5 (2) , 1-2
Open AccessIntroduction to the Special Issue on Explainable AI in Evolutionary Computation—Part 2
- 24 April 2025
- Published by Springer Nature
- p. 107-121
Optimising Public Transport Through the Integration of Micro and Macro-level Simulations
- 24 April 2025
- Published by Springer Nature
- p. 107-121
Optimising Public Transport Through the Integration of Micro and Macro-level Simulations
- 29 November 2024
- Published by Springer Nature
- p. 179-193
Explaining a Staff Rostering Problem Using Partial Solutions
- 29 November 2024
- Published by Springer Nature
- p. 179-193
Explaining a Staff Rostering Problem Using Partial Solutions
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Evolutionary Computation and Explainable AI: A Roadmap to Understandable Intelligent Systems
Artificial intelligence methods are being increasingly applied across various domains, but their often opaque nature has raised concerns about accountability and trust. In response, the field of explainable AI (XAI) has emerged to address the need for human-understandable AI systems. Evolutionary computation (EC), a family of powerful optimization and learning algorithms, offers significant potential to contribute to XAI, and vice versa. This paper provides an introduction to XAI and reviews current techniques for explaining machine learning models. We then explore how EC can be leveraged in XAI and examine existing XAI approaches that incorporate EC techniques. Furthermore, we discuss the application of XAI principles within EC itself, investigating how these principles can illuminate the behavior and outcomes of EC algorithms, their (automatic) configuration, and the underlying problem landscapes they optimize. Finally, we discuss open challenges in XAI and highlight opportunities for future research at the intersection of XAI and EC. Our goal is to demonstrate EC’s suitability for addressing current explainability challenges and to encourage further exploration of these methods, ultimately contributing to the development of more understandable and trustworthy ML models and EC algorithms.
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Evolutionary Computation and Explainable AI: A Roadmap to Understandable Intelligent Systems
Artificial intelligence methods are being increasingly applied across various domains, but their often opaque nature has raised concerns about accountability and trust. In response, the field of explainable AI (XAI) has emerged to address the need for human-understandable AI systems. Evolutionary computation (EC), a family of powerful optimization and learning algorithms, offers significant potential to contribute to XAI, and vice versa. This paper provides an introduction to XAI and reviews current techniques for explaining machine learning models. We then explore how EC can be leveraged in XAI and examine existing XAI approaches that incorporate EC techniques. Furthermore, we discuss the application of XAI principles within EC itself, investigating how these principles can illuminate the behavior and outcomes of EC algorithms, their (automatic) configuration, and the underlying problem landscapes they optimize. Finally, we discuss open challenges in XAI and highlight opportunities for future research at the intersection of XAI and EC. Our goal is to demonstrate EC’s suitability for addressing current explainability challenges and to encourage further exploration of these methods, ultimately contributing to the development of more understandable and trustworthy ML models and EC algorithms.