195 research outputs found
Enhanced discrete particle swarm optimization path planning for UAV vision-based surface inspection
© 2017 In built infrastructure monitoring, an efficient path planning algorithm is essential for robotic inspection of large surfaces using computer vision. In this work, we first formulate the inspection path planning problem as an extended travelling salesman problem (TSP) in which both the coverage and obstacle avoidance were taken into account. An enhanced discrete particle swarm optimization (DPSO) algorithm is then proposed to solve the TSP, with performance improvement by using deterministic initialization, random mutation, and edge exchange. Finally, we take advantage of parallel computing to implement the DPSO in a GPU-based framework so that the computation time can be significantly reduced while keeping the hardware requirement unchanged. To show the effectiveness of the proposed algorithm, experimental results are included for datasets obtained from UAV inspection of an office building and a bridge
Different population-based algorithms for Travelling Salesman Problem: A Review Paper
In this review paper, travelling salesman problem (TSP) is used as a domain. TSP is widely used to test new heuristics and is a well-known classical NP-complete combinatorial optimization problem in operation research area. From different fields such as artificial intelligence, physics, operations research etc. this problem has attracted many researchers. TSP has been studied thoroughly in late years and many algorithms have been developed. To address this problem using classical methods many attempts had been made such as integer programming and graph theory algorithms. In TSP the rules are very simple. TSP states that the nodes that must be visited once should not be visited again. TSP has huge search space. To find the optimal solution is very difficult. In this paper, a survey and comparative analysis are done for better results in TSP. The basisof the literature survey identify some research gaps on which further work can be done. The comparative analysis is done on the basis of contrasting parameters by comparing the differentpopulation-based algorithms
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
A Parallel Meta-Heuristic Approach to Reduce Vehicle Travel Time in Smart Cities
The development of the smart city concept and inhabitants’ need to reduce travel time, in addition to society’s awareness of the importance of reducing fuel consumption and respecting the environment, have led to a new approach to the classic travelling salesman problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?”. At present, with the development of Internet of Things (IoT) devices and increased capabilities of sensors, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the aim is to provide a solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm Teacher Learner Based Optimization (TLBO). In addition, to improve performance, the solution is implemented by means of a parallel graphics processing unit (GPU) architecture, specifically a Compute Unified Device Architecture (CUDA) implementation.This research was supported by the Spanish Ministry of Science, Innovation and Universities and the Research State Agency under Grant RTI2018-098156-B-C54 co-financed by FEDER funds, and by the Spanish Ministry of Economy and Competitiveness under Grant TIN2017-89266-R, co-financed by FEDER funds
An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's -test, the Holm's test, and the Friedman test. We have also compared the convergence behaviour shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases
An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's -test, the Holm's test, and the Friedman test. We have also compared the convergence behaviour shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases
Experimental Study of Variation Local Search Mechanism for Bee Algorithm Feature Selection
The Bees Algorithm (BA) has been applied for finding the best possible subset features of a dataset. However, the main issue of the BA for feature selection is that it requires long computational time. This is due to the nature of BA combination search approach that exploits neighborhoods with random explorative. This situation creates unwanted suboptimum solution(s) leading to the lack of accuracy and longer processing time. A set of different local neighborhood search extension and their combination approaches have been proposed, including Simple-swap, 2-Opt, 3-Opt, and 4-Opt. The performance of the proposed mechanism was compared and analyzed using benchmark dataset. The results from experimental work confirmed that the proposed approach provides better accuracy with suitable time
Recommended from our members
OptPlatform: metaheuristic optimisation framework for solving complex real-world problems
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonWe optimise daily, whether that is planning a round trip that visits the most attractions within a given holiday budget or just taking a train instead of driving a car in a rush hour. Many problems, just like these, are solved by individuals as part of our daily schedule, and they are effortless and straightforward. If we now scale that to many individuals with many different schedules, like a school timetable, we get to a point where it is just not feasible or practical to solve by hand. In such instances, optimisation methods are used to obtain an optimal solution. In this thesis, a practical approach to optimisation has been taken by developing an optimisation platform with all the necessary tools to be used by practitioners who are not necessarily familiar with the subject of optimisation. First, a high-performance metaheuristic optimisation framework (MOF) called OptPlatform is implemented, and the versatility and performance are evaluated across multiple benchmarks and real-world optimisation problems. Results show that, compared to competing MOFs, the OptPlatform outperforms in both the solution quality and computation time. Second, the most suitable hardware platform for OptPlatform is determined by an in-depth analysis of Ant Colony Optimisation scaling across CPU, GPU and enterprise Xeon Phi. Contrary to the common benchmark problems used in the literature, the supply chain problem solved could not scale on GPUs. Third, a variety of metaheuristics are implemented into OptPlatform. Including, a new metaheuristic based on Imperialist Competitive Algorithm (ICA), called ICA with Independence and Constrained Assimilation (ICAwICA) is proposed. The ICAwICA was compared against two different types of benchmark problems, and results show the versatile application of the algorithm, matching and in some cases outperforming the custom-tuned approaches. Finally, essential MOF features like automatic algorithm selection and tuning, lacking on existing frameworks, are implemented in OptPlatform. Two novel approaches are proposed and compared to existing methods. Results indicate the superiority of the implemented tuning algorithms within constrained tuning budget environment
- …