Exploració per tema "Tabu search"

Ara es mostren els items 1-12 de 12

    • A GA(TS) hybrid algorithm for scheduling in computational grids 

      Xhafa Xhafa, Fatos; González, Juan A.; Dahal, Keshav P.; Abraham, Ajith (Springer, 2009)
      Text en actes de congrés
      Accés obert
      The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybridization of ...

    • A Tabu search algorithm for scheduling independent jobs in computational grids 

      Xhafa Xhafa, Fatos; Carretero Casado, Javier Sebastián; Dorronsoro, Bernabé; Alba, Enrique (2009)
      Article
      Accés obert
      The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications, and it is a computationally hard problem even when there are no dependencies among jobs. We present in this ...

    • A Tabu search algorithm to schedule university examinations 

      Álvarez-Valdés Olaguíbel, Ramón; Crespo Nuere, Enric; Tamarit Goerlich, José Manuel (Institut d'estadística de Catalunya, 1997)
      Article
      Accés obert
      Scheduling examinations in a large university is an increasingly complex problem, due to its size, the growing flexibility of students' curricula and the interest in including a wide set of objectives and constraints. In ...

    • A web interface for satellite scheduling problems 

      Xhafa Xhafa, Fatos; Garcia, Carlos; Barolli, Admir; Takizawa, Makoto (Institute of Electrical and Electronics Engineers (IEEE), 2016)
      Text en actes de congrés
      Accés obert
      Mission planning plays an important role in satellite control systems, especially with increase of number of satellites and more complex missions to be planned. In a general setting, the satellite mission scheduling consists ...

    • Adaptive search heuristics for the generalized assignment problem 

      Ramalhinho Lourenço, Helena; Serra, Daniel (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
      Article
      Accés obert
      The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, ...

    • Assessment of a shared-taxi routing service for disabled people: Barcelona case study 

      Recio Domènech, Gonzalo; Linares Herreros, María Paz; Diví i Cuesta, Víctor; Casanovas Garcia, Josep (Elsevier, 2021)
      Article
      Accés obert
      Nowadays, multiple passenger ridesharing and its variants look one of the more promising emerging mobility concepts. However, the real implementation of these systems accounting specifically requirements for users should ...

    • Hybrid algorithms for independent batch scheduling in grids 

      Xhafa Xhafa, Fatos; Kolodziej, Joanna; Barolli, Leonard; Kolici, Vladi; Miho, Rozeta; Takizawa, Makoto (2012)
      Article
      Accés obert
      Grid computing has emerged as a wide area distributed paradigm for solving large-scale problems in science, engineering, etc. and is known as the family of eScience grid-enabled applications. Computing planning of incoming ...

    • Long-haul shipment optimization for less-than-truckload carriers 

      Estrada Romeu, Miguel Ángel; Robusté Antón, Francesc (2009)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      Less-than-truckload (LTL) carriers supply freight transportation services for small parcel shipments. These companies consolidate multiple shipments in vehicles to guarantee the efficiency of the system. A method for LTL ...

    • Metaheuristics for the edge-weighted K-cardinality tree problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
      Report de recerca
      Accés obert
      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. ...

    • Methodology for optimal design of efficient air transport network in a competitive environment 

      Trapote Barreira, César (Universitat Politècnica de Catalunya, 2015-12-16)
      Tesi
      Accés obert
      This thesis aims to dissert about air transport network design taking into consideration the current needs about efficiency in a very competitive industry. The main focus for this work is the airline's point of view and ...

    • Parallel skeletons for tabu search method 

      Blesa Aguilera, Maria Josep; Hernàndez, Lluís; Xhafa Xhafa, Fatos (2000-12)
      Report de recerca
      Accés obert
      In this paper we present two parallel skeltons for Tabu Search method --a well known meta-heuristic designed for finding approximate solution of combinatorial optimization problems. Our parallel skeletons are designed ...

    • Using Tabu Search for the Response Time Variability Problem 

      Corominas Subias, Albert; García Villoria, Alberto; Pastor Moreno, Rafael (2009-03)
      Comunicació de congrés
      Accés obert