Reports de recerca
http://hdl.handle.net/2117/121
2024-03-28T10:59:45ZProgramación lineal entera mixta para asignar voluntarios a la organización de eventos deportivos. Caso aptitud no restringida
http://hdl.handle.net/2117/114879
Programación lineal entera mixta para asignar voluntarios a la organización de eventos deportivos. Caso aptitud no restringida
Bautista Valhondo, Joaquín; Mateo Doll, Manuel; Torre Martínez, María del Rocío de la
En este trabajo presentamos un modelo de Programación Lineal Entera Mixta (MILP por sus siglas en inglés) para optimizar la asignación de voluntarios a los puestos de trabajo que requiere una Organización destinada a dirigir, coordinar y controlar las actividades de un evento deportivo de gran dimensión. El modelo tiene en cuenta el conjunto de voluntarios y sus características, así como el conjunto de tareas y sedes propias de un Evento, y tiene el objetivo de maximizar la Aptitud global del voluntariado a las tareas y a los encuentros o sedes. La explotación del modelo la realizamos con el solucionador CPLEX y empleamos un caso de estudio vinculado a la XVII Copa Mundial de Baloncesto FIBA que tuvo lugar en España en el año 2014. El método de resolución que proponemos es capaz de resolver instancias con 15000 voluntarios, 27 tipos de tareas y 6 sedes deportivas, en un tiempo de CPU inferior a 3 segundos.
Voluntariado XVII Copa Mundial de Baloncesto FIBA (Spain 2014) · FIBA-2014BWC-SPAIN / MILP · IBM ILOG CPLEX
2018-03-07T09:20:16ZBautista Valhondo, JoaquínMateo Doll, ManuelTorre Martínez, María del Rocío de laEn este trabajo presentamos un modelo de Programación Lineal Entera Mixta (MILP por sus siglas en inglés) para optimizar la asignación de voluntarios a los puestos de trabajo que requiere una Organización destinada a dirigir, coordinar y controlar las actividades de un evento deportivo de gran dimensión. El modelo tiene en cuenta el conjunto de voluntarios y sus características, así como el conjunto de tareas y sedes propias de un Evento, y tiene el objetivo de maximizar la Aptitud global del voluntariado a las tareas y a los encuentros o sedes. La explotación del modelo la realizamos con el solucionador CPLEX y empleamos un caso de estudio vinculado a la XVII Copa Mundial de Baloncesto FIBA que tuvo lugar en España en el año 2014. El método de resolución que proponemos es capaz de resolver instancias con 15000 voluntarios, 27 tipos de tareas y 6 sedes deportivas, en un tiempo de CPU inferior a 3 segundos.Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
http://hdl.handle.net/2117/87311
Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem
Ribas Vila, Immaculada; Companys Pascual, Ramón
The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we show the best solutions found during our research for the Taillard’s instances adapted to this problem.
In this working paper we show the best values found for the Taillard’s benchmark [17] applied to the DBFSP.
2016-05-25T10:29:15ZRibas Vila, ImmaculadaCompanys Pascual, RamónThe distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we show the best solutions found during our research for the Taillard’s instances adapted to this problem.Principales tendencias en el ámbito universitario a nivel internacional en el año 2.015
http://hdl.handle.net/2117/86087
Principales tendencias en el ámbito universitario a nivel internacional en el año 2.015
Olivella Nadal, Jordi; Calleja Sanz, Gema
Este documento de trabajo trata sobre las grandes tendencias que se advierten en a nivel internacional en relación a las universidades, a partir de las noticias más relevantes aparecidas en el año 2.015. Se consideran los diferentes aspectos de su actividad, así como los distintos intereses implicados.
Working paper
2016-04-22T07:49:26ZOlivella Nadal, JordiCalleja Sanz, GemaEste documento de trabajo trata sobre las grandes tendencias que se advierten en a nivel internacional en relación a las universidades, a partir de las noticias más relevantes aparecidas en el año 2.015. Se consideran los diferentes aspectos de su actividad, así como los distintos intereses implicados.Analysis of urban freight distribution measures
http://hdl.handle.net/2117/78718
Analysis of urban freight distribution measures
Sanz, Guillem; Pastor Moreno, Rafael; Benedito Benet, Ernest; Domenech, Bruno
Urban Freight Distribution (UFD) represents a very important activity in terms of cities economy, but can also be a problem for the daily life of citizens, due to traffic, noise and environmental contamination. Therefore UFD activities must be managed cautiously, to avoid or minimise external negative effects. In this context,
this research aims to evaluate existing UFD measures, ranking the
m from the best to the worst one, according to experts’ opinions. The proposed evaluation process is flexible in order to allow evaluating future UFD measures that may arise.
2015-11-03T11:56:23ZSanz, GuillemPastor Moreno, RafaelBenedito Benet, ErnestDomenech, BrunoUrban Freight Distribution (UFD) represents a very important activity in terms of cities economy, but can also be a problem for the daily life of citizens, due to traffic, noise and environmental contamination. Therefore UFD activities must be managed cautiously, to avoid or minimise external negative effects. In this context,
this research aims to evaluate existing UFD measures, ranking the
m from the best to the worst one, according to experts’ opinions. The proposed evaluation process is flexible in order to allow evaluating future UFD measures that may arise.A novel algorithm for isolated electrification projects
http://hdl.handle.net/2117/27815
A novel algorithm for isolated electrification projects
Ranaboldo, Matteo; García Villoria, Alberto; Ferrer Martí, Laia; Pastor Moreno, Rafael
In this report it is proposed a metaheuristic
procedure
to support the design of
stand
-
alone commun
ity electrification projects. In particular, the
solution returned by the
procedure specifies the generator locations and di
stribution th
rough microgrids.
This report
provides the
description
of the proposed procedure, which would require low computational
resources
2015-05-07T11:37:13ZRanaboldo, MatteoGarcía Villoria, AlbertoFerrer Martí, LaiaPastor Moreno, RafaelIn this report it is proposed a metaheuristic
procedure
to support the design of
stand
-
alone commun
ity electrification projects. In particular, the
solution returned by the
procedure specifies the generator locations and di
stribution th
rough microgrids.
This report
provides the
description
of the proposed procedure, which would require low computational
resourcesBest solutions of taillard's instances for the flow shopwith blockin to minimize flow time
http://hdl.handle.net/2117/20563
Best solutions of taillard's instances for the flow shopwith blockin to minimize flow time
Companys Pascual, Ramón; Ribas Vila, Immaculada
we summarize the new best solutions, most of them found during in our research, for the Taillard instances.
2013-11-08T11:57:06ZCompanys Pascual, RamónRibas Vila, Immaculadawe summarize the new best solutions, most of them found during in our research, for the Taillard instances.Best solutions of Ronconi, Imma-B and ImmA-C instances for the Fm|block|
http://hdl.handle.net/2117/17563
Best solutions of Ronconi, Imma-B and ImmA-C instances for the Fm|block|
Companys Pascual, Ramón; Ribas Vila, Immaculada
A continuación se presentan las mejores soluciones obtenidas para los ejemplares de Ronconi, Imma-B y Imma-C instances utilizados en el problema Fm|block|ΣT. Los valores han sido obtenidos con la hyperheuristica CERCOP0T.
2013-02-04T08:57:14ZCompanys Pascual, RamónRibas Vila, ImmaculadaA continuación se presentan las mejores soluciones obtenidas para los ejemplares de Ronconi, Imma-B y Imma-C instances utilizados en el problema Fm|block|ΣT. Los valores han sido obtenidos con la hyperheuristica CERCOP0T.An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem
http://hdl.handle.net/2117/17099
An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier
This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a perturbation mechanism that applies, d times, three neighbourhood operators to the current solution to diversify the search. The computational evaluation has shown that the insertion neighbourhood is more effective than the swap one, but it also has shown that the combination of both is a good strategy to improve the obtained solutions. Finally, the comparison of the ILS with an Iterated greedy algorithm and with a greedy randomized adaptive search procedure has revealed its good performance.
2012-12-11T12:43:16ZRibas Vila, ImmaculadaCompanys Pascual, RamónTort-Martorell Llabrés, XavierThis paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a perturbation mechanism that applies, d times, three neighbourhood operators to the current solution to diversify the search. The computational evaluation has shown that the insertion neighbourhood is more effective than the swap one, but it also has shown that the combination of both is a good strategy to improve the obtained solutions. Finally, the comparison of the ILS with an Iterated greedy algorithm and with a greedy randomized adaptive search procedure has revealed its good performance.Hybrid metaheuristics for the tardines blocking flow shop problem
http://hdl.handle.net/2117/17098
Hybrid metaheuristics for the tardines blocking flow shop problem
Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier
This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of solutions. In the ILS algorithm, the diversification is performed by a perturbation mechanism that takes into account some characteristics of the problem; whereas the perturbation in the IG is performed through a deconstruction and construction phase proposed in the literature that has been proven to be very effective in dealing also with the makespan criterion. Moreover, the algorithms have been tested with three initial solution procedures. The computation of these algorithms when evaluated against an algorithm from the literature has shown their good performance.
2012-12-11T12:29:09ZRibas Vila, ImmaculadaCompanys Pascual, RamónTort-Martorell Llabrés, XavierThis paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of solutions. In the ILS algorithm, the diversification is performed by a perturbation mechanism that takes into account some characteristics of the problem; whereas the perturbation in the IG is performed through a deconstruction and construction phase proposed in the literature that has been proven to be very effective in dealing also with the makespan criterion. Moreover, the algorithms have been tested with three initial solution procedures. The computation of these algorithms when evaluated against an algorithm from the literature has shown their good performance.ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
http://hdl.handle.net/2117/16386
ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
Juan, Angel A.; Ramalhinho Lourenço, Helena; Mateo Doll, Manuel; Castellà, Quim; Barrios, Barry B.
From a managerial point of view, the more e cient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be
used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop
Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP
algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most
e cient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can a ect their
performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic ‘common
sense’ rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new
operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased
randomization process of the initial solution to randomly generate di erent alternative initial solutions of similar quality -which is
attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding
poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed
computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and
compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art
metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top
ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number
generator.
2012-07-31T11:38:12ZJuan, Angel A.Ramalhinho Lourenço, HelenaMateo Doll, ManuelCastellà, QuimBarrios, Barry B.From a managerial point of view, the more e cient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be
used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop
Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP
algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most
e cient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can a ect their
performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic ‘common
sense’ rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new
operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased
randomization process of the initial solution to randomly generate di erent alternative initial solutions of similar quality -which is
attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding
poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed
computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and
compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art
metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top
ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number
generator.