Browsing by Author "Blum, Christian"
Now showing items 1-20 of 60
-
A biased random key genetic algorithm for the weighted independent domination problem
(Association for Computing Machinery (ACM), 2019)
Conference lecture
Open AccessThis work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed ... -
A brief survey on hybrid metaheuristics
(2010)
Conference report
Restricted access - publisher's policyThe combination of components from different algorithms is currently one of most successful trends in optimization. The hybridization of metaheuristics, such as ant colony optimization, evolutionary algorithms, and variable ... -
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
(2018-06)
Article
Open AccessThis paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Conference lecture
Open AccessThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ... -
A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
(2017)
Research report
Open AccessThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of arc-annotated ... -
A hybrid metaheuristic for the longest common subsequence problem
(2010-10)
Article
Restricted access - publisher's policyThe longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this ... -
A new hybrid evolutionary algorithm for the k-cardinality tree problem
(2006-01)
Research report
Open AccessIn recent years it has been shown that an intelligent combination of metaheuristics with other optimization techniques can significantly improve over the application of a pure metaheuristic. In this paper, we combine the ... -
A probabilistic beam search approach to the shortest common supersequence problem
(2006-11)
Research report
Open AccessThe Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic ... -
A protocol for self-synchronized duty-cycling in sensor networks: Generic implementation in Wiselib
(IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
Conference report
Restricted access - publisher's policyIn this work we present a protocol for self-synchronized duty-cycling in wireless sensor networks with energy harvesting capabilities. The protocol is implemented in Wiselib, a library of generic algorithms for sensor ... -
A randomized iterated greedy algorithm for the founder sequence reconstruction problem
(2010-04)
Article
Restricted access - publisher's policyThe problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a combinatorial ... -
ACO_R híbrido con múltiples colonias para problemas de optimización continua
(2009)
Conference report
Restricted access - publisher's policyEste trabajo se centra en algoritmos con colonias de hormigas para resolver problemas de optimización continua. En concreto, se propone una extensión de este tipo de algoritmos hacia un método multi-colonia para incrementar ... -
Ant colony optimization
(ACM Press. Association for Computing Machinery, 2009)
Conference report
Restricted access - publisher's policy◮ Origins of ACO: Swarm intelligence ◮ How to transfer the biological inspiration into an algorithm ◮ Example applications of ACO: TSP and Assembly line balancing ◮ Hybridizations of ACO algorithms with more classical ... -
Ant colony optimization for broadcasting in sensor networks under a realistic antenna model
(2010)
Conference report
Restricted access - publisher's policyMost, if not all, works from the literature dealing with minimum energy broadcasting in wireless ad-hoc networks such as sensor networks consider antenna models that allow the adjustment of the emission power to any desired ... -
Ant colony optimization theory : a survey
(2005-11)
Article
Restricted access - publisher's policyResearch on a new metaheuristic for optimization is often initially focused on proof-of-concept applications. It is only after experimental work has shown the practical interest of the method that researchers try to deepen ... -
AntNetAlign: A software package for network alignment
(Elsevier, 2023-03)
Article
Open AccessIn this paper we introduce AntNetAlign, an open-source tool (written in C++) that implements an Ant Colony Optimization (ACO) for solving the Network Alignment (NA) problem, a well-known hard optimization problem with ... -
AntNetAlign: Ant colony optimization for network alignment
(2023-01)
Article
Open AccessNetwork Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between ... -
Asynchronous simulation of a self-synchronized duty-cycling mechanism for mobile sensor networks
(2009)
Conference report
Restricted access - publisher's policyIn previous work we introduced a self-synchronized duty-cycling mechanism for mobile sensor networks with energy harvesting capabilities, inspired by the self-synchroned sleeping patterns that can be observed in real ant ... -
Beam search for the longest common subsequence problem
(2008-10)
Research report
Open AccessThe longest common subsequence problem is a classical string problem that concerns finding the common part of a set of strings. It has several important applications, for example, pattern recognition or computational ... -
Beam-ACO applied to assembly line balancing
(2006-05)
Research report
Open AccessAssembly line balancing concerns the design of assembly lines for the manufacturing of products. In this paper we consider the time and space constrained simple assembly line balancing problem with the objective of minimizing ... -
Beam-ACO based on stochastic sampling: a case study on the TSP with time windows
(2009)
Article
Restricted access - publisher's policyBeam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive bounding information for choosing between different ...
