The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A novel adaptive ant colony clustering algorithm based on digraph (A3CD) is presented. Inspired by the swarm intelligence shown through the social insects’ self-organizing behavior, in A3CD we assign acceptance weights on the directed edges of a pheromone digraph. The weights of the digraph is adaptively updated by the pheromone left by ants in the seeking process. Finally, strong connected components...
Ant Colony optimization takes inspiration from the behavior of real ant colony to solve optimization problems. This paper presents a parallel model for ant colony to solve the optimal packing problem. The problem is represented by a directed graph so that the objective of the original problem becomes to find the shortest closed circuit on the graph under the problem-specific constraints. A number...
An adaptive parallel ant colony optimization is presented by improving the critical factor influencing the performance of the parallel algorithm. We propose two different strategies for information exchange between processors: selection based on sorting and on difference, which make each processor choose another processor to communicate and update the pheromone adaptively. In order to increase the...
This paper presents a new method for hierarchical image segmentation. The hierarchical structure is represented by a binary tree with the main image as its root. At the lower levels, each node stands as one image segment, which is described by a weighted graph and may be divided into two new segments at the next level through a specific cut. Graph bi-sectioning is done by the self organizing property...
Many algorithms that solve optimization problems are being developed and used. However, large and complex optimization problems still exist, and it is often difficult to obtain the desired results with one of these algorithms alone. This paper applies tabu search and ant colony optimization method to the container load sequencing problem. We also propose a hybrid algorithm, which can combine the merits...
By applying a candidate set strategy based on minimum 1-tree and a self-adaptive hybrid mutation operator to the ant colony system, a novel ant colony system for TSP (MMACS) is proposed. Under the condition that all the edges in the global optimal tour are nearly all contained in the candidate sets, the candidate set strategy based on minimum 1-tree can limit the selection scope of ants at each step...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.