Author details
Author's Published Works
Author details
Showing 1-7 of 7 results
- Sort
Filter Results
Show
Sort By
Results
A New Hybrid Ant Colony Algorithm for Clustering Problem
2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing
Year: 2008 | Conference Paper |
Cited by: Papers (1)
The known mathematical model for clustering problems is given in this paper. With the K-Means algorithm, the simulated annealing algorithm and a novel hybrid ant colony algorithm is integrated with the K-means algorithm to solve clustering problems. The advantages and shortages of K-Means algorithm, simulated annealing algorithm and the hybrid ant colony algorithm are then analyzed, so that effect...Show More
A New Hybrid Ant Colony Algorithm for Clustering Problem
2008 International Symposium on Intelligent Information Technology Application Workshops
Year: 2008 | Conference Paper |
Cited by: Papers (2)
The known mathematical model for clustering problems is given in this paper. With the K-Means algorithm, the simulated annealing algorithm and a novel hybrid ant colony algorithm is integrated with the K-means algorithm to solve clustering problems. The advantages and shortages of K-Means algorithm, simulated annealing algorithm and the hybrid ant colony algorithm are then analyzed, so that effect...Show More
Solving Weapon-Target Assignment Problems by a New Ant Colony Algorithm
2008 International Symposium on Computational Intelligence and Design
Year: 2008 | Conference Paper |
Cited by: Papers (8)
A new ant colony algorithm for weapon-target assignment (WTA) problems is proposed. The proposed algorithm is a parallel mechanism based on ant colony optimization (ACO) and has cooperative interactions among ant colonies. It has both the advantage of ACO, the ability to find feasible solutions and to avoid premature convergence, and the advantage of heuristics, the ability to conduct fine-tuning ...Show More
Immune Genetic Algorithm for Weapon-Target Assignment Problem
Workshop on Intelligent Information Technology Application (IITA 2007)
Year: 2007 | Conference Paper |
Cited by: Papers (11)
An Immune Genetic Algorithm (IGA) is used to solve weapon-target assignment problem (WTA). The used immune system serves as a local search mechanism for genetic algorithm. Besides, in our implementation, a new crossover operator is proposed to preserve good information contained in the chromosome. A comparison of the proposed algorithm with several existing search approaches shows that the IGA out...Show More
Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule
Third International Conference on Natural Computation (ICNC 2007)
Year: 2007 | Conference Paper |
Cited by: Papers (9)
The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best dat...Show More
By use of the properties of ant colony algorithm and genetic algorithm, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts genetic algorithm to give information pheromone to distribute. Second, it makes use of the ant colony algorithm to get several solutions through information pheromone accumulation and renewal. Finally, by using across and mutation operati...Show More
By use of the properties of ant colony algorithm and particle swarm optimization, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts statistics method to get several initial better solutions and in accordance with them, gives information pheromone to distribute. Second, it makes use of the ant colony algorithm to get several solutions through information pher...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.