Ara es mostren els items 1-20 de 47

  • A brief survey on hybrid metaheuristics 

    Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    The 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 ...
  • ACO_R híbrido con múltiples colonias para problemas de optimización continua 

    Blum, Christian; Cardoso, Pedro; Herrera, Francisco (2009)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Este 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 ...
  • A hybrid metaheuristic for the longest common subsequence problem 

    Lozano, Manuel; Blum, Christian (2010-10)
    Article
    Accés restringit per política de l'editorial
    The 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 

    Blum, Christian (2006-01)
    Report de recerca
    Accés obert
    In 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 ...
  • Ant colony optimization 

    Blum, Christian (ACM Press. Association for Computing Machinery, 2009)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    ◮ 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 

    Hernández Pibernat, Hugo; Blum, Christian (2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Most, 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 

    Dorigo, Marco; Blum, Christian (2005-11)
    Article
    Accés restringit per política de l'editorial
    Research 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 ...
  • A probabilistic beam search approach to the shortest common supersequence problem 

    Blum, Christian; Cotta, C.; Fernández, Antonio J.; Gallardo, Francisco (2006-11)
    Report de recerca
    Accés obert
    The 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 

    Hernández Pibernat, Hugo; Baumgartner, Tobias; Blesa Aguilera, Maria Josep; Blum, Christian; Kröller, Alexander; Fekete, Sandor P. (IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In 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 

    Benedettini, Stefano; Blum, Christian; Roli, Andrea (2010-04)
    Article
    Accés restringit per política de l'editorial
    The 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 ...
  • Asynchronous simulation of a self-synchronized duty-cycling mechanism for mobile sensor networks 

    Hernández Pibernat, Hugo; Blum, Christian (2009)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In 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-ACO applied to assembly line balancing 

    Blum, Christian; Bautista Valhondo, Joaquín; Pereira Gude, Jordi (2006-05)
    Report de recerca
    Accés obert
    Assembly 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 

    López Ibáñez, Manuel; Blum, Christian (2009)
    Article
    Accés restringit per política de l'editorial
    Beam-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 ...
  • Beam-ACO based on stochastic sampling: a case study on the TSP with time windows 

    López Ibáñez, Manuel; Blum, Christian (2008-10)
    Report de recerca
    Accés obert
    Beam-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 ...
  • Beam-ACO for the longest common subsequence problem 

    Blum, Christian (IEEE Computer Society Publications, 2010)
    Text en actes de congrés
    Accés obert
    The longest common subsequence problem is classical string problem. It has applications, for example, in pattern recognition and bioinformatics. In this work we present a socalled Beam-ACO approach for solving this problem. ...
  • Beam-ACO for the repetition-free longest common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (2013)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this paper we propose a Beam-ACO approach for a combinatorial optimization problem known as the repetition-free longest common subsequence problem. Given two input sequences x and y over a finite alphabet S, this problem ...
  • Beam-ACO for the travelling salesman problem with time windows 

    López Ibáñez, Manuel; Blum, Christian (2009-07)
    Report de recerca
    Accés obert
    The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper ...
  • Beam search for the longest common subsequence problem 

    Blum, Christian; Blesa Aguilera, Maria Josep; López Ibañez, Manuel (2008-10)
    Report de recerca
    Accés obert
    The 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 ...
  • Can frogs find large independent sets in a decentralized way? Yes they can! 

    Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (Springer, 2014)
    Text en actes de congrés
    Accés obert
    The problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility ...
  • Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2005-04)
    Report de recerca
    Accés obert
    Research efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony ...