A New Optimization Method for Dynamic Travelling Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm Optimization
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 2
Abstract
In recent decades, with the introduction of optimization problems, new methods of was optimizing developed. The most important group of optimization techniques is meta-heuristic method. That is able to solve the problems of combination optimizing. The major problems in the combination optimizing such as Dynamic Travelling Salesman Problem (DTSP) is a kind of problems that is close answer to the optimum will introduce in them. So using of the meta-heuristic methods in this kind of problems was the case of concentration in the current years. In this paper a new algorithm based on Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) as the name of ACO-PSO is proposed which of PSO algorithm for tuning parameters of ACO and establishing a balance between global search and local search is used. Experimental results show that the proposed method has good performance.
Authors and Affiliations
Farhad Soleimanian Gharehchopogh , Isa Maleki
Keywords
Related Articles
- EP ID EP146605
- DOI -
- Views 84
- Downloads 0
Perspective Study on Resource Information Aggregation in Computational Grid
Grid Computing is a mechanism of distributed computing to coordinate and share the networked resources, data domains, storage devices and processing power across geographically distributed locations. In the compu...
Recursive Pseudo-Exhaustive Two-Pattern Generator
Pseudo-exhaustive pattern generators for built-in self-test (BIST) provide high fault coverage of detectable combinational faults with much fewer test vectors than exhaustive generation. In (n, k)-adjacent bit ps...
Extensive study of image enhancement via stochastic optimization technique:MPSO
Recent literatures show how modified particle swarm had achieved its name and fame over its parental algorithm called as PSO by optimizing. In this paper we exploit its advantage over image enhancement for improvin...
Pre Layout And Post Layout Analysis Of Parallel Counter Architecture Based On State Look-Ahead Logic
The main objective of this project presents designing a parallel counter architecture which is used to improve the operating frequency. It is a partitioning methodology which consists of two paths named as counting...
Compression Record Based Efficient k - Medoid Algorithm to Increase Scalability and Efficiency
Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attri butes. K - medoid clustering algorithms are widely used for many practical applica...