Performance Analysis of Travelling Salesman Problem in Ant Colony Optimization in Wireless Sensor Networks
نویسندگان
چکیده
Ant colony algorithm is a metaheuristic algorithm which uses nature for finding solutions. Ant colony algorithm, by its performing behavior we know ant performs a series of routes as followed by deposition of pheromones. It is one of the algorithms used in Swarm Intelligence. Other Swarm Intelligence algorithm performs operation on the basis of collection behavior of ants, insects, birds, flies and other animals etc. Ant colony algorithm is used in various types of application such as Vehicle routing problem, Maximum input output detection etc. Ant colony algorithm has been successfully used for solving travelling salesman problem over large number of years. While, it has some drawbacks slow convergence speed, easily sousing into local minimum. Our aim is to find most favorable path through shortest distance and number of interactions accurately and quickly to get improved efficient energy, by using improved Ant colony algorithm.
منابع مشابه
An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks
High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...
متن کاملCombining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملAn Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem
Ant Colony optimization has proved suitable to solve a wide range of combinatorial optimization (or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of ACO algorithm is to set the parameters that drive the algorithm. The parameter has an important impact on the performance of the ant colony algorithm. The basic parameters that are used in ACO algorithms are; the relati...
متن کاملParallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.
متن کامل