The Ant Colony Optimization method is a heuristic algorithm for solving various optimization problems, particularly the combinatorial optimization problems. Traditional ant-optimization methods might encounter search stagnation owing to a biased pheromone map that is dominated by local optimal trails. To overcome this drawback and lower the number of solution constructions for finding the optim...

This chapter reviews the approaches that have been studied for the online adaptation of the parameters of ant colony optimization (ACO) algorithms, that is, the variation of parameter settings while solving an instance of a problem. We classify these approaches according to the main classes of online parameter-adaptation techniques. One conclusion of this review is that the available approaches...

In DNA based computation, the design of good DNA sequences has turned out to be a fundamental problem and one of the most practical and important research topics. Although the design of DNA sequences is dependent on the protocol of biological experiments, it is highly required to establish a method for the systematic design of DNA sequences, which could be applied to various design constraints....

Purpose. At present, the computer networks of information and telecommunication system (ITS) railway transport use OSPF protocol, which does not allow taking into account several metrics when determining optimal route. Therefore, there is a need to study possibility organizing routing in rail ITS using two-colonial ant algorithm. Methodology. According Two-ACO software model, created Python lan...

The Cumberland Plateau supports diverse plant communities that vary greatly across cove and plateau habitats. Unfortunately, little is known about how terrestrial invertebrate communities vary across cove andplateauhabitats andhowdisturbanceaffects these communities. Toaddress this deÞciency, we used the Ant Leaf Litter protocol to survey ant diversity on the southern Cumberland Plateau in Tenn...

The paper describes an intelligent ant system-based algorithm for automatic generation of optimal sequence of machining operations required to produce a part, based on minimising the number of tool changes and set-up changes subject to satisfying all precedence constraints during manufacturing. The MATLAB programme for the algorithm uses a list of machining operations, tool approach directions,...

This paper describes the implementation of a distributed route management system called the CE-ant algorithm. The algorithm is developed at the Department of Telematics at the Norwegian University of Science and Technology (NTNU), and results from simulations are promising. The algorithm has, however, never been implemented and tested in a real network carrying real data traffic. The pioneering...

Résumé Modern day biometric systems, such as those used by governments to issue biometric-based identity cards, maintain a deterministic link between the identity of the user and her biometric information. However, such a link brings in serious privacy concerns for the individual. Sensitive information about the individual can be retrieved from the database by using her biometric information. I...