MFMichael Fairbank

Michael Fairbank

*This is an algorithmically generated author record based on publicly available information.

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


Michael Fairbank has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Efficient Forecast-Based Routing and Dynamic Time Window Management for Attended Home Deliveries

    by Mohammad Abdollahi, Xinan Yang, Michael Fairbank

    In light of the escalating popularity of online shopping and the urgent need to reduce unnecessary driving to mitigate environmental impacts, it has become increasingly important to provide cost-effective solutions for attended home deliveries. Extensive research efforts have been dedicated to addressing challenges related to integrating demand management and vehicle routing with time windows. In this paper, we present two key contributions. Firstly, we propose an enhanced method for estimating opportunity cost, by leveraging a dynamic-routing and distribution approach that incorporates forecast orders. This approach allows for more accurate revenue-loss assessments, ultimately leading to improved decision-making on the delivery charges. Secondly, we introduce a dynamic slot-combination strategy, aiming to fully exploit the flexibility that customers possess in receiving their delivery, which enhances overall route efficiency and customer satisfaction. Importantly, our proposed augmented time-windows approach can be easily implemented within existing systems, employing standard time windows, without necessitating any strategic changes or complex computational modifications to the routing system. To assess the performance of our proposed approach, we conducted exhaustive experiments on real data. The results demonstrate that our generated solution outperforms both recent and current state-of-the-art approaches in terms of profitability and delivery efficiency. This signifies the effectiveness and practicality of our proposed methodology in addressing the challenges associated with attended home deliveries.

  • Open Access

    Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture

    by Michael Fairbank, Alexei Lisitsa, Alexei Vernitski

    The unsolved Andrews-Curtis conjecture in group theory gives rise to many famously challenging theorem-proving problems. Automated reasoning is one of the best state-of-the-art approaches to solving them. We have developed a new classifier inspired by group theory and a new search algorithm orientated at using for the Andrews-Curtis conjecture. We combine them with automated reasoning and compare their performance with automated reasoning.

  • Open Access

    Neurocontrol for fixed-length trajectories in environments with soft barriers

    by Michael Fairbank, Danil Prokhorov, David Barragan-Alcantar, Spyridon Samothrakis, Shuhui Li

  • Finding Eulerian Tours in Mazes Using a Memory-Augmented Fixed Policy Function

    by Mahrad Pisheh Var, Michael Fairbank, Spyridon Samothrakis

  • Open Access

    Demand management in time-slotted last-mile delivery via dynamic routing with forecast orders

    by Mohammad Abdollahi, Xinan Yang, Moncef Ilies Nasri, Michael Fairbank


  • An Iterative Optimization and Learning-Based IoT System for Energy Management of Connected Buildings

    by Yixiang Gao, Shuhui Li, Yang Xiao, Weizhen Dong, Michael Fairbank, Bing Lu

    Buildings account for nearly 40% of primary energy and 36% of greenhouse emissions, which is one of the main factors driving climate change. Reducing energy consumption in buildings toward zero-energy buildings is a vital pillar to ensure that future climate and energy targets are reached. However, due to the high uncertainty of building loads and customer comfort demands, and extremely nonlinear building thermal characteristics, developing an effective zero-energy building energy management (BEM) technology is facing great challenges. This paper proposes a novel learning-based and iterative IoT system to address these challenges to achieve the zero-energy objective in BEM of connected buildings. Firstly, all buildings in the IoT-based BEM system share their operation data with an aggregator. Secondly, the aggregator uses these historical data to train a deep reinforcement learning model based on the Deep Deterministic Policy Gradient method. The learning model generates pre-cooling or pre-heating control actions to achieve zero-energy BEM for building heating ventilation and air conditioning (HVAC) systems. Thirdly, for solving the coupling problem between HVAC systems and building internal heat gain loads, an iterative optimization algorithm is developed to integrate physics-based and learning-based models to minimize the deviation between the on-site solar photovoltaic generated energy and the actual building energy consumption by properly scheduling building loads, electric vehicle charging cycles and the energy-storage system. Lastly, the optimal load operation scheduling is generated by considering customers’ comfort requirements. All connected buildings then operate their loads based on the load operation schedule issued by the aggregator. The proposed learning-based and iterative IoT system is validated via simulation with real-world building data from the Pecan Street project.


  • Open Access

    Deep Learning in Target Space

    by Michael Fairbank, Spyridon Samothrakis, Luca Citi

    Deep learning uses neural networks which are parameterised by their weights. The neural networks are usually trained by tuning the weights to directly minimise a given loss function. In this paper we propose to re-parameterise the weights into targets for the firing strengths of the individual nodes in the network. Given a set of targets, it is possible to calculate the weights which make the firing strengths best meet those targets. It is argued that using targets for training addresses the problem of exploding gradients, by a process which we call cascade untangling, and makes the loss-function surface smoother to traverse, and so leads to easier, faster training, and also potentially better generalisation, of the neural network. It also allows for easier learning of deeper and recurrent network structures. The necessary conversion of targets to weights comes at an extra computational expense, which is in many cases manageable. Learning in target space can be combined with existing neural-network optimisers, for extra gain. Experimental results show the speed of using target space, and examples of improved generalisation, for fully-connected networks and convolutional networks, and the ability to recall and process long time sequences and perform natural-language processing with recurrent networks.

  • Open Access

    A Comparison of Deep-Learning Methods for Analysing and Predicting Business Processes

    by Ishwar Venugopal, Jessica Töllich, Michael Fairbank, Ansgar Scherp

    Deep-learning models such as Convolutional Neural Networks (CNN) and Long Short-Term Memory (LSTM) have been successfully used for process-mining tasks. They have achieved better performance for different predictive tasks than traditional approaches. We extend the existing body of research by testing four different variants of Graph Neural Networks (GNN) and a fully connected Multi-layer Perceptron (MLP) with dropout for the tasks of predicting the nature and timestamp of the next process activity. In contrast to existing studies, we evaluate our models' performance at different stages of a process, determined by quartiles of the number of events and normalized quarters of the case duration. This provides new insights into the performance of a prediction model, as they behave differently at different stages of a business-process. Interestingly, our experiments show that the simple MLP often outperforms more sophisticated deep-learning models in both prediction tasks. We argue that care needs to be taken when applying automated process-prediction techniques at different stages of a process. We further argue that researchers should reflect their results with strong baselines methods like simple MLPs.

  • Control of a Buck DC/DC Converter Using Approximate Dynamic Programming and Artificial Neural Networks

    by Weizhen Dong, Shuhui Li, Xingang Fu, Zhongwen Li, Michael Fairbank, Yixiang Gao

    This paper proposes a novel artificial neural network (ANN) based control method for a dc/dc buck converter. The ANN is trained to implement optimal control based on approximate dynamic programming (ADP). Special characteristics of the proposed ANN control include: 1) The inputs to the ANN contain error signals and integrals of the error signals, enabling the ANN to have PI control ability; 2) The ANN receives voltage feedback signals from the dc/dc converter, making the combined system equivalent to a recurrent neural network; 3) The ANN is trained to minimize a cost function over a long time horizon, making the ANN have a stronger predictive control ability than a conventional predictive controller; 4) The ANN is trained offline, preventing the instability of the network caused by weight adjustments of an on-line training algorithm. The ANN performance is evaluated through simulation and hardware experiments and compared with conventional control methods, which shows that the ANN controller has a strong ability to track rapidly changing reference commands, maintain stable output voltage for a variable load, and manage maximum duty-ratio and current constraints properly.


  • Open Access

    Baseline win rates for neural-network based trading algorithms

    by Andreas Krause, Michael Fairbank

    Neural networks and other machine-learning systems are used to create automatic financial forecasting and trading systems. To aid comparison of such systems, there is a need for reliable performance metrics. One such metric that may be considered is the win rate. We show how in certain circumstances the win-rate statistic can be very misleading, and to counter this, we propose and define baseline win rates for comparison. We develop empirical and closed-form models for such baselines and validate them against financial data and a neural forecaster.