Applying ACO To Large Scale TSP Instances

Ant Colony Optimisation (ACO) is a well known metaheuristic that has proven successful at solving Travelling Salesman Problems (TSP). However, ACO suffers from two issues; the first is that the technique has significant memory requirements for storing pheromone levels on edges between cities and second, the iterative probabilistic nature of choosing which city to visit next at every step is computationally expensive. This restricts ACO from solving larger TSP instances. This paper will present a methodology for deploying ACO on larger TSP instances by removing the high memory requirements, exploiting parallel CPU hardware and introducing a significant efficiency saving measure. The approach results in greater accuracy and speed. This enables the proposed ACO approach to tackle TSP instances of up to 200K cities within reasonable timescales using a single CPU. Speedups of as much as 1200 fold are achieved by the technique

Optimal schedule of home care visits for a health care center

The provision of home health care services is becoming an important research area, mainly because in Portugal the population is ageing. Home care visits are organized taking into account the medical treatments and general support that elder/sick people need at home. This health service can be provided by nurse teams from Health Care Centers. Usually, the visits are manually planned and without computer support. The main goal of this work is to carry out the automatic schedule of home care visits, of one Portuguese Health Care Center, in order to minimize the time spent in all home care visits and, consequently, reduce the costs involved. The developed algorithms were coded in MatLab Software and the problem was efficiently solved, obtaining several schedule solutions of home care visits for the presented data. Solutions found by genetic and particle swarm algorithms lead to significant time reductions for both nurse teams and patients.This work has been supported by COMPETE: POCI-01-0145- FEDER-007043 and FCT - Fundru;ao para a Ciencia e Tecnologia within the Project Scope: UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio

Multi-train trajectory optimisation to maximise rail network energy efficiency under travel-time constraints

Optimising the trajectories of multiple interacting trains to maximise energy efficiency is a difficult, but highly desirable, problem to solve. A bespoke genetic algorithm has been developed for the multi-train trajectory optimisation problem and used to seek a near-optimal set of control point distances for multiple trains, such that a weighted sum of the time and energy objectives is minimised. Genetic operators tailored to the problem are developed including a new mutation operation and the insertion and deletion pairs of control points during the reproduction process. Compared with published results, the new GA was shown to increase the quality of solutions found by an average of 27.6% and increase consistency by a factor of 28. This allows more precise control over the relative priority given to achieving time targets or increasing energy efficiency

Dominant takeover regimes for genetic algorithms

The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems

Visualising the Search Landscape of the Triangle Program

High order mutation analysis of a software engineering benchmark, including schema and local optima networks, suggests program improvements may not be as hard to find as is often assumed. 1) Bit-wise genetic building blocks are not deceptive and can lead to all global optima. 2) There are many neutral networks, plateaux and local optima, nevertheless in most cases near the human written C source code there are hill climbing routes including neutral moves to solutions

A quantum genetic algorithm with quantum crossover and mutation operations

In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.Comment: 21 pages, 1 table, v2: typos corrected, minor modifications in sections 3.5 and 4, v3: minor revision, title changed (original title: Semiclassical genetic algorithm with quantum crossover and mutation operations), v4: minor revision, v5: minor grammatical corrections, to appear in QI

Parallel processing area extraction and data transfer number reduction for automatic GPU offloading of IoT applications

For Open IoT, we have proposed Tacit Computing technology to discover the devices that have data users need on demand and use them dynamically and an automatic GPU offloading technology as an elementary technology of Tacit Computing. However, it can improve limited applications because it only optimizes parallelizable loop statements extraction. Thus, in this paper, to improve performances of more applications automatically, we propose an improved method with reduction of data transfer between CPU and GPU. We evaluate our proposed offloading method by applying it to Darknet and find that it can process it 3 times as quickly as only using CPU.Comment: 6 pages, 4 figures, in Japanese, IEICE Technical Report, SC2018-3

Improving Performance Estimation for FPGA-based Accelerators for Convolutional Neural Networks

Field-programmable gate array (FPGA) based accelerators are being widely used for acceleration of convolutional neural networks (CNNs) due to their potential in improving the performance and reconfigurability for specific application instances. To determine the optimal configuration of an FPGA-based accelerator, it is necessary to explore the design space and an accurate performance prediction plays an important role during the exploration. This work introduces a novel method for fast and accurate estimation of latency based on a Gaussian process parametrised by an analytic approximation and coupled with runtime data. The experiments conducted on three different CNNs on an FPGA-based accelerator on Intel Arria 10 GX 1150 demonstrated a 30.7% improvement in accuracy with respect to the mean absolute error in comparison to a standard analytic method in leave-one-out cross-validation.Comment: This article is accepted for publication at ARC'202

Adaptive mutation using statistics mechanism for genetic algorithms

Copyright @ 2004 Springer-Verla

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space. The evolution is obtained from the continuous movement of the particles that constitute the swarm submitted to the effect of the inertia and the attraction of the members who lead the swarm. This work focuses on a recent Discrete Particle Swarm Optimization for combinatorial optimization, called Jumping Particle Swarm Optimization. Its effectiveness is illustrated on the minimum labelling Steiner tree problem: given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes, whose edges have the smallest number of distinct labels