Now showing items 21-40 of 65

    • 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 ...
    • Estudi i implementació de programari per a la resolució de problemes d'encaminament de vehicles i altres activitats logístiques 

      Prats Darné, Cristina (Universitat Politècnica de Catalunya, 2022-05-16)
      Master thesis
      Open Access
      L’objecte del present treball consisteix en l’estudi i implementació de programari per a la resolució de problemes d’encaminament de vehicles i altres activitats logístiques. El problema d’encaminament de vehicles VRP ...
    • 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 ...
    • Generic parallel implementations for Tabu Search 

      Blesa Aguilera, Maria Josep; Petit Silvestre, Jordi; Xhafa Xhafa, Fatos (2005-11)
      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 ...
    • Graph layout problems 

      Díaz Cort, Josep (1992)
      Research report
      Open Access
      In this paper we survey the recent results and open questions about some graph layout problems.
    • 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. ...
    • Improvement of logistics for the ambulances of the emergency medical service 

      Jordi i Benajes, Guillem (Universitat Politècnica de Catalunya, 2021-05-13)
      Bachelor thesis
      Restricted access - confidentiality agreement
      Covenantee:   Sistema d’Emergències Mèdiques (SEM)
    • 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)
      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)
      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)
      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 ...
    • Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints 

      Andreu Casas, Enric; García Villoria, Alberto; Pastor Moreno, Rafael (2022-01-01)
      Article
      Restricted access - publisher's policy
      This paper aims to study a variant of the multi-manned assembly line balancing problem (MALBP), which considers the possibility of multiple workers simultaneously performing different tasks at the same workstation. In most ...