Now showing items 1-20 of 47

  • 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 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
    Open Access
    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
    Restricted access - publisher's policy
    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 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 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
    Open Access
    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 ...
  • Ant colony optimization theory : a survey 

    Dorigo, Marco; Blum, Christian (2005-11)
    Article
    Restricted access - publisher's policy
    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 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 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 ...
  • A Survey on graph layout problems 

    Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José (2000-10)
    External research report
    Open Access
    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 ...
  • Bartering integer commodities with exogenous prices 

    Nasini, Stefano; Castro Pérez, Jordi; Fonseca Casas, Pau (2013-11)
    External research report
    Open Access
    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)
    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 ...
  • 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, ...
  • 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 ...
  • 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 ...
  • Estudio comparativo de algoritmos genéticos y algoritmos de búsqueda tabú para la resolución del Flow Shop Problem 

    Franco Flores, Abel (Universitat Politècnica de Catalunya, 2009-06)
    Master thesis (pre-Bologna period)
    Open Access
    El planteamiento de este proyecto presenta como objetivo el abordaje de un problema de secuenciación denominado Taller Mecánico, más conocido como Flow Shop Problem o Jobshop Problem (FSP).Otro problema sumamente importante ...
  • 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 ...