Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization.

ABSTRACT: A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens' acoustics of their ant hosts. The parasites' reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance's matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust.

SUBMITTER: Sagban R

PROVIDER: S-EPMC4397471 | biostudies-other | 2015

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Link Prediction based on Quantum-Inspired Ant Colony Optimization.

Project description:Incomplete or partial observations of network structures pose a serious challenge to theoretical and engineering studies of real networks. To remedy the missing links in real datasets, topology-based link prediction is introduced into the studies of various networks. Due to the complexity of network structures, the accuracy and robustness of most link prediction algorithms are not satisfying enough. In this paper, we propose a quantum-inspired ant colony optimization algorithm that integrates ant colony optimization and quantum computing to predict links in networks. Extensive experiments on both synthetic and real networks show that the accuracy and robustness of the new algorithm is competitive in respect to most of the state of the art algorithms. This result suggests that the application of intelligent optimization to link prediction is promising for boosting its accuracy and robustness.

| S-EPMC6127200 | biostudies-literature

Multi-objective <i>de novo</i> molecular design of organic structure-directing agents for zeolites using nature-inspired ant colony optimization.

Project description:Organic structure-directing agents (OSDAs) are often employed for synthesis of zeolites with desired frameworks. A priori prediction of such OSDAs has mainly relied on the interaction energies between OSDAs and zeolite frameworks, without cost considerations. For practical purposes, the cost of OSDAs becomes a critical issue. Therefore, the development of a computational de novo prediction methodology that can speed up the trial-and-error cycle in the search for less expensive OSDAs is desired. This study utilized a nature-inspired ant colony optimization method to predict physicochemically and/or economically preferable OSDAs, while also taking molecular similarity and heuristics of zeolite synthesis into consideration. The prediction results included experimentally known OSDAs, candidates having structures closely related to known OSDAs, and novel ones, suggesting the applicability of this approach.

| S-EPMC8163217 | biostudies-literature

A novel algorithm for parameter estimation of Hidden Markov Model inspired by Ant Colony Optimization.

Project description:HMM is a powerful method to model data in various fields. Estimation of Hidden Markov Model parameters is an NP-Hard problem. We propose a heuristic algorithm called "AntMarkov" to improve the efficiency of estimating HMM parameters. We compared our method with four algorithms. The comparison was conducted on 5 different simulated datasets with different features. For further evaluation, we analyzed the performance of algorithms on the prediction of protein secondary structures problem. The results demonstrate that our algorithm obtains better results with respect to the results of the other algorithms in terms of time efficiency and the amount of similarity of estimated parameters to the original parameters and log-likelihood. The source code of our algorithm is available in https://github.com/emdadi/HMMPE.

| S-EPMC6422281 | biostudies-literature

Hippopotamus optimization algorithm: a novel nature-inspired optimization algorithm.

Project description:The novelty of this article lies in introducing a novel stochastic technique named the Hippopotamus Optimization (HO) algorithm. The HO is conceived by drawing inspiration from the inherent behaviors observed in hippopotamuses, showcasing an innovative approach in metaheuristic methodology. The HO is conceptually defined using a trinary-phase model that incorporates their position updating in rivers or ponds, defensive strategies against predators, and evasion methods, which are mathematically formulated. It attained the top rank in 115 out of 161 benchmark functions in finding optimal value, encompassing unimodal and high-dimensional multimodal functions, fixed-dimensional multimodal functions, as well as the CEC 2019 test suite and CEC 2014 test suite dimensions of 10, 30, 50, and 100 and Zigzag Pattern benchmark functions, this suggests that the HO demonstrates a noteworthy proficiency in both exploitation and exploration. Moreover, it effectively balances exploration and exploitation, supporting the search process. In light of the results from addressing four distinct engineering design challenges, the HO has effectively achieved the most efficient resolution while concurrently upholding adherence to the designated constraints. The performance evaluation of the HO algorithm encompasses various aspects, including a comparison with WOA, GWO, SSA, PSO, SCA, FA, GOA, TLBO, MFO, and IWO recognized as the most extensively researched metaheuristics, AOA as recently developed algorithms, and CMA-ES as high-performance optimizers acknowledged for their success in the IEEE CEC competition. According to the statistical post hoc analysis, the HO algorithm is determined to be significantly superior to the investigated algorithms. The source codes of the HO algorithm are publicly available at https://www.mathworks.com/matlabcentral/fileexchange/160088-hippopotamus-optimization-algorithm-ho .

| S-EPMC10904400 | biostudies-literature

Metabolic pathways synthesis based on ant colony optimization.

Project description:One of the current challenges in bioinformatics is to discover new ways to transform a set of compounds into specific products. The usual approach is finding the reactions to synthesize a particular product, from a given substrate, by means of classical searching algorithms. However, they have three main limitations: difficulty in handling large amounts of reactions and compounds; absence of a step that verifies the availability of substrates; and inability to find branched pathways. We present here a novel bio-inspired algorithm for synthesizing linear and branched metabolic pathways. It allows relating several compounds simultaneously, ensuring the availability of substrates for every reaction in the solution. Comparisons with classical searching algorithms and other recent metaheuristic approaches show clear advantages of this proposal, fully recovering well-known pathways. Furthermore, solutions found can be analyzed in a simple way through graphical representations on the web.

| S-EPMC6219534 | biostudies-literature

All-Optical Implementation of the Ant Colony Optimization Algorithm.

Project description:We report all-optical implementation of the optimization algorithm for the famous "ant colony" problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems.

| S-EPMC4879568 | biostudies-literature

Semi-supervised associative classification using ant colony optimization algorithm.

Project description:Labeled data is the main ingredient for classification tasks. Labeled data is not always available and free. Semi-supervised learning solves the problem of labeling the unlabeled instances through heuristics. Self-training is one of the most widely-used comprehensible approaches for labeling data. Traditional self-training approaches tend to show low classification accuracy when the majority of the data is unlabeled. A novel approach named Self-Training using Associative Classification using Ant Colony Optimization (ST-AC-ACO) has been proposed in this article to label and classify the unlabeled data instances to improve self-training classification accuracy by exploiting the association among attribute values (terms) and between a set of terms and class labels of the labeled instances. Ant Colony Optimization (ACO) has been employed to construct associative classification rules based on labeled and pseudo-labeled instances. Experiments demonstrate the superiority of the proposed associative self-training approach to its competing traditional self-training approaches.

| S-EPMC8444075 | biostudies-literature

CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET.

Project description:A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO.

| S-EPMC4858224 | biostudies-literature

Ant colony optimization-based adjusted PID parameters: a proposed method.

Project description:The ant colony algorithm (ACA) is a heuristic algorithm that resolves the optimality problem by simulating an ant's foraging process, which finds the shortest path. The connotation of the ACA is to find the optimal solution. The Proportional Integral Derivative (PID) parameter tuning is an essential tool in the control field and includes three parameters, Kp, Ki, and Kd, to achieve the best control effect. Besides, tuning the PID parameters is closely related to finding the "optimal" solution that can be attained based on the feasible combination of the two. This article transforms the PID parameter tuning problem into an ACA that finds the optimal solution called ACA-based PID parameters tuning. Furthermore, PID control is simulated by setting the parameters of ACA, such as ant colony size, iteration times, nodes, paths, path evaluation criteria, pheromone concentration, heuristic function, weight factor, and decision function. Eventually, the two PID controller parameter tuning strategies are compared and analyzed, and the advantages and disadvantages of each are obtained. Compared with the 4:1 attenuation curve method, the proposed method can significantly reduce the MP score of the overshoot of the system, increase the time, and improve the dynamic and steady-state performance of the system, but reduce the steady-state error of the system. Therefore, the feasibility and effectiveness of the proposed method is verified.

| S-EPMC10703037 | biostudies-literature

A modified ant colony optimization algorithm for tumor marker gene selection.

Project description:Microarray data are often extremely asymmetric in dimensionality, such as thousands or even tens of thousands of genes but only a few hundreds of samples or less. Such extreme asymmetry between the dimensionality of genes and samples can lead to inaccurate diagnosis of disease in clinic. Therefore, it has been shown that selecting a small set of marker genes can lead to improved classification accuracy. In this paper, a simple modified ant colony optimization (ACO) algorithm is proposed to select tumor-related marker genes, and support vector machine (SVM) is used as classifier to evaluate the performance of the extracted gene subset. Experimental results on several benchmark tumor microarray datasets showed that the proposed approach produces better recognition with fewer marker genes than many other methods. It has been demonstrated that the modified ACO is a useful tool for selecting marker genes and mining high dimension data.

| S-EPMC5054414 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data