Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

3 articles for “Artificial ants”

Set a search alert
Research ArticleOpen accessIn the keywordsAn Efficient Ant Algorithm for Swarm-Based Image ClusteringSalima Ouadfel, Mohamed BatoucheA collective approach to resolve the segmentation problem was proposed. AntClust is a new ant-based algorithm that uses the self-organizing and autonomous brood sorting behavior observed in real ants. Ants and pixels are scatted on a discrete array of cells represented the ants’ environment. Using simple local rules and without any central control, ants form homogeneous clusters by moving pixels … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,155 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid Ant-Based Clustering Algorithm with Cluster Analysis TechniquesWafa’a Omar, Amr Badr, Abd El-Fattah HegazyCluster analysis is a data mining technology designed to derive a good understanding of data to solve clustering problems by extracting useful information from a large volume of mixed data elements. Recently, researchers have aimed to derive clustering algorithms from nature’s swarm behaviors. Ant-based clustering is an approach inspired by the natural clustering and sorting behavior of ant colonies. In … …Journal of Computer Science, Vol. 9, Issue 6 · 7 Jun 2013 · 7,306 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDFCite