Now showing items 21-40 of 49

    • 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 ...
    • Generic parallel implementations for Tabu Search 

      Blesa Aguilera, Maria Josep; Petit Silvestre, Jordi; Xhafa Xhafa, Fatos (2005-11)
      External research report
      Open Access
      Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of existing implementations for TS reveals that, on the one hand, these implementations are ad hoc and, on the other hand, most ...
    • 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 ...
    • Hybrid metaheuristics in combinatorial optimization: A survey 

      Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2011-09)
      Article
      Restricted access - publisher's policy
      Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus ...
    • Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2018-01-01)
      Article
      Open Access
      Finding the longest common subsequence of a given set of input strings is a relevant problem arising in various practical settings. One of these problems is the so-called longest arc-preserving common subsequence problem. ...
    • Lagrangean bounds for the optimum communication spanning tree problem 

      Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo (Springer Verlag, 2010)
      Article
      Restricted access - publisher's policy
      This paper considers the Optimum Communication Spanning Tree Problem. An integer programming formulation that yields tight LP bounds is proposed. Given that the computational effort required to obtain the LP bounds ...
    • MALLBA: a library of skeletons for combinatorial optimisation 

      Alba, E; Almeida, F; Blesa Aguilera, Maria Josep; Cabeza, J; Cotta, C; Díaz, M; Dorta, I; Gabarró Vallès, Joaquim; León, C; Luna Garcia, Jesus; Moreno Boronat, Lidia Ana; Pablos, C; Petit Silvestre, Jordi; Rojas Espinosa, Alfonso; Xhafa Xhafa, Fatos (2002-02)
      External research report
      Open Access
      The MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented in C++. MALLBA offers three families of generic resolution methods: exact, heuristic and hybrid. ...
    • MALLBA: towards a combinatorial optimization library for geographically distributed systems 

      Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta, C.; Díaz, M.; Dorta, I.; Gabarró Vallès, Joaquim; González, J.; León, C.; Moreno de Antonio, Luz Marina; Petit Silvestre, Jordi; Roda, J.; Rojas, A.; Xhafa Xhafa, Fatos (2001-06)
      External research report
      Open Access
      Problems arising in different areas such as numerical methods, simulation or optimization can be efficiently solved by parallel super-computing. However, it is not always possible to buy and maintain parallel super-computers. ...
    • Metaheuristics for the edge-weighted K-cardinality tree problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
      External research report
      Open Access
      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. ...
    • Metaheurísticas aplicadas al problema QAP. Estudio y experiencia computacional. 

      Sarria Cerro, Víctor Manuel (Universitat Politècnica de Catalunya, 2010-09)
      Master thesis (pre-Bologna period)
      Open Access
      Este proyecto se ha concebido como el estudio de diferentes metaheurísticas aplicadas al problema de asignación cuadrática conocido por sus siglas en inglés QAP. El problema QAP es un problema tipo NP-Hard ya que no existe ...
    • The multi-depot VRP with vehicle interchanges 

      Rebillas Loredo, Victoria (Universitat Politècnica de Catalunya, 2018-12-19)
      Doctoral thesis
      Open Access
      In real-world logistic operations there are a lot of situations that can be exploited to get better operational strategies. It is important to study these new alternatives, because they can represent significant cost ...
    • Multiresolution hierarchy co-clustering for semantic segmentation in sequences with small variations 

      Varas González, David; Alfaro Vendrell, Mónica; Marqués Acosta, Fernando (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Conference report
      Restricted access - publisher's policy
      This paper presents a co-clustering technique that, given a collection of images and their hierarchies, clusters nodes from these hierarchies to obtain a coherent multiresolution representation of the image collection. We ...
    • On the use of primal and dual knowledge in randomized constructive optimization algorithms 

      Mastrolilli, Monaldo; Blum, Christian (2006-12)
      External research report
      Open Access
      Many approximate heuristics for optimization are either based on neighborhood search or on the construction of solutions. Examples for the latter ones include ant colony optimization and greedy randomized adaptive search ...
    • Optimització de xarxes a partir del grau d'intermediació dels enllaços 

      Gallegos Cervilla, Rubén (Universitat Politècnica de Catalunya, 2011-09-07)
      Master thesis (pre-Bologna period)
      Open Access
      English: In this project we study the optimization of a complex network based on the geographical length of the links and the number of geodesic paths that go through them (edge betweenness). By considering relevant ...
    • Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem 

      Fernández Aréizaga, Elena; Pozo, Miguel Angel; Puerto Albandoz, Justo; Scozzari, Andre (Elsevier, 2017-08-01)
      Article
      Open Access
      Rework adversely impacts the performance of building projects. In this study, data were analyzed from 788 construction incidents in 40 Spanish building projects to determine the effects of project and managerial characteristics ...
    • Parallel skeletons for tabu search method based on search strategies and neighborhood partition 

      Blesa Aguilera, Maria Josep; Hernàndez, Lluís; Xhafa Xhafa, Fatos (2001-05)
      External research report
      Open Access
      In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristic for approximately solving combinatorial optimization problems. Our parallel skeletons are designed and implemented using ...
    • Plataforma de optimización combinatoria como un servicio 

      Pinto Quinto, Cristian Miguel (Universitat Politècnica de Catalunya, 2016-06)
      Bachelor thesis
      Restricted access - confidentiality agreement
    • Procedimientos para la Localización de Áreas de Aportación de Residuos Urbanos 

      Bautista Valhondo, Joaquín; Pereira Gude, Jordi (Ed. Universitat de Lleida, 2003)
      Conference lecture
      Restricted access - publisher's policy
      La localización de un conjunto mínimo de áreas de aportación de residuos urbanos puede verse, en algunos casos, como un problema de cubrimiento, Set Covering Problem, con función unicoste. El presente trabajo describe el ...
    • Reconstrucció de grafs a partir del grau d'intermediació (betweenness) dels seus vèrtex 

      Paz Sánchez, Juan (Universitat Politècnica de Catalunya, 2007-07-05)
      Master thesis (pre-Bologna period)
      Open Access
    • Reformulated acyclic partitioning for rail-rail containers transshipment 

      Albareda Sambola, Maria; Marín Pérez, Alfredo; Rodríguez Chía, Antonio Manuel (Elsevier, 2019-08-16)
      Article
      Restricted access - publisher's policy
      Many rail terminals have loading areas that are properly equipped to move containers between trains. With the growing throughput of these terminals all the trains involved in a sequence of such movements may not ¿t in the ...