Now showing items 1-20 of 38

    • 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
      Open Access
      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 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)
      Conference report
      Open Access
      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 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
      Open Access
      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)
      Master thesis
      Restricted access - author's decision
      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 skeleton for the Tabu search metaheuristic with applications to problems in software engineering 

      Blesa Aguilera, Maria Josep; Xhafa Xhafa, Fatos (2001-06)
      External research report
      Open Access
      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 ...
    • Aportaciones a la modelización y resolución del problema de reparto proporcional con aplicaciones a la organización 

      Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Corominas Subias, Albert (Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
      Part of book or chapter of book
      Open Access
      El problema del reparto proporcional ha sido estudiado principalmente en relación con el reparto de escaños en una cámara de representantes, pero tiene muchas otras aplicaciones, una de las cuales es la resolución del ...
    • Behavioral Issues in Portfolio Decision Analysis 

      Masia Semmel, Alvaro (Universitat Politècnica de Catalunya / Technical University Munich, 2011)
      Master thesis (pre-Bologna period)
      Restricted access - author's decision
      Covenantee:   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
      Open Access
      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 ...
    • Centralized vs distributed resource allocation in multi cell OFDMA systems 

      Cicalò, Sergio; Tralli, Velio; Pérez Neira, Ana Isabel (2011)
      Conference report
      Restricted access - publisher's policy
      Radio Resource Management with Inter-cell Interference Coordination (ICIC), is a key issue under investigation for next generation wireless systems such as Long Term Evolution (LTE). Although centralized resource allocation ...
    • Computational improvements of microaggregation algorithms for the anonymization of large-scale datasets 

      García Álvarez, Alejandro (Universitat Politècnica de Catalunya, 2017-01)
      Bachelor thesis
      Open Access
      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
      Open Access
      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, ...
    • Cross-conditional entropy and coherence analysis of pharmaco-EEG changes induced by alprazolam 

      Alonso López, Joan Francesc; Mañanas Villanueva, Miguel Ángel; Romero Lafuente, Sergio; Rojas Martínez, Mónica; Riba Serrano, Jordi (2012-03)
      Article
      Restricted access - publisher's policy
      Rationale Quantitative analysis of electroencephalographic signals (EEG) and their interpretation constitute a helpful tool in the assessment of the bioavailability of psychoactive drugs in the brain. Furthermore, ...
    • Distributed multi-target tracking in a wireless sensor network using diffusion strategies and adaptive combiners 

      Anguera-Peris, Jaume (Universitat Politècnica de Catalunya, 2016-09)
      Bachelor thesis
      Restricted access - author's decision
      Covenantee:   Northeastern University
      Las redes de sensores inalámbricos se han ido usando cada vez más en los últimos años debido a su capacidad de observar el entorno, procesar datos y tomar decisiones. Estas características han ganado importancia en el ...
    • Efficient parallel LAN/WAN algorithms for optimization: The mallba project 

      Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta Porras, Carlos; Díaz, M.; Dorta, Isabel; Gabarró Vallès, Joaquim; León Hernández, Coromoto; Luque, G.; Petit Silvestre, Jordi; Rodríguez, C.; Rojas, A.; Xhafa Xhafa, Fatos (2006-06)
      Article
      Open Access
      The mallba project tackles the resolution of combinatorial optimization problems using generic algorithmic skeletons implemented in C++. A skeleton in the mallba library implements an optimization method in one of the three ...
    • Empirically Adjusted Greedy Algoriths (EAGH): A new approach to solving combinatorial optimisation problems 

      Corominas Subias, Albert (2005-10)
      External research report
      Open Access
      A greedy heuristics to solve a given combinatorial optimisation problem can be seen as an element of an infinite set of heuristics, H, which is defined by a function that depends on several parameters. We propose a procedure ...
    • Energy and Carbon emissions aware service allocation for Data Centers based on the Dynamic Bin Packing Problem 

      Guillén Pegueroles, Bernat (Universitat Politècnica de Catalunya / Universität Mannheim, 2013-07-16)
      Master thesis (pre-Bologna period)
      Open Access
      [ANGLÈS] This project endeavours to develop strategies to allocate services in Data Centers in a collaborative relationship between the Data Centers and its users and Energy Providers. We study the implications of allowing ...
    • Estudi del problema de la ruta òptima i la seva aplicació a una empresa de distribució de la Catalunya Central 

      Boix Morros, Oriol; Talavera Serradilla, Carlos (Universitat Politècnica de Catalunya, 2012-01)
      Master thesis (pre-Bologna period)
      Open Access
      Aquest projecte tracta sobre el problema de l’agent viatger i la cerca de mètodes de resolució d’aquest problema. El problema que ens hem trobat consisteix en trobar la ruta òptima per tal de poder visitar diferents punts ...
    • Fitting a two-joint orthogonal chain to a point set 

      Díaz-Báñez, José Miguel; López, Mario A.; Mora Giné, Mercè; Seara Ojea, Carlos; Ventura, Inmaculada (2011-04)
      Article
      Open Access
      We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the objective function is to minimize the maximum orthogonal distance from S to the chain. We show that this ...
    • Fleet rerouting strategies with real-time traffic information 

      Barceló Bugeda, Jaime; Orozco, J.A. (2010)
      Conference report
      Open Access
      The design and evaluation of City Logistics applications requires an integrated framework in which all components could work together. Therefore, City Logistics models should account for vehicle routing applications and ...
    • Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) 

      Calleja Sanz, Gema; Corominas Subias, Albert; García Villoria, Alberto; Pastor Moreno, Rafael (Elsevier, 2015-10-23)
      Article
      Open Access
      This paper addresses an assembly line balancing problem in which the length of the workpieces is larger than the width of the workstations. The problem differs from traditional variants of assembly line balancing in the ...