Browsing by Subject "Heuristic programming"

Now showing items 1-20 of 55

    • A comparison study of different algorithms for energy-aware placement of virtual machines 

      Olvera, Alex; Xhafa Xhafa, Fatos (Springer, 2018)
      Conference report
      Restricted access - publisher's policy
      Cloud Computing services are essential to modern society. The increasing number of people and organisations using these types of services results in a higher demand in datacenters, which in turn, is raising energy consumption ...

    • A critical sight to the NEH heuristic 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (Springer, 2017-04-03)
      Part of book or chapter of book
      Restricted access - publisher's policy

    • A genetic algorithm for the mixed flow shop problem 

      Pascual Poch, Mario (Universitat Politècnica de Catalunya, 2019-10-16)
      Master thesis
      Open Access
      Covenantee:   Università degli studi di Trento
      In this thesis we present a new interesting version of the mixed flow shop se-quencing problem, which at the same time is a version of the classic flow shop,a very common topic on operations research.We propose a genetic ...

    • A GRASP-based heuristic to design the GMPLS control plane network topology with resilience guarantees 

      Ruiz Ramírez, Marc; Velasco Esteban, Luis Domingo; Junyent Giralt, Gabriel; Comellas Colomé, Jaume (IEEE Press. Institute of Electrical and Electronics Engineers, 2008)
      Conference report
      Restricted access - publisher's policy
      The control plane topology has traditionally followed that of the data plane and therefore the design of the former, as well as its resilience, has been addressed in the latter's one. Owing to the fact that a clear separation ...

    • 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
      Open Access
      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 proposed mathematical model for the personnel scheduling problem in a manufacturing company 

      Tomàs Olivé, Josep (Universitat Politècnica de Catalunya / Istanbul Teknik Üniversitesi, 2009)
      Master thesis (pre-Bologna period)
      Restricted access - author's decision
      In the current economic and industrial conditions, with demand ever fluctuating and optimization more important in every field, designing a timetable to define a personnel schedule is not an easy task. Personnel scheduling ...

    • A simheuristic for the unmanned aerial vehicle surveillance-routing problem with stochastic travel times and reliability considerations 

      Panadero, Javier; Juan Pérez, Ángel Alejandro; Serrat Piè, Carles; Grifoll Colls, Manel; Freixes, Alfons (2019)
      Conference report
      Open Access
      In the unmanned aerial vehicle (UAV) surveillance-routing problem, a limited fleet of UAVs with driving-range limitations have to visit a series of target zones in order to complete a monitoring operation. This operation ...

    • A survey of the parallel assembly lines balancing problem 

      Aguilar Gamarra, Harry Nick; García Villoria, Alberto; Pastor Moreno, Rafael (2020-12)
      Article
      Open Access
      Assembly lines are mass production systems which are significant in the industrial production of both standard and customised products. Currently, industrial companies offer several products and it is common for an assembly ...

    • Adaptation of some Assembly Line Balancing Heuristics to a Mixed-Model Case 

      Fernández Pérez, Alberto (Universitat Politècnica de Catalunya / Universiteit Gent, 2011)
      Master thesis (pre-Bologna period)
      Open Access
      Covenantee:   Universiteit Gent
      This Master Thesis propose to find the best heuristic solution for one of the types of Assembly Line Balancing Problem, the SALP-1, in a line that needs to produce different models of the same product (mixed-model). That ...

    • Adapting the virtual network topology to near future traffic 

      Morales Alcaide, Fernando; Festa, Paola; Ruiz Ramírez, Marc; Velasco Esteban, Luis Domingo (Institute of Electrical and Electronics Engineers (IEEE), 2017)
      Conference report
      Restricted access - publisher's policy
      The introduction of new services requiring large and dynamic bitrate connectivity can cause changes in the direction of the traffic in metro and even core network segments along the day. This leads to large overprovisioning ...

    • Algoritmo de búsqueda local iterativa para la programación de piezas en un sistema flow shop híbrido 

      De Micheli, Mauro (Universitat Politècnica de Catalunya, 2009-12)
      Master thesis (pre-Bologna period)
      Open Access
      El problema objeto de estudio es la programación de piezas en un sistema flowshop híbrido flexible, con máquinas idénticas en paralelo en cada etapa y tiempos de preparación dependientes de la secuencia. El objetivo de ...

    • Aplicació d’un algorisme genètic per la resolució del problema de seqüenciació d’una màquina amb temps de preparació dependents de família i seqüència 

      LLoveras Nogareda, Ernest (Universitat Politècnica de Catalunya, 2014-01)
      Master thesis (pre-Bologna period)
      Open Access
      Aquest projecte es centra en la resolució d’un problema de seqüenciació mitjançant un procediment metaheurístic. El problema plantejat i que es resol en aquest projecte és el “Problema de seqüenciació d’una màquina amb ...

    • Aprendizaje circunscripcional de reglas de primer orden mediante sesgos sintácticos y semánticos 

      Núñez Esquer, Gustavo; Cortés García, Claudio Ulises (Asociación de Técnicos de Informática, 1992-08)
      Article
      Open Access
      Se describe un sistema de aprendizaje de reglas de primer orden, a partir de descripciones de situaciones en forma de ejemplos, que utiliza el formalismo de circunscripción como modelo formal de referencia. Los ejemplos ...

    • Asignación de recursos de mantenimiento y reparación a puntos de incidencia: un caso real 

      García Cervilla, Inmaculada (Universitat Politècnica de Catalunya, 2013-06)
      Master thesis (pre-Bologna period)
      Restricted access - author's decision
      En el presente proyecto se diseña un procedimiento de asignación de técnicos de cajeros automáticos a puntos que necesitan de asistencia. A lo largo del tiempo se produce una gran cantidad de avisos de cajeros que deben ...

    • Beam-ACO based on stochastic sampling: a case study on the TSP with time windows 

      López Ibáñez, Manuel; Blum, Christian (2009)
      Article
      Restricted access - publisher's policy
      Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive bounding information for choosing between different ...

    • Behavioral modeling and linearization of a mm-wave power amplifier 

      Melczarsky, I; Gilabert Pinal, Pere Lluís; Giacomo, Di V; Bertran Albertí, Eduardo; Filicori, F (2009-04)
      Article
      Open Access

    • Benefits of robust multiobjective optimization for flexible automotive assembly line balancing 

      Chica Serrano, Manuel; Bautista Valhondo, Joaquín; de Armas, Jesica (2018-03-06)
      Article
      Open Access
      Changing conditions and variations in the demand are frequent in real industrial environments. Decision makers have to take into account this uncertainty and manage it properly. One clear example is the automotive industry ...

    • Comparing three-step heuristics for the permutation flow shop problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2010-03-03)
      Article
      Restricted access - publisher's policy
      In this paper a three steps heuristic for the permutation flow shop problem is proposed. The objective is to minimize the maximum time for completing the jobs, or the makespan. The first two steps are inspired by the NEH ...

    • Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows 

      Sala Reixach, Joan (Universitat Politècnica de Catalunya / Karlsruher Institut für Technology, 2012-09-30)
      Master thesis (pre-Bologna period)
      Open Access
      El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb ...

    • Creació de cel·les de botigues en una franquícia i determinació de la seva política de distribució 

      Torre Martínez, María del Rocío de la (Universitat Politècnica de Catalunya, 2011-06)
      Master thesis (pre-Bologna period)
      Open Access
      El present estudi pretén aprofundir en una nova proposta de gestió en la cadena de subministrament. A través d’una cadena de franquícies de distribució de vins, The Threshers Grup, que es plantejarà introduir un nou ...