• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 126
Next 10 →

Ant Colony Optimization and the Minimum Spanning Tree Problem

by Frank Neumann, Carsten Witt - ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY , 2006
"... Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic ..."
Abstract - Cited by 19 (5 self) - Add to MetaCart
of the construction graph in an ACO algorithm seems to be crucial for the success of such an algorithm. First, we take the input graph itself as the construction graph and analyze the use of a construction procedure that is similar to Broder’s algorithm [1] for choosing a spanning tree uniformly at random. After that

An Efficient Rectilinear Steiner Minimum Tree Algorithm Based on Ant Colony Optimization

by Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng, Xiaodong Hu, Guiying Yan , 2004
"... The rectilinear Steiner minimum tree (RSMT) problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP-complete. This paper presents a practical heuristic for RSMT construction based on ant colony optimization (ACO). This algorithm has been implemen ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
The rectilinear Steiner minimum tree (RSMT) problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP-complete. This paper presents a practical heuristic for RSMT construction based on ant colony optimization (ACO). This algorithm has been

SWARM INTELLIGENCE AND ANT COLONY APPROACH- CAN THEY BE APPLIED IN OPTIMIZING CONSTRUCTION PROCESSES?

by Fritz Gehbauer, Patricia Stock, Peter Steffek
"... A swarm can be described as a group of individuals using direct and indirect communication to act without central command with high efficiency in problem solving. For example, the insect society as a whole is extremely efficient due to a sophisticated form of self-organization is based on an indirec ..."
Abstract - Add to MetaCart
this evolution to systems and problems of construction processes. First considerations have shown that the principles of the existing ant algorithms and simulation tools of manufacturing can be used in construction as well. In case of disturbances fast reorganization of processes can be developed using

The Research on Soldier’s Personalized Learning Based on improved Ant Colony Algorithm

by Dong Li, Huqiang Wang
"... learning; optimal path. Abstract. Confronting the situation of uneven educational background, knowledge comprehension and master speed of soldiers, stereotype education system of soldier’s occupational skill no longer adapts the demand of network era development and informational military constructi ..."
Abstract - Add to MetaCart
construction. The paper puts forward to the tactic of personalized learning of soldiers after analyzing the existing problems in soldier’s occupational skill education and the shortcomings of traditional ant colony algorithm, the tactic which makes use of Max-Min ant system just up-dates the pheromones

An Ant Colony Algorithm for the Set Packing Problem

by Xavier Gandibleux, Xavier Delorme, Vincent T'Kindt , 2004
"... In this paper we consider the application of an Ant Colony Optimisation (ACO) metaheuristic on the Set Packing Problem (SPP) which is a NP-hard optimisation problem. For the proposed algorithm, two solution construction strategies based on exploration and exploitation of solution space are designed. ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
In this paper we consider the application of an Ant Colony Optimisation (ACO) metaheuristic on the Set Packing Problem (SPP) which is a NP-hard optimisation problem. For the proposed algorithm, two solution construction strategies based on exploration and exploitation of solution space are designed

Modified Ant Colony Optimization Algorithm with Uniform Mutation using Self-Adaptive Approach

by Ramlakhan Singh Jadon, Unmukh Dutta
"... Ant Colony Optimization (ACO) algorithm is a novel metaheuristic algorithm that has been widely used for different combinational optimization problem and inspired by the foraging behavior of real ant colonies. Ant Colony Optimization has strong robustness and easy to combine with other methods in op ..."
Abstract - Add to MetaCart
in optimization. In this paper, an efficient ant colony optimization algorithm with uniform mutation operator using self-adaptive approach has been proposed. Here mutation operator is used for enhancing the algorithm escape from local optima. The algorithm converges to the optimal final solution, by gathering

Experiments with Variants of Ant Algorithms

by Thomas Stützle, Sebastian Linke - Mathware & Soft Computing, this issue , 2000
"... A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched inc ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally investigate adaptations of ant algorithms to the traveling salesman problem that use alternative choices

A concise overview of applications of ant colony optimization

by Thomas Stützle , Manuel López-Ibáñez , Marco Dorigo - In Encyclopedia of Operations Research and Management Science , 2011
"... Ant Colony Optimization (ACO) Despite being one of the youngest metaheuristics, the number of applications of ACO algorithms is very large. In principle, ACO can be applied to any combinatorial optimization problem for which some iterative solution construction mechanism can be conceived. Most app ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Ant Colony Optimization (ACO) Despite being one of the youngest metaheuristics, the number of applications of ACO algorithms is very large. In principle, ACO can be applied to any combinatorial optimization problem for which some iterative solution construction mechanism can be conceived. Most

Classification Using Unstructured Rules and Ant Colony Optimization

by Negar Zakeri Nejad, Amir H. Bakhtiary, Morteza Analoui
"... Abstract—In this paper a new method based on the Ant-Miner algorithm is proposed to discover sets of unstructured classification rules. This method, called the Tree-Miner, creates a directed graph made up of nodes representing operators and operands. Each ant in a colony of artificial ants traverses ..."
Abstract - Add to MetaCart
Abstract—In this paper a new method based on the Ant-Miner algorithm is proposed to discover sets of unstructured classification rules. This method, called the Tree-Miner, creates a directed graph made up of nodes representing operators and operands. Each ant in a colony of artificial ants

Data Mining Ant Colony for Classifiers

by Ahmed Sameh, Khalid Magdy
"... Abstract – Self-organizing Ant Colony Optimization (ACO) is a technique that is inspired by the behavior of the ants as social insect that work together to accomplish a common goal using wisdom of the crowd. ACO is one of the algorithms that put swarm intelligence into action. Swarm intelligence, w ..."
Abstract - Add to MetaCart
Abstract – Self-organizing Ant Colony Optimization (ACO) is a technique that is inspired by the behavior of the ants as social insect that work together to accomplish a common goal using wisdom of the crowd. ACO is one of the algorithms that put swarm intelligence into action. Swarm intelligence
Next 10 →
Results 1 - 10 of 126
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University