Ara es mostren els items 1-20 de 65

    • A biased random-key genetic algorithm for the capacitated minimum spanning tree problem 

      Ruiz Ruiz, Hector Efrain; Albareda Sambola, Maria; Fernández Aréizaga, Elena; Resende, Mauricio G. C. (2015-05)
      Article
      Accés obert
      This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ...
    • A boolean rule-based approach for manufacturability-aware cell routing 

      Cortadella, Jordi; Petit Silvestre, Jordi; Gómez Fernández, Sergio; Moll Echeto, Francisco de Borja (2014-03-01)
      Article
      Accés obert
      An approach for cell routing using gridded design rules is proposed. It is technology-independent and parameterizable for different fabrics and design rules, including support for multiple-patterning lithography. The core ...
    • A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem 

      Fernández Aréizaga, Elena; Kalcsics, Jörg; Núñez del Toro, Alma Cristina (Elsevier, 2017-12-16)
      Article
      Accés obert
      This paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the ...
    • A heuristic approach to the design of optimal cross-docking boxes 

      Nieuwenhuis, Robert Lukas Mario; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric (Institute of Electrical and Electronics Engineers (IEEE), 2021-09-03)
      Article
      Accés obert
      Multinational companies frequently work with manufacturers that receive large orders for different products (or product varieties: size, shape, color, texture, material), to serve thousands of different final destinations ...
    • A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem 

      González Martín, Sergio; Juan Pérez, Angel Alejandro; Riera Terrén, Daniel; Caceres Cruz, Jose de Jesus (2011)
      Text en actes de congrés
      Accés obert
      The Arc Routing Problem is a kind of NP-hard routing problems where the demand is located in some of the arcs connecting nodes and should be completely served fulfilling certain constraints. This paper presents a hybrid ...
    • A hybrid multi-start metaheuristic scheduler for astronomical observations 

      Nakhjiri, Nariman; Salamó Llorente, Maria; Sànchez-Marrè, Miquel; Morales Peralta, Juan Carlos (Elsevier, 2023-11)
      Article
      Accés obert
      In this paper, we investigate Astronomical Observations Scheduling which is a type of Multi-Objective Combinatorial Optimization Problem, and detail its specific challenges and requirements and propose the Hybrid Accumulative ...
    • A novel model for arc territory design: promoting Eulerian districts 

      Garcia Ayala, Gariela; González Velarde, José Luis; Rios Mercados, Roger; Fernández Aréizaga, Elena (2015-01-01)
      Article
      Accés obert
      The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ...
    • A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics 

      Ionescu, Dragos; Juan Pérez, Angel Alejandro; Faulín, Javier; Ferrer Biosca, Alberto (2011-01)
      Article
      Accés obert
      This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical ...
    • A production scheduling service for manufacturing short-run series on machining shops 

      Udelman León, Samuel (Universitat Politècnica de Catalunya, 2019-09-29)
      Projecte Final de Màster Oficial
      Accés restringit per decisió de l'autor
      The scheduling process on every production line is of principal importance as it directly affects the productivity of a company. For decades now, operational research has offered managers tools to automate their scheduling ...
    • A simulation-based optimisation for the stochastic green capacitated p-median problem 

      Imran, Arif; Utomo, Eko Wahyu; Ramadhan, Fadillah; Desrianty, Arie; Helianty, Yanti; Mustofa, Fifi Herni (OmniaScience, 2022-12)
      Article
      Accés obert
      Purpose: This paper aims to propose a new model called the stochastic green capacitated p-median problem with a simulation-based optimisation approach. An integer linear programming mathematical model is built considering ...
    • A skeleton for the Tabu search metaheuristic with applications to problems in software engineering 

      Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (2001-06)
      Report de recerca
      Accés obert
      We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. Recently ...
    • A Survey on graph layout problems 

      Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2000-10)
      Report de recerca
      Accés obert
      In this paper we survey results on several graph layout problems from an algorithmic point of view. Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout ...
    • 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 ...
    • Bartering integer commodities with exogenous prices 

      Nasini, Stefano; Castro Pérez, Jordi; Fonseca Casas, Pau (2013-11)
      Report de recerca
      Accés obert
      The analysis of markets with indivisible goods and xed exogenous prices has played an important role in economic models, especially in relation to wage rigidity and unemployment. This paper provides a novel mathematical ...
    • Behavioral Issues in Portfolio Decision Analysis 

      Masia Semmel, Alvaro (Universitat Politècnica de Catalunya / Technical University Munich, 2011)
      Projecte/Treball Final de Carrera
      Accés restringit per decisió de l'autor
      Realitzat a/amb:   Technische Universität München
      In this paper we address the question of how people make decisions in the context of a knapsack problem, which is a simplified version of a portfolio project management problem. We expect people to be influenced by the ...
    • Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems 

      Pastor Moreno, Rafael; Corominas Subias, Albert (Sociedad Española de Estadística e Investigación Operativa, 2004-06)
      Article
      Accés obert
      Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory ...
    • Computational improvements of microaggregation algorithms for the anonymization of large-scale datasets 

      García Álvarez, Alejandro (Universitat Politècnica de Catalunya, 2017-01)
      Treball Final de Grau
      Accés obert
      The technical contents of this work fall within the field of statistical disclosure control (SDC), which concerns the postprocessing of the demographic portion of the statistical results of surveys containing sensitive ...
    • Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2016-03)
      Article
      Accés obert
      In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, ...