The Use of Persistent Explorer Artificial Ants to Solve the Car Sequencing Problem

Ant Colony Optimisation is a widely researched meta-heuristic which uses the behaviour and pheromone laying activities of foraging ants to find paths through graphs. Since the early 1990’s this approach has been applied to problems such as the Travelling Salesman Problem, Quadratic Assignment Problem and Car Sequencing Problem to name a few. The ACO is not without its problems it tends to find good local optima and not good global optima. To solve this problem modifications have been made to the original ACO such as the Max Min ant system. Other solutions involve combining it with Evolutionary Algorithms to improve results. These improvements focused on the pheromone structures. Inspired by other swarm intelligence algorithms this work attempts to develop a new type of ant to explore different problem paths and thus improve the algorithm. The exploring ant would persist throughout the running time of the algorithm and explore unused paths. The Car Sequencing problem was chosen as a method to test the Exploring Ants. An existing algorithm was modified to implement the explorers. The results show that for the car sequencing problem the exploring ants did not have any positive impact, as the paths they chose were always sub-optimal

ACO-tagger: A Novel Method for Part-of-Speech Tagging using Ant Colony Optimization

Swarm Intelligence algorithms have gained significant attention in recent years as a means of solving complex and non-deterministic problems. These algorithms are inspired by the collective behavior of natural creatures, and they simulate this behavior to develop intelligent agents for computational tasks. One such algorithm is Ant Colony Optimization (ACO), which is inspired by the foraging behavior of ants and their pheromone laying mechanism. ACO is used for solving difficult problems that are discrete and combinatorial in nature. Part-of-Speech (POS) tagging is a fundamental task in natural language processing that aims to assign a part-of-speech role to each word in a sentence. In this research paper, proposed a high-performance POS-tagging method based on ACO called ACO-tagger. This method achieved a high accuracy rate of 96.867%, outperforming several state-of-the-art methods. The proposed method is fast and efficient, making it a viable option for practical applications

A survey of swarm intelligence for dynamic optimization: algorithms and applications

Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given

HIGH CAPACITY AND OPTIMIZED IMAGE STEGANOGRAPHY TECHNIQUE BASED ON ANT COLONY OPTIMIZATION ALGORITHM

The tremendous development of digital technology, it is mandatory to address the security while transmitting information over network in a way that observer couldn’t depict it. Measures to be taken to provide the security by establishing hidden communication using steganography principle which is help to camouflage the secret information in some carrier file such as text, image, audio and video. In this era of hidden data communication, image becoming an effective tool on account of their frequency, capability and accuracy. Image steganography uses an image as a carrier medium to hide the secret data. The main motive of this article is that the uses the combination of frequency domain and optimization method inorder to increasing in robustness. In this article, Integer Wavelet transform is performed into the host image and coefficients have been transformed. ACO optimization algorithm is used to find the optimal coefficients where to hide the data. Furthermore, sample images and information having been demonstrated which proved the increased robustness as well as high level of data embedding capacity

Reactive approach for automating exploration and exploitation in ant colony optimization

Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. Exploration and exploitation are the main mechanisms in controlling search within the ACO. Reactive search is an alternative technique to maintain the dynamism of the mechanics. However, ACO-based reactive search technique has three (3) problems. First, the memory model to record previous search regions did not completely transfer the neighborhood structures to the next iteration which leads to arbitrary restart and premature local search. Secondly, the exploration indicator is not robust due to the difference of magnitudes in distance matrices for the current population. Thirdly, the parameter control techniques that utilize exploration indicators in their feedback process do not consider the problem of indicator robustness. A reactive ant colony optimization (RACO) algorithm has been proposed to overcome the limitations of the reactive search. RACO consists of three main components. The first component is a reactive max-min ant system algorithm for recording the neighborhood structures. The second component is a statistical machine learning mechanism named ACOustic to produce a robust exploration indicator. The third component is the ACO-based adaptive parameter selection algorithm to solve the parameterization problem which relies on quality, exploration and unified criteria in assigning rewards to promising parameters. The performance of RACO is evaluated on traveling salesman and quadratic assignment problems and compared with eight metaheuristics techniques in terms of success rate, Wilcoxon signed-rank, Chi-square and relative percentage deviation. Experimental results showed that the performance of RACO is superior than the eight (8) metaheuristics techniques which confirmed that RACO can be used as a new direction for solving optimization problems. RACO can be used in providing a dynamic exploration and exploitation mechanism, setting a parameter value which allows an efficient search, describing the amount of exploration an ACO algorithm performs and detecting stagnation situations

Study on Different Topology Manipulation Algorithms in Wireless Sensor Network

Wireless sensor network (WSN) comprises of spatially distributed autonomous sensors to screen physical or environmental conditions and to agreeably go their information through the network to a principle area. One of the critical necessities of a WSN is the efficiency of vitality, which expands the life time of the network. At the same time there are some different variables like Load Balancing, congestion control, coverage, Energy Efficiency, mobility and so on. A few methods have been proposed via scientists to accomplish these objectives that can help in giving a decent topology control. In the piece, a few systems which are accessible by utilizing improvement and transformative strategies that give a multi target arrangement are examined. In this paper, we compare different algorithms' execution in view of a few parameters intended for every target and the outcomes are analyzed. DOI: 10.17762/ijritcc2321-8169.15029

The Application of Ant Colony Optimization

The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance

Radio Frequency Energy Harvesting and Management for Wireless Sensor Networks

Radio Frequency (RF) Energy Harvesting holds a promising future for generating a small amount of electrical power to drive partial circuits in wirelessly communicating electronics devices. Reducing power consumption has become a major challenge in wireless sensor networks. As a vital factor affecting system cost and lifetime, energy consumption in wireless sensor networks is an emerging and active research area. This chapter presents a practical approach for RF Energy harvesting and management of the harvested and available energy for wireless sensor networks using the Improved Energy Efficient Ant Based Routing Algorithm (IEEABR) as our proposed algorithm. The chapter looks at measurement of the RF power density, calculation of the received power, storage of the harvested power, and management of the power in wireless sensor networks. The routing uses IEEABR technique for energy management. Practical and real-time implementations of the RF Energy using Powercast harvesters and simulations using the energy model of our Libelium Waspmote to verify the approach were performed. The chapter concludes with performance analysis of the harvested energy, comparison of IEEABR and other traditional energy management techniques, while also looking at open research areas of energy harvesting and management for wireless sensor networks.Comment: 40 pages, 9 figures, 5 tables, Book chapte

Intelligent classification algorithms in enhancing the performance of support vector machine

Performing feature subset and tuning support vector machine (SVM) parameter processes in parallel with the aim to increase the classification accuracy is the current research direction in SVM. Common methods associated in tuning SVM parameters will discretize the continuous value of these parameters which will result in low classification performance. This paper presents two intelligent algorithms that hybridized between ant colony optimization (ACO) and SVM for tuning SVM parameters and selecting feature subset without having to discretize the continuous values. This can be achieved by simultaneously executing the selection of feature subset and tuning SVM parameters simultaneously. The algorithms are called ACOMVSVM and IACOMV-SVM. The difference between the algorithms is the size of the solution archive. The size of the archive in ACOMV is fixed while in IACOMV, the size of solution archive increases as the optimization procedure progress. Eight benchmark datasets from UCI were used in the experiments to validate the performance of the proposed algorithms. Experimental results obtained from the proposed algorithms are better when compared with other approaches in terms of classification accuracy. The average classification accuracies for the proposed ACOMV–SVM and IACOMV-SVM algorithms are 97.28 and 97.91 respectively. The work in this paper also contributes to a new direction for ACO that can deal with mixed variable ACO

Energy-efficient routing protocols in heterogeneous wireless sensor networks

Sensor networks feature low-cost sensor devices with wireless network capability, limited transmit power, resource constraints and limited battery energy. The usage of cheap and tiny wireless sensors will allow very large networks to be deployed at a feasible cost to provide a bridge between information systems and the physical world. Such large-scale deployments will require routing protocols that scale to large network sizes in an energy-efficient way. This thesis addresses the design of such network routing methods. A classification of existing routing protocols and the key factors in their design (i.e., hardware, topology, applications) provides the motivation for the new three-tier architecture for heterogeneous networks built upon a generic software framework (GSF). A range of new routing algorithms have hence been developed with the design goals of scalability and energy-efficient performance of network protocols. They are respectively TinyReg - a routing algorithm based on regular-graph theory, TSEP - topological stable election protocol, and GAAC - an evolutionary algorithm based on genetic algorithms and ant colony algorithms. The design principle of our routing algorithms is that shortening the distance between the cluster-heads and the sink in the network, will minimise energy consumption in order to extend the network lifetime, will achieve energy efficiency. Their performance has been evaluated by simulation in an extensive range of scenarios, and compared to existing algorithms. It is shown that the newly proposed algorithms allow long-term continuous data collection in large networks, offering greater network longevity than existing solutions. These results confirm the validity of the GSF as an architectural approach to the deployment of large wireless sensor networks