An algorithm based on ant colony optimization for the minimum connected dominating set problem

S Bouamama, C Blum, JG Fages - Applied Soft Computing, 2019 - Elsevier
Ant colony optimization is a well established metaheuristic from the swarm intelligence field
for solving difficult optimization problems. In this work we present an application of ant …

Mobility, citizens, innovation and technology in digital and smart cities

TA Oliveira, YB Gabrich, H Ramalhinho, M Oliver… - Future Internet, 2020 - mdpi.com
Cities are constantly transforming and, consequently, attracting efforts from researchers and
opportunities to the industry. New transportation systems are being built in order to meet …

Context matters: adaptive mutation for grammars

P Carvalho, J Mégane, N Lourenço… - European Conference on …, 2023 - Springer
Abstract This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation method
for Structured Grammatical Evolution (SGE), biologically inspired by the theory of facilitated …

Exploring parallel multi-GPU local search strategies in a metaheuristic framework

E Rios, LS Ochi, C Boeres, VN Coelho… - Journal of Parallel and …, 2018 - Elsevier
Optimization tasks are often complex, CPU-time consuming and usually deal with finding the
best (or good enough) solution among alternatives for a given problem. Parallel …

Protein folding prediction in the HP model using ions motion optimization with a greedy algorithm

CH Yang, KC Wu, YS Lin, LY Chuang, HW Chang - BioData mining, 2018 - Springer
Background The function of a protein is determined by its native protein structure. Among
many protein prediction methods, the Hydrophobic-Polar (HP) model, an ab initio method …

Self-adaptation of genetic operators through genetic programming techniques

AF Cruz-Salinas, JG Perdomo - Proceedings of the Genetic and …, 2017 - dl.acm.org
Here we propose an evolutionary algorithm that self modifies its operators at the same time
that candidate solutions are evolved. This tackles convergence and lack of diversity issues …

An evolution strategy based approach for cover scheduling problem in wireless sensor networks

G Srivastava, P Venkatesh, A Singh - International Journal of Machine …, 2020 - Springer
Cover scheduling problem in wireless sensor networks (WSN-CSP) aims to find a schedule
of covers which minimizes the longest continuous duration of time for which no sensor in the …

An evolution strategy with tailor-made mutation operator for colored balanced traveling salesman problem

S Majumder, A Singh - Applied Intelligence, 2024 - Springer
This paper deals with an NP-hard problem called the colored balanced traveling salesman
problem (CBTSP), which is a variation of colored traveling salesman problem (CTSP) which …

Boosting an evolution strategy with a preprocessing step: application to group scheduling problem in directional sensor networks

G Srivastava, A Singh - Applied Intelligence, 2018 - Springer
This paper presents a two-membered evolution strategy based approach to address the total
rotation minimization problem (TRMP) pertaining to directional sensor networks. TRMP is an …

What You Always Wanted to Know About Evolution Strategies, But Never Dared to Ask

HG Beyer - Proceedings of the Companion Conference on Genetic …, 2023 - dl.acm.org
Evolutionary Algorithms (EA) different EA flavors are due to different variation and selection
methods: classical Evolution Strategies (ES) typically use truncation selection in contrast to …