Now showing items 1-8 of 8

  • 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
    Open Access
    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, ...
  • 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
    Open Access
    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)
    Conference report
    Open Access
    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 ...
  • Long-haul shipment optimization for less-than-truckload carriers 

    Estrada Romeu, Miguel Ángel; Robusté Antón, Francesc (2009)
    Conference lecture
    Restricted access - publisher's policy
    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)
    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. ...
  • 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)
    Doctoral thesis
    Open Access
    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)
    External research report
    Open Access
    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)
    Conference lecture
    Open Access