Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

Ant Colony Optimisation for Dynamic and Dynamic Multi-objective Railway Rescheduling Problems

Recovering the timetable after a delay is essential to the smooth and efficient operation of the railways for both passengers and railway operators. Most current railway rescheduling research concentrates on static problems where all delays are known about in advance. However, due to the unpredictable nature of the railway system, it is possible that further unforeseen incidents could occur while the trains are running to the new rescheduled timetable. This will change the problem, making it a dynamic problem that changes over time. The aim of this work is to investigate the application of ant colony optimisation (ACO) to dynamic and dynamic multiobjective railway rescheduling problems. ACO is a promising approach for dynamic combinatorial optimisation problems as its inbuilt mechanisms allow it to adapt to the new environment while retaining potentially useful information from the previous environment. In addition, ACO is able to handle multi-objective problems by the addition of multiple colonies and/or multiple pheromone and heuristic matrices. The contributions of this work are the development of a junction simulator to model unique dynamic and multi-objective railway rescheduling problems and an investigation into the application of ACO algorithms to solve those problems. A further contribution is the development of a unique two-colony ACO framework to solve the separate problems of platform reallocation and train resequencing at a UK railway station in dynamic delay scenarios. Results showed that ACO can be e ectively applied to the rescheduling of trains in both dynamic and dynamic multi-objective rescheduling problems. In the dynamic junction rescheduling problem ACO outperformed First Come First Served (FCFS), while in the dynamic multi-objective rescheduling problem ACO outperformed FCFS and Non-dominated Sorting Genetic Algorithm II (NSGA-II), a stateof- the-art multi-objective algorithm. When considering platform reallocation and rescheduling in dynamic environments, ACO outperformed Variable Neighbourhood Search (VNS), Tabu Search (TS) and running with no rescheduling algorithm. These results suggest that ACO shows promise for the rescheduling of trains in both dynamic and dynamic multi-objective environments.Engineering and Physical Sciences Research Council (EPSRC

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Evaluation and optimisation of traction system for hybrid railway vehicles

Over the past decade, energy and environmental sustainability in urban rail transport have become increasingly important. Hybrid transportation systems present a multifaceted challenge, encompassing aspects such as hydrogen production, refuelling station infrastructure, propulsion system topology, power source sizing, and control. The evaluation and optimisation of these aspects are critical for the adaptation and commercialisation of hybrid railway vehicles. While there has been significant progress in the development of hybrid railway vehicles, further improvements in propulsion system design are necessary. This thesis explores strategies to achieve this ambitious goal by substituting diesel trains with hybrid trains. However, limited research has assessed the operational performance of replacing diesel trains with hybrid trains on the same tracks. This thesis develops various optimisation techniques for evaluating and refining the hybrid traction system to address this gap. In this research's first phase, the author developed a novel Hybrid Train Simulator designed to analyse driving performance and energy flow among multiple power sources, such as internal combustion engines, electrification, fuel cells, and batteries. The simulator incorporates a novel Automatic Smart Switching Control technique, which scales power among multiple power sources based on the route gradient for hybrid trains. This smart switching approach enhances battery and fuel cell life and reduces maintenance costs by employing it as needed, thereby eliminating the forced charging and discharging of excessively high currents. Simulation results demonstrate a 6% reduction in energy consumption for hybrid trains equipped with smart switching compared to those without it. In the second phase of this research, the author presents a novel technique to solve the optimisation problem of hybrid railway vehicle traction systems by utilising evolutionary and numerical optimisation techniques. The optimisation method employs a nonlinear programming solver, interpreting the problem via a non-convex function combined with an efficient "Mayfly algorithm." The developed hybrid optimisation algorithm minimises traction energy while using limited power to prevent unnecessary load on power sources, ensuring their prolonged life. The algorithm takes into account linear and non-linear variables, such as velocity, acceleration, traction forces, distance, time, power, and energy, to address the hybrid railway vehicle optimisation problem, focusing on the energy-time trade-off. The optimised trajectories exhibit an average reduction of 16.85% in total energy consumption, illustrating the algorithm's effectiveness across diverse routes and conditions, with an average increase in journey times of only 0.40% and a 15.18% reduction in traction power. The algorithm achieves a well-balanced energy-time trade-off, prioritising energy efficiency without significantly impacting journey duration, a critical aspect of sustainable transportation systems. In the third phase of this thesis, the author introduced artificial neural network models to solve the optimisation problem for hybrid railway vehicles. Based on time and power-based architecture, two ANN models are presented, capable of predicting optimal hybrid train trajectories. These models tackle the challenge of analysing large datasets of hybrid railway vehicles. Both models demonstrate the potential for efficiently predicting hybrid train target parameters. The results indicate that both ANN models effectively predict a hybrid train's critical parameters and trajectory, with mean errors ranging from 0.19% to 0.21%. However, the cascade-forward neural network topology in the time-based architecture outperforms the feed-forward neural network topology in terms of mean squared error and maximum error in the power-based architecture. Specifically, the cascade-forward neural network topology within the time-based structure exhibits a slightly lower MSE and maximum error than its power-based counterpart. Moreover, the study reveals the average percentage difference between the benchmark and FFNN/CNFN trajectories, highlighting that the time-based architecture exhibits lower differences (0.18% and 0.85%) compared to the power-based architecture (0.46% and 0.92%)

SmartDrive: Traction Energy Optimization and Applications in Rail Systems

This paper presents the development of SmartDrive package to achieve the application of energy-efficient driving strategy. The results are from collaboration between Ricardo Rail and the Birmingham Centre for Railway Research and Education (BCRRE). Advanced tram and train trajectory optimization techniques developed by BCRRE as part of the UKTRAM More Energy Efficiency Tram project have been now incorporated in Ricardo's SmartDrive product offering. The train trajectory optimization method, associated driver training and awareness package (SmartDrive) has been developed for use on tram, metro, and some heavy rail systems. A simulator was designed that can simulate the movement of railway vehicles and calculate the detailed power system energy consumption with different train trajectories when implemented on a typical AC or DC powered route. The energy evaluation results from the simulator will provide several potential energy-saving solutions for the existing route. An enhanced Brute Force algorithm was developed to achieve the optimization quickly and efficiently. Analysis of the results showed that by implementing an optimal speed trajectory, the energy usage in the network can be significantly reduced. A driver practical training system and the optimized lineside driving control signage, based on the optimized trajectory were developed for testing. This system instructed drivers to maximize coasting in segregated sections of the network and to match optimal speed limits in busier street sections. The field trials and real daily operations in the Edinburgh Tram Line, U.K., have shown that energy savings of 10%-20% are achievable

An Intelligent Mobility Prediction Scheme for Location-Based Service over Cellular Communications Network

One of the trickiest challenges introduced by cellular communications networks is mobility prediction for Location Based-Services (LBSs). Hence, an accurate and efficient mobility prediction technique is particularly needed for these networks. The mobility prediction technique incurs overheads on the transmission process. These overheads affect properties of the cellular communications network such as delay, denial of services, manual filtering and bandwidth. The main goal of this research is to enhance a mobility prediction scheme in cellular communications networks through three phases. Firstly, current mobility prediction techniques will be investigated. Secondly, innovation and examination of new mobility prediction techniques will be based on three hypothesises that are suitable for cellular communications network and mobile user (MU) resources with low computation cost and high prediction success rate without using MU resources in the prediction process. Thirdly, a new mobility prediction scheme will be generated that is based on different levels of mobility prediction. In this thesis, a new mobility prediction scheme for LBSs is proposed. It could be considered as a combination of the cell and routing area (RA) prediction levels. For cell level prediction, most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shape cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the New Markov-Based Mobility Prediction (NMMP) and Prediction Location Model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression and insufficient accuracy. In this thesis, Location Prediction based on a Sector Snapshot (LPSS) is introduced, which is based on a Novel Cell Splitting Algorithm (NCPA). This algorithm is implemented in a micro cell in parallel with the new prediction technique. The LPSS technique, compared with two classic prediction techniques and the experimental results, shows the effectiveness and robustness of the new splitting algorithm and prediction technique. In the cell side, the proposed approach reduces the complexity cost and prevents the cell level prediction technique from performing in time slots that are too close. For these reasons, the RA avoids cell-side problems. This research discusses a New Routing Area Displacement Prediction for Location-Based Services (NRADP) which is based on developed Ant Colony Optimization (ACO). The NRADP, compared with Mobility Prediction based on an Ant System (MPAS) and the experimental results, shows the effectiveness, higher prediction rate, reduced search stagnation ratio, and reduced computation cost of the new prediction technique

System energy optimisation strategies for DC railway traction power networks

Energy and environmental sustainability in transportation are becoming ever more important. In Europe, the transportation sector is responsible for about 32% of the final energy consumption. Electrified railway systems play an important role in contributing to the reduction of energy usage and C0$_2$ emissions compared with other transport modes. Previous studies have investigated train driving strategies for traction energy saving. However, few of them consider the overall system energy optimisation. This thesis analyses the energy consumption of urban systems with regenerating trains, including the energy supplied by substations, used in power transmission networks, consumed by monitoring trains, and regenerated by braking trains. This thesis proposes an approach to searching energy-efficient driving strategies with coasting controls. A Driver Advisory System is designed and implemented in a field test on Beijing Yizhuang Subway Line. The driver guided by the DAS achieves 16% of traction energy savings, compared with normal driving. This thesis also proposes an approach to global system energy consumption optimisation, based on a Monte Carlo Algorithm. The case study indicates that the substation energy is reduced by around 38.6% with the system optimised operations. The efficiency of using regenerative braking energy is improved to from 80.6 to 95.5%

Optimisation for Optical Data Centre Switching and Networking with Artificial Intelligence

Cloud and cluster computing platforms have become standard across almost every domain of business, and their scale quickly approaches $\mathbf{O}(10^6)$ servers in a single warehouse. However, the tier-based opto-electronically packet switched network infrastructure that is standard across these systems gives way to several scalability bottlenecks including resource fragmentation and high energy requirements. Experimental results show that optical circuit switched networks pose a promising alternative that could avoid these. However, optimality challenges are encountered at realistic commercial scales. Where exhaustive optimisation techniques are not applicable for problems at the scale of Cloud-scale computer networks, and expert-designed heuristics are performance-limited and typically biased in their design, artificial intelligence can discover more scalable and better performing optimisation strategies. This thesis demonstrates these benefits through experimental and theoretical work spanning all of component, system and commercial optimisation problems which stand in the way of practical Cloud-scale computer network systems. Firstly, optical components are optimised to gate in $\approx 500 ps$ and are demonstrated in a proof-of-concept switching architecture for optical data centres with better wavelength and component scalability than previous demonstrations. Secondly, network-aware resource allocation schemes for optically composable data centres are learnt end-to-end with deep reinforcement learning and graph neural networks, where $3\times$ less networking resources are required to achieve the same resource efficiency compared to conventional methods. Finally, a deep reinforcement learning based method for optimising PID-control parameters is presented which generates tailored parameters for unseen devices in $\mathbf{O}(10^{-3}) s$. This method is demonstrated on a market leading optical switching product based on piezoelectric actuation, where switching speed is improved $>20\%$ with no compromise to optical loss and the manufacturing yield of actuators is improved. This method was licensed to and integrated within the manufacturing pipeline of this company. As such, crucial public and private infrastructure utilising these products will benefit from this work