In this work, we present a model for the phenomena of collective decision-making in social insects, using an n-dimensional system of differential equations. We perform a complete stability analysis for a special case ...
详细信息
In this work, we present a model for the phenomena of collective decision-making in social insects, using an n-dimensional system of differential equations. We perform a complete stability analysis for a special case in the model, and present numerical simulations to illustrate the behaviour of the model in the more general case. The analysis shows that up to a range of values of the parameters in the model, distinct processes of decision-making in the social insects could be modelled by the same mathematical equations. Finally, use the analysis of the mathematical model to discuss possible improvements in the performance of ant algorithms, presenting preliminary results.
Cellular manufacturing requires an effective part clustering method to start up the manufacturing cell design. This paper presents a new part clustering algorithm that uses the concept of the recognition system of art...
详细信息
Cellular manufacturing requires an effective part clustering method to start up the manufacturing cell design. This paper presents a new part clustering algorithm that uses the concept of the recognition system of artificial ants. The proposed algorithm mimics the random meetings of real ants to build up the ability of object recognition and then to form many initial part clusters with high similarities. These initial part clusters are further merged into larger and larger clusters in an agglomerative way until the designated number of part families is reached. The characteristics of artificial ants, such as randomization and collective behaviour, allow the algorithm to re-cluster wrongly grouped parts into the proper clusters. As a result this can eliminate the chaining effects resulting from the interference of abnormal parts during the clustering process. This algorithm has been developed into a software system called the ant colony recognition system (ACRS). A number of problems selected from the literature have been solved by ACRS, and the evaluation results indicate that ACRS is able to solve the cell formation problems effectively.
This paper presents an ant system coupled with a local search applied to an over-constrained airport gate assignment problem (AGAP). In the airport gate assignment problem we are interested in selecting and allocating...
详细信息
ISBN:
(纸本)9783540876557
This paper presents an ant system coupled with a local search applied to an over-constrained airport gate assignment problem (AGAP). In the airport gate assignment problem we are interested in selecting and allocating aircrafts to the gates such that the total passenger connection time is minimized. Our algorithm uses pheromone trail information to perform modifications on AGAP solutions, unlike traditional ant systems that use pheromone trail information to construct complete solutions. The algorithm is analyzed and compared with tabu search heuristic and ant Colony System metaheuristic.
We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347-357). We devise a number of variants and carry out experiments. Our preliminary result...
详细信息
We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347-357). We devise a number of variants and carry out experiments. Our preliminary results suggest that the best way to deposit pheromone and the best heuristics for state transitions may differ from current practice.
We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347-357). We devise a number of variants and carry out experiments. Our preliminary result...
详细信息
We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347-357). We devise a number of variants and carry out experiments. Our preliminary results suggest that the best way to deposit pheromone and the best heuristics for state transitions may differ from current practice.
An algorithm is presented here to estimate a smooth motion at a high frame rate. It is derived from the non-linear constant brightness assumption. A hierarchical approach reduces the dimension of the space of admissib...
详细信息
An algorithm is presented here to estimate a smooth motion at a high frame rate. It is derived from the non-linear constant brightness assumption. A hierarchical approach reduces the dimension of the space of admissible displacements, hence the number of unknown parameters is small compared to the size of the data. The optimal displacement is estimated by a Gauss-Newton method, and the matrix required at each step is assembled rapidly using a finite-element method.
We consider a generalization of Heilbronn's triangle problem by asking, given any integers n >= k, for the supremum Delta(k)(n) of the minimum area determined by the convex hull of some k of n points in the uni...
详细信息
We consider a generalization of Heilbronn's triangle problem by asking, given any integers n >= k, for the supremum Delta(k)(n) of the minimum area determined by the convex hull of some k of n points in the unit square [0, 1](2), where the supremum is taken over all distributions of n points in [0, 1](2). Improving the lower bound Delta(k)(n) = Omega(1/n((k-1)/(k-2))) from [C. Bertram-Kretzberg, T. Hofmeister, H. Lefmann, An algorithm for Heilbronn's problem, SIAM Journal on Computing 30 (2000) 383-390] and from [W.M. Schmidt, On a problem of Heilbronn, Journal of the London Mathematical Society (2) 4 (1972) 545-550] fork = 4, we show that Delta(k)(n) = Omega((log n)(1/(k-2))/n((k-1)/(k-2))) for fixed integers k >= 3 as asked for in [C. Bertram-Kretzberg, T. Hotmeister, H. Lefmann, An algorithm for Heilbronn's problem, SIAM Journal on Computing 30 (2000) 383-390]. Moreover, we provide a deterministic polynomial time algorithm which finds n points in [0, 1](2), which achieve this lower bound on Delta(k)(n). (c) 2007 Elsevier Ltd. All rights reserved.
We investigate adaptive routing in ad-hoe networks of mobile robots with an application of geographical cells. We show that the concept of geographical cells introduce an efficient information management system in ad-...
详细信息
ISBN:
(纸本)9781424416325
We investigate adaptive routing in ad-hoe networks of mobile robots with an application of geographical cells. We show that the concept of geographical cells introduce an efficient information management system in ad-hoc networks of mobile robots. As compared to other existing ad-hoc routing concepts, geographical cell routing shows superiority in terms of delay, delay jitter and delivery ratio. Since the logical structure of the cells can be adjusted to particular application scenarios, geographical cells may become a flexible and effective alternative.
This book constitutes the refereed proceedings of the 6th International Workshop on ant Colony Optimization and Swarm Intelligence, antS 2008, held in Brussels, Belgium, in September 2008. The 17 revised full papers, ...
详细信息
ISBN:
(数字)9783540875277
ISBN:
(纸本)9783540875260
This book constitutes the refereed proceedings of the 6th International Workshop on ant Colony Optimization and Swarm Intelligence, antS 2008, held in Brussels, Belgium, in September 2008. The 17 revised full papers, 24 revised short papers, and 10 extended abstracts presented were carefully reviewed and selected from 91 submissions. The papers cover theoretical and foundational aspects of computational intelligence and related disciplines with special focus on swarm intelligence and are devoted to behavioral models of social insects and new algorithmic approaches, empirical and theoretical research in swarm intelligence, applications such as ant colony optimization or particle swarm optimization, and theoretical and experimental research in swarm robotics systems.
This study presents an optimization model for a bus network design based on the coarse-grain parallel ant colony algorithm (CPACA). It aims to maximize the number of direct travelers per unit length, that is, direct t...
详细信息
This study presents an optimization model for a bus network design based on the coarse-grain parallel ant colony algorithm (CPACA). It aims to maximize the number of direct travelers per unit length, that is, direct traveler density, subject to route length and nonlinear rate constraints (ratio of the length of a route to the shortest road distance between the origin and destination). CPACA is a new optimal algorithm that (1) develops a new strategy to update the increased pheromone, called ant-Weight, by which the path-searching activities of ants are adjusted based on the objective function, and (2) uses parallelization strategies of an ant colony algorithm (ACA) to improve the calculation time and the quality of the optimization. Data collected in Dalian City, China, are used to test the model and the algorithm. The results show that the optimized bus network has significantly reduced transfers and travel time. They also reveal that the proposed CPACA is effective and efficient compared to some existing ant algorithms.
暂无评论