• No results found

[PDF] Top 20 RESEARCH ARTICLE An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem

Has 10000 "RESEARCH ARTICLE An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem" found on our website. Below are the top 20 most common "RESEARCH ARTICLE An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem".

RESEARCH ARTICLE An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem

RESEARCH ARTICLE An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem

... The problem state that there given a set of cities, a salesman needs to visit all cities without having any redundancy of city except the starting and finish city such that the traversed path is ...Hard ... See full document

8

TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

... of optimization in human development, several optimization algorithms have been developed to speed-up industrial, engineering and scientific ...popular optimization algorithms are the Ant ... See full document

9

Solving The Printed Circuit Board Drilling Problem By Ant Colony Optimization Algorithm

Solving The Printed Circuit Board Drilling Problem By Ant Colony Optimization Algorithm

... sensibility analysis to help tune the parameters of an ant colony model where ants leave a fuzzy trace of pheromone to mark their track and its neighborhood, where tests were conducted on classical ... See full document

5

A New Optimization Method for Dynamic Travelling Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm Optimization

A New Optimization Method for Dynamic Travelling Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm Optimization

... for solving the problem of finding the shortest ...this research for finding the shortest path, use the best position of particle in total population is ...for solving the Symmetric ... See full document

7

Population-based optimization algorithms for solving the travelling salesman problem

Population-based optimization algorithms for solving the travelling salesman problem

... based optimization algorithms focused on solving the ...based optimization algorithms such as Evolutionary Algorithms (EA), Ant Colony Optimization Algorithms (ACO), Particle ... See full document

36

Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

... in solving TSP, such as Genetic Algorithm (GA) [2] [3], Simulated Annealing (SA) [4], Ant Colony Optimization (ACO) [5], Particle Swarm Optimization (PSO) [6], Tabu Search (TS) [7], ... See full document

10

A Hybrid Ant Colony Optimization Algorithm using MapReduce for Arc Routing Problem

A Hybrid Ant Colony Optimization Algorithm using MapReduce for Arc Routing Problem

... Ant colony optimisation (ACO) could be a comparatively new random heuristic approach for determination optimisation ...runtime analysis of the ACO on the TSP are ...the travelling ... See full document

5

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

... Traveling Salesman Problem is a problem that is not deterministic and hard and quite known in combinatorial optimization studied in theory based computer science and operation research ... See full document

6

1.
													Predicting software reliability and quality using ant colony optimization technique with travelling salesman problem for software process

1. Predicting software reliability and quality using ant colony optimization technique with travelling salesman problem for software process

... There is a prerequisite of the enormous scope of effort, time and currency to arrange and build up any feasible software apart from the human resource and their organization. For outstanding increasing competition, ... See full document

5

Implementing Discrete Cuckoo Search Algorithm for TSP using MPI and Beowulf Cluster

Implementing Discrete Cuckoo Search Algorithm for TSP using MPI and Beowulf Cluster

... combinatorial optimization problems which exist in scientific and the industrial ...The Travelling Salesman Problem is one such combinatorial optimization problem which was ... See full document

7

A Survey Paper on Solving Travelling Salesman problem Using Bee colony optimization

A Survey Paper on Solving Travelling Salesman problem Using Bee colony optimization

... as ant, bee, fish, and cockroach show many interesting collective ...A colony of honey bees can extend itself over long distances and in multiple directions simultaneously to exploit a large number of food ... See full document

6

Survey on Ant Colony Optimization Using Travelling Salesman Problem

Survey on Ant Colony Optimization Using Travelling Salesman Problem

... Traveling Salesman Problem (TSP), and report simulation ...the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem ...the ... See full document

5

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

... many research papers in International and National Journals including various ...His research areas are Soft Computing, Bioinformatics, Design & Analysis of Algorithms, Data Mining, Pattern ... See full document

5

Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem

Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem

... Since the computer now are ever-expanding in speed and memory, the TSP problems less than 100 cities can be solved to optimality within reasonable time (Hjertenes, 2002). Nevertheless, if given a 16-city TSP ... See full document

12

Ant Colony and Cuckoo Search algorithms 
		for document clustering

Ant Colony and Cuckoo Search algorithms for document clustering

... Current research areas within this field are searching and querying, ranking search results, navigating and browsing information, optimizing information representation and storage, document classification and ... See full document

9

Optimization of Traveling Salesman Problem based on Adaptive Affinity Propagation and Ant Colony Algorithms

Optimization of Traveling Salesman Problem based on Adaptive Affinity Propagation and Ant Colony Algorithms

... In this paper, a new algorithm is proposed, that uses Adaptive Affinity Propagation clustering to optimize the performance of Ant Colony Algorithm, to solve TSP. Figure 2 shows the full operation of the ... See full document

7

CREATING THE BEST ROUTING BY HEURISTIC ALGORITHM

CREATING THE BEST ROUTING BY HEURISTIC ALGORITHM

... Travelling Salesman Problem has come into existence as a result of the improvement of the problems with separate start and end ..."Travelling Salesman Problem" ... See full document

15

Water Flow-Like Algorithm with Simulated Annealing for Travelling Salesman Problems

Water Flow-Like Algorithm with Simulated Annealing for Travelling Salesman Problems

... The proposed solution approach has adopted WFA-TSP basic operations of initialization, flow splitting and moving, flow merging, water evaporation and water precipitation [3]. The SA is embedded into WFA-TSP as local ... See full document

7

An Improved Algorithm for Inducing Classifica...

An Improved Algorithm for Inducing Classifica...

... Swarm optimization (PSO) is stochastic population based optimization technique which is based on the simulation behavior of birds within a group of ...swarm optimization) contains a number of ... See full document

9

Parallel Implementation of the Max Min Ant System for the Travelling Salesman Problem on GPU

Parallel Implementation of the Max Min Ant System for the Travelling Salesman Problem on GPU

... MMAS sequentially is implemented on the above given hardware specification with a randomly generated graph with different no. of nodes as well as some standard graphs to compare our results. Comparative analysis ... See full document

5

Show all 10000 documents...