Exploració per tema "Ant colony optimization"

Ara es mostren els items 1-20 de 21

    • An Ant-based Algorithm for Distributed RWA in Optical Burst Switching 

      Triay Marquès, Joan; Cervelló Pastor, Cristina (IEEE, 2009-06-28)
      Comunicació de congrés
      Accés obert
      To meet the demanded bandwidth requirements of future optical communication networks, more dynamism, scalability and automatism will need to be provided, which will require, as well, new control plane designs to respond ...

    • 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 ...

    • AntNetAlign: A software package for network alignment 

      Rodríguez i Corominas, Guillem; Blesa Aguilera, Maria Josep; Blum, Christian (Elsevier, 2023-03)
      Article
      Accés obert
      In 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 

      Rodríguez Corominas, Guillem; Blesa Aguilera, Maria Josep; Blum, Christian (2023-01)
      Article
      Accés obert
      Network 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 ...

    • 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 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 ...

    • 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 ...

    • Dynamic anycast routing and wavelength assignment in WDM networks using ant colony optimization (ACO) 

      Bhaskaran, Kavitha; Triay Marquès, Joan; Vokkarane, Vinod M. (IEEE Press. Institute of Electrical and Electronics Engineers, 2011)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to perform better than simulated annealing and ...

    • Estudio paramétrico de pilas para viaductos de carretera 

      Martínez, F.J.; González-Vidosa, F.; Hospitaler, A. (Universitat Politècnica de Catalunya. CIMNE, 2011)
      Article
      Accés obert
      Este artículo trata sobre la optimización económica realizada por métodos heurísticos a 15 pilas de sección rectangular hueca de hormigón armado. Las pilas tienen alturas de 20, 30, 40, 50 y 60 m para viaductos de carretera ...

    • Finding edge-disjoint paths in networks by means of artificial ant colonies 

      Blesa Aguilera, Maria Josep; Blum, Christian (2007-01)
      Report de recerca
      Accés obert
      One of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to ...

    • Finding edge-disjoint paths with artificial ant colonies 

      Blesa Aguilera, Maria Josep; Blum, Christian (2005-04)
      Report de recerca
      Accés obert
      One of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to ...

    • Integration of an EMO-based preference elicitation scheme into a multi-objective ACO algorithm for time and Space Assembly Line Balancing 

      Chica Serrano, Manuel; Cordón García, Oscar; Damas Arroyo, Sergio; Bautista Valhondo, Joaquín (Institute of Electrical and Electronics Engineers (IEEE), 2009-05-15)
      Capítol de llibre
      Accés restringit per política de l'editorial
      In this paper, we consider the incorporation of user preferences based on Nissan automotive company’s domain knowledge into a multi-objective search process for assembly line balancing. We focus on the Time and Space ...

    • Large neighbourhood search algorithms for the founder sequence reconstruction problem 

      Roli, Andrea; Benedettini, Stefano; Stützle, Thomas; Blum, Christian (2012-02)
      Article
      Accés restringit per política de l'editorial
      The reconstruction of founder genetic sequences of a population is a relevant issue in evolutionary biology research. The problem consists in finding a biologically plausible set of genetic sequences (founders), which can ...

    • Metaheuristics for the edge-weighted K-cardinality tree problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
      Report de recerca
      Accés obert
      Metaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. ...

    • Negative learning ant colony optimization for network alignment 

      Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2022)
      Text en actes de congrés
      Accés obert
      The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their ...

    • Network alignment: an integrative view 

      Rodríguez Corominas, Guillem (Universitat Politècnica de Catalunya, 2021-07-01)
      Projecte Final de Màster Oficial
      Accés obert
      The Network Alignment problem is an NP-complete Combinatorial Optimization problem in graphs. The goal is to find an alignment between the input networks, i.e., a mapping between their respective nodes, such that the ...

    • Network alignment: an integrative view 

      Rodríguez Corominas, Guillem (Universitat Politècnica de Catalunya, 2021-07-01)
      Projecte Final de Màster Oficial
      Accés obert
      The Network Alignment problem is an NP-complete Combinatorial Optimization problem in graphs. The goal is to find an alignment between the input networks, i.e., a mapping between their respective nodes, such that the ...

    • New algorithms for DNA sequencing by hybridization 

      Blum, Christian; Yábar Vallès, Mateu; Blesa Aguilera, Maria Josep (2006-12)
      Report de recerca
      Accés obert
      The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of ...

    • Optimització amb colònies de formigues per al problema de màxima expansió d'influència sota un model de llindar lineal 

      Mañoso Oca, Álvaro (Universitat Politècnica de Catalunya, 2022-06-30)
      Treball Final de Grau
      Accés obert
      Les xarxes d'influència són una font d'estudi molt popular a l'actualitat i en aquest treball tractarem amb elles. Intentarem resoldre el problema de màxima expansió d'influència amb un model de llindar linear utilitzant ...