2019 |
Sánchez-Oro, Jesús; Colmenar, Manuel J; García-Galán, Enrique; López-Sánchez, Ana D How to Locate Disperse Obnoxious Facility Centers? Incollection pp. 52–63, Springer, Cham, 2019. @incollection{Sanchez-Oro2019, title = {How to Locate Disperse Obnoxious Facility Centers?}, author = {Jesús Sánchez-Oro and Manuel J Colmenar and Enrique García-Galán and Ana D López-Sánchez}, url = {http://link.springer.com/10.1007/978-3-030-15843-9_5}, doi = {10.1007/978-3-030-15843-9_5}, year = {2019}, date = {2019-10-01}, pages = {52--63}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Quintana, Juan David; Sánchez-Oro, Jesús; Duarte, Abraham Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search Incollection pp. 114–124, Springer, Cham, 2019. @incollection{Quintana2019, title = {Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search}, author = {Juan David Quintana and Jesús Sánchez-Oro and Abraham Duarte}, url = {http://link.springer.com/10.1007/978-3-030-15843-9_10}, doi = {10.1007/978-3-030-15843-9_10}, year = {2019}, date = {2019-10-01}, pages = {114--124}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Pérez-Peló, Sergio; Sánchez-Oro, Jesús; Duarte, Abraham Detecting Weak Points in Networks Using Variable Neighborhood Search Incollection pp. 141–151, Springer, Cham, 2019. @incollection{Perez-Pelo2019, title = {Detecting Weak Points in Networks Using Variable Neighborhood Search}, author = {Sergio Pérez-Peló and Jesús Sánchez-Oro and Abraham Duarte}, url = {http://link.springer.com/10.1007/978-3-030-15843-9_12}, doi = {10.1007/978-3-030-15843-9_12}, year = {2019}, date = {2019-10-01}, pages = {141--151}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Sánchez-Oro, Jesús; Colmenar, Manuel J; García-Galán, Enrique; López-Sánchez, Ana D How to Locate Disperse Obnoxious Facility Centers? Incollection pp. 52–63, Springer, Cham, 2019. @incollection{Sanchez-Oro2019a, title = {How to Locate Disperse Obnoxious Facility Centers?}, author = {Jesús Sánchez-Oro and Manuel J Colmenar and Enrique García-Galán and Ana D López-Sánchez}, url = {http://link.springer.com/10.1007/978-3-030-15843-9_5}, doi = {10.1007/978-3-030-15843-9_5}, year = {2019}, date = {2019-10-01}, pages = {52--63}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
López-Sánchez, A D; Sánchez-Oro, J; Hernández-Díaz, A G GRASP and VNS for solving the p-next center problem Journal Article Computers & Operations Research, 104 , pp. 295–303, 2019, ISSN: 0305-0548. Abstract | Links | BibTeX | Tags: @article{Lopez-Sanchez2019, title = {GRASP and VNS for solving the p-next center problem}, author = {A D López-Sánchez and J Sánchez-Oro and A G Hernández-Díaz}, url = {https://www.sciencedirect.com/science/article/pii/S0305054818303290}, doi = {10.1016/J.COR.2018.12.017}, issn = {0305-0548}, year = {2019}, date = {2019-04-01}, journal = {Computers & Operations Research}, volume = {104}, pages = {295--303}, publisher = {Pergamon}, abstract = {This paper presents two metaheuristic algorithms for the solution of the p-next center problem: a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search algorithm, that will be subsequently hybridized. The p-next center problem is a variation of the p-center problem, which consists of locating p out of n centers and assigning them to users in order to minimize the maximum, over all users, of the distance of each user to its corresponding center plus the distance between this center to its closest alternative center. This problem emerges from the need to reach a secondary help center in the case of a natural disaster, when the closest center may become unavailable.}, keywords = {}, pubstate = {published}, tppubtype = {article} } This paper presents two metaheuristic algorithms for the solution of the p-next center problem: a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search algorithm, that will be subsequently hybridized. The p-next center problem is a variation of the p-center problem, which consists of locating p out of n centers and assigning them to users in order to minimize the maximum, over all users, of the distance of each user to its corresponding center plus the distance between this center to its closest alternative center. This problem emerges from the need to reach a secondary help center in the case of a natural disaster, when the closest center may become unavailable. |
Herrán, Alberto; Colmenar, Manuel J; Duarte, Abraham A variable neighborhood search approach for the vertex bisection problem Journal Article Information Sciences, 476 , pp. 1–18, 2019, ISSN: 0020-0255. Abstract | Links | BibTeX | Tags: @article{Herran2019, title = {A variable neighborhood search approach for the vertex bisection problem}, author = {Alberto Herrán and Manuel J Colmenar and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0020025518307850}, doi = {10.1016/J.INS.2018.09.063}, issn = {0020-0255}, year = {2019}, date = {2019-02-01}, journal = {Information Sciences}, volume = {476}, pages = {1--18}, publisher = {Elsevier}, abstract = {The Vertex Bisection Problem (VBP) belongs to the family of well-known graph partitioning problems, where the main goal is to find a partition of the vertices maximizing or minimizing a given objective function. These optimization problems have relevant application in the context of scientific computing, VLSI design circuit, or task scheduling in multi-processor systems. This family of problems has gained importance due to its application in clustering and detection of cliques in social, pathological, and biological networks. In this paper we use Basic Variable Neighborhood Search (BVNS) methodology to solve the VBP. In particular, we propose three constructive procedures and six improvement methods. We introduce a novel scheme for calculating the objective function which substantially reduces the computing time as compared with the direct implementation. After a set of preliminary experiments, the best BVNS design is compared with the state-of-the-art over the same set of instances obtaining better results for both, quality of the solutions and execution time. These results are further confirmed by non-parametric statistical tests.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The Vertex Bisection Problem (VBP) belongs to the family of well-known graph partitioning problems, where the main goal is to find a partition of the vertices maximizing or minimizing a given objective function. These optimization problems have relevant application in the context of scientific computing, VLSI design circuit, or task scheduling in multi-processor systems. This family of problems has gained importance due to its application in clustering and detection of cliques in social, pathological, and biological networks. In this paper we use Basic Variable Neighborhood Search (BVNS) methodology to solve the VBP. In particular, we propose three constructive procedures and six improvement methods. We introduce a novel scheme for calculating the objective function which substantially reduces the computing time as compared with the direct implementation. After a set of preliminary experiments, the best BVNS design is compared with the state-of-the-art over the same set of instances obtaining better results for both, quality of the solutions and execution time. These results are further confirmed by non-parametric statistical tests. |
2018 |
Colmenar, J M; Hidalgo, J I; Salcedo-Sanz, S Automatic generation of models for energy demand estimation using Grammatical Evolution Journal Article Energy, 164 , pp. 183–193, 2018, ISSN: 0360-5442. Abstract | Links | BibTeX | Tags: @article{Colmenar2018bb, title = {Automatic generation of models for energy demand estimation using Grammatical Evolution}, author = {J M Colmenar and J I Hidalgo and S Salcedo-Sanz}, url = {https://www.sciencedirect.com/science/article/pii/S0360544218317353}, doi = {10.1016/J.ENERGY.2018.08.199}, issn = {0360-5442}, year = {2018}, date = {2018-12-01}, journal = {Energy}, volume = {164}, pages = {183--193}, publisher = {Pergamon}, abstract = {The estimation of total energy demand in a country from macro-economic variables is an important problem useful to evaluate the robustness of the country's economy. Since the first years of this century, meta-heuristics approaches have been successfully applied to this problem, for different countries and problem's parameterizations. Many of these works optimize prediction models which are based on classical polynomial or simple exponential relationships, which may not be the best option for an accurate energy demand estimation prediction. In this paper the use of Grammatical Evolution is proposed to generate new models for total energy demand estimation at country level. Grammatical Evolution is a class of Genetic Programming algorithm, which is able to automatically generate new models from input variables. In this case, Grammatical Evolution considers macro-economic variables from which it is able to generate new models for total energy demand estimation of a country, with a temporal prediction horizon of one year. The models generated by the Grammatical Evolution are further optimized in order to adjust their parameters to the energy demand estimation. This process is carried out by means of a Differential Evolution approach, which is run for every model generated by the Grammatical Evolution. Thus, the algorithmic proposal consists of a hybrid method, involving Grammatical Evolution for model generation and a Differential Evolution meta-heuristic for the models' parameter tuning. The performance of the proposed approach has been evaluated in two different problems of total energy demand estimation in Spain and France, with excellent results in terms of prediction accuracy.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The estimation of total energy demand in a country from macro-economic variables is an important problem useful to evaluate the robustness of the country's economy. Since the first years of this century, meta-heuristics approaches have been successfully applied to this problem, for different countries and problem's parameterizations. Many of these works optimize prediction models which are based on classical polynomial or simple exponential relationships, which may not be the best option for an accurate energy demand estimation prediction. In this paper the use of Grammatical Evolution is proposed to generate new models for total energy demand estimation at country level. Grammatical Evolution is a class of Genetic Programming algorithm, which is able to automatically generate new models from input variables. In this case, Grammatical Evolution considers macro-economic variables from which it is able to generate new models for total energy demand estimation of a country, with a temporal prediction horizon of one year. The models generated by the Grammatical Evolution are further optimized in order to adjust their parameters to the energy demand estimation. This process is carried out by means of a Differential Evolution approach, which is run for every model generated by the Grammatical Evolution. Thus, the algorithmic proposal consists of a hybrid method, involving Grammatical Evolution for model generation and a Differential Evolution meta-heuristic for the models' parameter tuning. The performance of the proposed approach has been evaluated in two different problems of total energy demand estimation in Spain and France, with excellent results in terms of prediction accuracy. |
Pérez-Peló, Sergio; Sánchez-Oro, Jesús; Martín-Santamaría, Raúl; Duarte, Abraham; Pérez-Peló, Sergio; Sánchez-Oro, Jesús; Martín-Santamaría, Raúl; Duarte, Abraham On the Analysis of the Influence of the Evaluation Metric in Community Detection over Social Networks Journal Article Electronics, 8 (1), pp. 23, 2018, ISSN: 2079-9292. Abstract | Links | BibTeX | Tags: community detection, GRASP, metaheuristic, optimization, social network @article{Perez-Pelo2018a, title = {On the Analysis of the Influence of the Evaluation Metric in Community Detection over Social Networks}, author = {Sergio Pérez-Peló and Jesús Sánchez-Oro and Raúl Martín-Santamaría and Abraham Duarte and Sergio Pérez-Peló and Jesús Sánchez-Oro and Raúl Martín-Santamaría and Abraham Duarte}, url = {http://www.mdpi.com/2079-9292/8/1/23}, doi = {10.3390/electronics8010023}, issn = {2079-9292}, year = {2018}, date = {2018-12-01}, journal = {Electronics}, volume = {8}, number = {1}, pages = {23}, publisher = {Multidisciplinary Digital Publishing Institute}, abstract = {textlessptextgreaterCommunity detection in social networks is becoming one of the key tasks in social network analysis, since it helps with analyzing groups of users with similar interests. As a consequence, it is possible to detect radicalism or even reduce the size of the data to be analyzed, among other applications. This paper presents a metaheuristic approach based on Greedy Randomized Adaptive Search Procedure (GRASP) methodology for detecting communities in social networks. The community detection problem is modeled as an optimization problem, where the objective function to be optimized is the modularity of the network, a well-known metric in this scientific field. The results obtained outperform classical methods of community detection over a set of real-life instances with respect to the quality of the communities detected.textless/ptextgreater}, keywords = {community detection, GRASP, metaheuristic, optimization, social network}, pubstate = {published}, tppubtype = {article} } textlessptextgreaterCommunity detection in social networks is becoming one of the key tasks in social network analysis, since it helps with analyzing groups of users with similar interests. As a consequence, it is possible to detect radicalism or even reduce the size of the data to be analyzed, among other applications. This paper presents a metaheuristic approach based on Greedy Randomized Adaptive Search Procedure (GRASP) methodology for detecting communities in social networks. The community detection problem is modeled as an optimization problem, where the objective function to be optimized is the modularity of the network, a well-known metric in this scientific field. The results obtained outperform classical methods of community detection over a set of real-life instances with respect to the quality of the communities detected.textless/ptextgreater |
Sánchez-Oro, Jesús; Duarte, Abraham Iterated Greedy algorithm for performing community detection in social networks Journal Article Future Generation Computer Systems, 88 , pp. 785–791, 2018, ISSN: 0167-739X. Abstract | Links | BibTeX | Tags: @article{Sanchez-Oro2018, title = {Iterated Greedy algorithm for performing community detection in social networks}, author = {Jesús Sánchez-Oro and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0167739X17323932}, doi = {10.1016/J.FUTURE.2018.06.010}, issn = {0167-739X}, year = {2018}, date = {2018-11-01}, journal = {Future Generation Computer Systems}, volume = {88}, pages = {785--791}, publisher = {North-Holland}, abstract = {The spreading of social networks in our society has aroused the interest of the scientific community in hard optimization problems related to them. Community detection is becoming one of the most challenging problems in social network analysis. The continuous growth of these networks makes exact methods for detecting communities not suitable for being used, since they require large computing times. In this paper, we propose a metaheuristic approach based on the Iterated Greedy methodology for detecting communities in large social networks. The computational results presented in this work show the relevance of the proposal when compared with traditional community detection algorithms in terms of both quality and computing time.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The spreading of social networks in our society has aroused the interest of the scientific community in hard optimization problems related to them. Community detection is becoming one of the most challenging problems in social network analysis. The continuous growth of these networks makes exact methods for detecting communities not suitable for being used, since they require large computing times. In this paper, we propose a metaheuristic approach based on the Iterated Greedy methodology for detecting communities in large social networks. The computational results presented in this work show the relevance of the proposal when compared with traditional community detection algorithms in terms of both quality and computing time. |
Pérez-Peló, Sergio; Sánchez-Oro, Jesús; Duarte, Abraham A Metaheuristic Approach for the $$ $backslash$alpha $$$alpha$-separator Problem Incollection pp. 336–343, Springer, Cham, 2018. @incollection{Perez-Pelo2018, title = {A Metaheuristic Approach for the $$ $backslash$alpha $$$alpha$-separator Problem}, author = {Sergio Pérez-Peló and Jesús Sánchez-Oro and Abraham Duarte}, url = {http://link.springer.com/10.1007/978-3-030-03496-2_37}, doi = {10.1007/978-3-030-03496-2_37}, year = {2018}, date = {2018-11-01}, pages = {336--343}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Colmenar, J M; Martí, R; Duarte, A Heuristics for the Bi-Objective Diversity Problem Journal Article Expert Systems with Applications, 108 , pp. 193–205, 2018, ISSN: 0957-4174. Abstract | Links | BibTeX | Tags: @article{Colmenar2018a, title = {Heuristics for the Bi-Objective Diversity Problem}, author = {J M Colmenar and R Martí and A Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0957417418302963}, doi = {10.1016/J.ESWA.2018.05.013}, issn = {0957-4174}, year = {2018}, date = {2018-10-01}, journal = {Expert Systems with Applications}, volume = {108}, pages = {193--205}, publisher = {Pergamon}, abstract = {The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of diverse points from a given set. The resolution of their associated optimization problems provides solutions of different structures, in both cases with desirable characteristics. They have been extensively studied and we can find many metaheuristic methodologies, such as Greedy Randomized Adaptive Search Procedure, Tabu Search, Iterated Greedy, Variable Neighborhood Search, and Genetic algorithms applied to them to obtain high quality solutions. In this paper we solve the bi-objective problem in which both models are simultaneously optimized. No previous effort has been devoted to study the “combined problem” from a multi-objective perspective. In particular, we adapt the mono-objective methodologies applied to this problem to the resolution of the bi-objective problem, obtaining approximations to its efficient front. An empirical comparison discloses the best alternative to tackle this NP-hard problem.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of diverse points from a given set. The resolution of their associated optimization problems provides solutions of different structures, in both cases with desirable characteristics. They have been extensively studied and we can find many metaheuristic methodologies, such as Greedy Randomized Adaptive Search Procedure, Tabu Search, Iterated Greedy, Variable Neighborhood Search, and Genetic algorithms applied to them to obtain high quality solutions. In this paper we solve the bi-objective problem in which both models are simultaneously optimized. No previous effort has been devoted to study the “combined problem” from a multi-objective perspective. In particular, we adapt the mono-objective methodologies applied to this problem to the resolution of the bi-objective problem, obtaining approximations to its efficient front. An empirical comparison discloses the best alternative to tackle this NP-hard problem. |
Colmenar, J M; Martí, R; Duarte, A Multi-objective memetic optimization for the bi-objective obnoxious p-median problem Journal Article Knowledge-Based Systems, 144 , pp. 88–101, 2018, ISSN: 0950-7051. Abstract | Links | BibTeX | Tags: @article{Colmenar2018c, title = {Multi-objective memetic optimization for the bi-objective obnoxious p-median problem}, author = {J M Colmenar and R Martí and A Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0950705117306068}, doi = {10.1016/J.KNOSYS.2017.12.028}, issn = {0950-7051}, year = {2018}, date = {2018-03-01}, journal = {Knowledge-Based Systems}, volume = {144}, pages = {88--101}, publisher = {Elsevier}, abstract = {Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous facilities. We propose a Multi-Objective Memetic Algorithm (MOMA) to obtain high-quality approximations to the efficient front of the bi-objective obnoxious p-median problem, denoted as Bi-OpM. In particular, we introduce efficient crossover and mutation mechanisms. Additionally, we present several multi-objective local search methods. All the strategies are finally incorporated in a memetic algorithm which limits the search to the feasible region, thus performing an efficient exploration of the solutions space. Our experimentation compares several state-of-the-art procedures with the introduced MOMA emerging as the best performing method in all considered multi-objective metrics.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous facilities. We propose a Multi-Objective Memetic Algorithm (MOMA) to obtain high-quality approximations to the efficient front of the bi-objective obnoxious p-median problem, denoted as Bi-OpM. In particular, we introduce efficient crossover and mutation mechanisms. Additionally, we present several multi-objective local search methods. All the strategies are finally incorporated in a memetic algorithm which limits the search to the feasible region, thus performing an efficient exploration of the solutions space. Our experimentation compares several state-of-the-art procedures with the introduced MOMA emerging as the best performing method in all considered multi-objective metrics. |
Colmenar, Manuel J; Hoff, Arild; Martí, Rafael; Duarte, Abraham Scatter search for the bi-criteria p-median p-dispersion problem Journal Article Progress in Artificial Intelligence, 7 (1), pp. 31–40, 2018, ISSN: 2192-6352. @article{Colmenar2018b, title = {Scatter search for the bi-criteria p-median p-dispersion problem}, author = {Manuel J Colmenar and Arild Hoff and Rafael Martí and Abraham Duarte}, url = {http://link.springer.com/10.1007/s13748-017-0132-6}, doi = {10.1007/s13748-017-0132-6}, issn = {2192-6352}, year = {2018}, date = {2018-03-01}, journal = {Progress in Artificial Intelligence}, volume = {7}, number = {1}, pages = {31--40}, publisher = {Springer Berlin Heidelberg}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Martí, Rafael; Martínez-Gavara, Anna; Sánchez-Oro, Jesús; Duarte, Abraham Tabu search for the dynamic Bipartite Drawing Problem Journal Article Computers & Operations Research, 91 , pp. 1–12, 2018, ISSN: 0305-0548. Abstract | Links | BibTeX | Tags: @article{Marti2018, title = {Tabu search for the dynamic Bipartite Drawing Problem}, author = {Rafael Martí and Anna Martínez-Gavara and Jesús Sánchez-Oro and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0305054817302745}, doi = {10.1016/J.COR.2017.10.011}, issn = {0305-0548}, year = {2018}, date = {2018-03-01}, journal = {Computers & Operations Research}, volume = {91}, pages = {1--12}, publisher = {Pergamon}, abstract = {Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically, we apply a mathematical programming formulation and several heuristic methods based on the tabu search methodology to solve it. In line with the previous paper on this topic, we consider bipartite graphs in our experimentation. The extensive computational experiments with more than 1000 instances show the superiority of our proposals in both, quality and computing time.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically, we apply a mathematical programming formulation and several heuristic methods based on the tabu search methodology to solve it. In line with the previous paper on this topic, we consider bipartite graphs in our experimentation. The extensive computational experiments with more than 1000 instances show the superiority of our proposals in both, quality and computing time. |
Hidalgo, Ignacio J; Colmenar, Manuel J; Kronberger, G; Winkler, S M Glucose Prognosis by Grammatical Evolution Incollection pp. 455–463, Springer, Cham, 2018. @incollection{Hidalgo2018, title = {Glucose Prognosis by Grammatical Evolution}, author = {Ignacio J Hidalgo and Manuel J Colmenar and G Kronberger and S M Winkler}, url = {http://link.springer.com/10.1007/978-3-319-74718-7_55}, doi = {10.1007/978-3-319-74718-7_55}, year = {2018}, date = {2018-01-01}, pages = {455--463}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Díaz álvarez, Josefa ; Risco-Martín, José L; Colmenar, Manuel J Evolutionary design of the memory subsystem Journal Article Applied Soft Computing, 62 , pp. 1088–1101, 2018, ISSN: 1568-4946. Abstract | Links | BibTeX | Tags: @article{DiazAlvarez2018, title = {Evolutionary design of the memory subsystem}, author = {Josefa {Díaz álvarez} and José L Risco-Martín and Manuel J Colmenar}, url = {https://www.sciencedirect.com/science/article/pii/S1568494617305860}, doi = {10.1016/J.ASOC.2017.09.047}, issn = {1568-4946}, year = {2018}, date = {2018-01-01}, journal = {Applied Soft Computing}, volume = {62}, pages = {1088--1101}, publisher = {Elsevier}, abstract = {The memory hierarchy has a high impact on the performance and power consumption in the system. Moreover, current embedded systems, included in mobile devices, are specifically designed to run multimedia applications, which are memory intensive. This increases the pressure on the memory subsystem and affects the performance and energy consumption. In this regard, the thermal problems, performance degradation and high energy consumption, can cause irreversible damage to the devices. We address the optimization of the whole memory subsystem with three approaches integrated as a single methodology. Firstly, the thermal impact of register file is analyzed and optimized. Secondly, the cache memory is addressed by optimizing cache configuration according to running applications and improving both performance and power consumption. Finally, we simplify the design and evaluation process of general-purpose and customized dynamic memory manager, in the main memory. To this aim, we apply different evolutionary algorithms in combination with memory simulators and profiling tools. This way, we are able to evaluate the quality of each candidate solution and take advantage of the exploration of solutions given by the optimization algorithm. We also provide an experimental experience where our proposal is assessed using well-known benchmark applications.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The memory hierarchy has a high impact on the performance and power consumption in the system. Moreover, current embedded systems, included in mobile devices, are specifically designed to run multimedia applications, which are memory intensive. This increases the pressure on the memory subsystem and affects the performance and energy consumption. In this regard, the thermal problems, performance degradation and high energy consumption, can cause irreversible damage to the devices. We address the optimization of the whole memory subsystem with three approaches integrated as a single methodology. Firstly, the thermal impact of register file is analyzed and optimized. Secondly, the cache memory is addressed by optimizing cache configuration according to running applications and improving both performance and power consumption. Finally, we simplify the design and evaluation process of general-purpose and customized dynamic memory manager, in the main memory. To this aim, we apply different evolutionary algorithms in combination with memory simulators and profiling tools. This way, we are able to evaluate the quality of each candidate solution and take advantage of the exploration of solutions given by the optimization algorithm. We also provide an experimental experience where our proposal is assessed using well-known benchmark applications. |
Hidalgo, Ignacio J; Colmenar, Manuel J; Velasco, Manuel J; Kronberger, Gabriel; Winkler, Stephan M; Garnica, Oscar; Lanchares, Juan Identification of Models for Glucose Blood Values in Diabetics by Grammatical Evolution Incollection Handbook of Grammatical Evolution, pp. 367–393, Springer International Publishing, Cham, 2018. @incollection{Hidalgo2018a, title = {Identification of Models for Glucose Blood Values in Diabetics by Grammatical Evolution}, author = {Ignacio J Hidalgo and Manuel J Colmenar and Manuel J Velasco and Gabriel Kronberger and Stephan M Winkler and Oscar Garnica and Juan Lanchares}, url = {http://link.springer.com/10.1007/978-3-319-78717-6_15}, doi = {10.1007/978-3-319-78717-6_15}, year = {2018}, date = {2018-01-01}, booktitle = {Handbook of Grammatical Evolution}, pages = {367--393}, publisher = {Springer International Publishing}, address = {Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Herrán, Alberto; Colmenar, José M; Martí, Rafael; Duarte, Abraham A parallel variable neighborhood search approach for the obnoxious textlessitextgreaterptextless/itextgreater -median problem Journal Article International Transactions in Operational Research, 2018, ISSN: 09696016. Links | BibTeX | Tags: Metaheuristics, obnoxious location, parallel algorithms, VNS @article{Herran2018, title = {A parallel variable neighborhood search approach for the obnoxious textlessitextgreaterptextless/itextgreater -median problem}, author = {Alberto Herrán and José M Colmenar and Rafael Martí and Abraham Duarte}, url = {http://doi.wiley.com/10.1111/itor.12510}, doi = {10.1111/itor.12510}, issn = {09696016}, year = {2018}, date = {2018-01-01}, journal = {International Transactions in Operational Research}, publisher = {John Wiley & Sons, Ltd (10.1111)}, keywords = {Metaheuristics, obnoxious location, parallel algorithms, VNS}, pubstate = {published}, tppubtype = {article} } |
Duarte, Abraham; Sánchez-Oro, Jesús; Mladenović, Nenad; Todosijević, Raca Variable Neighborhood Descent Incollection Handbook of Heuristics, pp. 341–367, Springer International Publishing, Cham, 2018. @incollection{Duarte2018, title = {Variable Neighborhood Descent}, author = {Abraham Duarte and Jesús Sánchez-Oro and Nenad Mladenović and Raca Todosijević}, url = {http://link.springer.com/10.1007/978-3-319-07124-4_9}, doi = {10.1007/978-3-319-07124-4_9}, year = {2018}, date = {2018-01-01}, booktitle = {Handbook of Heuristics}, pages = {341--367}, publisher = {Springer International Publishing}, address = {Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Rodríguez-García, M A; Duarte, A; Sánchez-Oro, J GRASP with Path Relinking for 2D-Bandwidth Minimization Problem Inproceedings Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications - LOPAL '18, pp. 1–5, ACM Press, New York, New York, USA, 2018, ISBN: 9781450353045. Links | BibTeX | Tags: 2D bandwidth minimization, GRASP, Path Relinking @inproceedings{Rodriguez-Garcia2018, title = {GRASP with Path Relinking for 2D-Bandwidth Minimization Problem}, author = {M A Rodríguez-García and A Duarte and J Sánchez-Oro}, url = {http://dl.acm.org/citation.cfm?doid=3230905.3230953}, doi = {10.1145/3230905.3230953}, isbn = {9781450353045}, year = {2018}, date = {2018-01-01}, booktitle = {Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications - LOPAL '18}, pages = {1--5}, publisher = {ACM Press}, address = {New York, New York, USA}, keywords = {2D bandwidth minimization, GRASP, Path Relinking}, pubstate = {published}, tppubtype = {inproceedings} } |
2017 |
Sánchez-Oro, Jesús; López-Sánchez, Ana D; Colmenar, Manuel J A general variable neighborhood search for solving the multi-objective open vehicle routing problem Journal Article Journal of Heuristics, pp. 1–30, 2017, ISSN: 1381-1231. @article{Sanchez-Oro2017, title = {A general variable neighborhood search for solving the multi-objective open vehicle routing problem}, author = {Jesús Sánchez-Oro and Ana D López-Sánchez and Manuel J Colmenar}, url = {http://link.springer.com/10.1007/s10732-017-9363-8}, doi = {10.1007/s10732-017-9363-8}, issn = {1381-1231}, year = {2017}, date = {2017-12-01}, journal = {Journal of Heuristics}, pages = {1--30}, publisher = {Springer US}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Sánchez-Oro, Jesús; Martínez-Gavara, Anna; Laguna, Manuel; Martí, Rafael; Duarte, Abraham Variable neighborhood scatter search for the incremental graph drawing problem Journal Article Computational Optimization and Applications, 68 (3), pp. 775–797, 2017, ISSN: 0926-6003. @article{Sanchez-Oro2017d, title = {Variable neighborhood scatter search for the incremental graph drawing problem}, author = {Jesús Sánchez-Oro and Anna Martínez-Gavara and Manuel Laguna and Rafael Martí and Abraham Duarte}, url = {http://link.springer.com/10.1007/s10589-017-9926-5}, doi = {10.1007/s10589-017-9926-5}, issn = {0926-6003}, year = {2017}, date = {2017-12-01}, journal = {Computational Optimization and Applications}, volume = {68}, number = {3}, pages = {775--797}, publisher = {Springer US}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Sánchez-Oro, Jesús; López-Sánchez, Ana D; Colmenar, Manuel J A general variable neighborhood search for solving the multi-objective open vehicle routing problem Journal Article Journal of Heuristics, pp. 1–30, 2017, ISSN: 1381-1231. @article{Sanchez-Oro2017e, title = {A general variable neighborhood search for solving the multi-objective open vehicle routing problem}, author = {Jesús Sánchez-Oro and Ana D López-Sánchez and Manuel J Colmenar}, url = {http://link.springer.com/10.1007/s10732-017-9363-8}, doi = {10.1007/s10732-017-9363-8}, issn = {1381-1231}, year = {2017}, date = {2017-12-01}, journal = {Journal of Heuristics}, pages = {1--30}, publisher = {Springer US}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Hidalgo, Ignacio J; Colmenar, Manuel J; Kronberger, Gabriel; Winkler, Stephan M; Garnica, Oscar; Lanchares, Juan Data Based Prediction of Blood Glucose Concentrations Using Evolutionary Methods Journal Article Journal of Medical Systems, 41 (9), pp. 142, 2017, ISSN: 0148-5598. @article{Hidalgo2017a, title = {Data Based Prediction of Blood Glucose Concentrations Using Evolutionary Methods}, author = {Ignacio J Hidalgo and Manuel J Colmenar and Gabriel Kronberger and Stephan M Winkler and Oscar Garnica and Juan Lanchares}, url = {http://link.springer.com/10.1007/s10916-017-0788-2}, doi = {10.1007/s10916-017-0788-2}, issn = {0148-5598}, year = {2017}, date = {2017-09-01}, journal = {Journal of Medical Systems}, volume = {41}, number = {9}, pages = {142}, publisher = {Springer US}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Sánchez-Oro, Jesús; Mladenović, Nenad; Duarte, Abraham General Variable Neighborhood Search for computing graph separators Journal Article Optimization Letters, 11 (6), pp. 1069–1089, 2017, ISSN: 1862-4472. @article{Sanchez-Oro2017c, title = {General Variable Neighborhood Search for computing graph separators}, author = {Jesús Sánchez-Oro and Nenad Mladenović and Abraham Duarte}, url = {http://link.springer.com/10.1007/s11590-014-0793-z}, doi = {10.1007/s11590-014-0793-z}, issn = {1862-4472}, year = {2017}, date = {2017-08-01}, journal = {Optimization Letters}, volume = {11}, number = {6}, pages = {1069--1089}, publisher = {Springer Berlin Heidelberg}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Menéndez, Borja; Pardo, Eduardo G; Sánchez-Oro, Jesús; Duarte, Abraham Parallel variable neighborhood search for the min-max order batching problem Journal Article International Transactions in Operational Research, 24 (3), pp. 635–662, 2017, ISSN: 09696016. Links | BibTeX | Tags: general variable neighborhood search, max order batching problem, min, parallel variable neighborhood search @article{Menendez2017, title = {Parallel variable neighborhood search for the min-max order batching problem}, author = {Borja Menéndez and Eduardo G Pardo and Jesús Sánchez-Oro and Abraham Duarte}, url = {http://doi.wiley.com/10.1111/itor.12309}, doi = {10.1111/itor.12309}, issn = {09696016}, year = {2017}, date = {2017-05-01}, journal = {International Transactions in Operational Research}, volume = {24}, number = {3}, pages = {635--662}, publisher = {John Wiley & Sons, Ltd (10.1111)}, keywords = {general variable neighborhood search, max order batching problem, min, parallel variable neighborhood search}, pubstate = {published}, tppubtype = {article} } |
Sánchez-Oro, Jesús; Sevaux, Marc; Rossi, André; Martí, Rafael; Duarte, Abraham Improving the performance of embedded systems with variable neighborhood search Journal Article Applied Soft Computing, 53 , pp. 217–226, 2017, ISSN: 1568-4946. Abstract | Links | BibTeX | Tags: @article{Sanchez-Oro2017a, title = {Improving the performance of embedded systems with variable neighborhood search}, author = {Jesús Sánchez-Oro and Marc Sevaux and André Rossi and Rafael Martí and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S1568494616306597}, doi = {10.1016/J.ASOC.2016.12.034}, issn = {1568-4946}, year = {2017}, date = {2017-04-01}, journal = {Applied Soft Computing}, volume = {53}, pages = {217--226}, publisher = {Elsevier}, abstract = {Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood search strategy to address this problem. We additionally compare this parallel procedure with the sequential version of the algorithm and with the best previous approach. Computational results show the superiority of our proposal, backed up with statistical tests.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood search strategy to address this problem. We additionally compare this parallel procedure with the sequential version of the algorithm and with the best previous approach. Computational results show the superiority of our proposal, backed up with statistical tests. |
Sánchez-Oro, J; Martínez-Gavara, A; Laguna, M; Duarte, A; Martí, R Variable neighborhood descent for the incremental graph drawing Journal Article Electronic Notes in Discrete Mathematics, 58 , pp. 183–190, 2017, ISSN: 1571-0653. Abstract | Links | BibTeX | Tags: @article{Sanchez-Oro2017b, title = {Variable neighborhood descent for the incremental graph drawing}, author = {J Sánchez-Oro and A Martínez-Gavara and M Laguna and A Duarte and R Martí}, url = {https://www.sciencedirect.com/science/article/pii/S1571065317300604}, doi = {10.1016/J.ENDM.2017.03.024}, issn = {1571-0653}, year = {2017}, date = {2017-04-01}, journal = {Electronic Notes in Discrete Mathematics}, volume = {58}, pages = {183--190}, publisher = {North-Holland}, abstract = {Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation. |
Velasco, Jose Manuel; Garnica, Oscar; Contador, Sergio; Colmenar, Jose Manuel; Maqueda, Esther; Botella, Marta; Lanchares, Juan; Hidalgo, Ignacio J Enhancing Grammatical Evolution Through Data Augmentation: Application to Blood Glucose Forecasting Incollection pp. 142–157, Springer, Cham, 2017. @incollection{Velasco2017, title = {Enhancing Grammatical Evolution Through Data Augmentation: Application to Blood Glucose Forecasting}, author = {Jose Manuel Velasco and Oscar Garnica and Sergio Contador and Jose Manuel Colmenar and Esther Maqueda and Marta Botella and Juan Lanchares and Ignacio J Hidalgo}, url = {http://link.springer.com/10.1007/978-3-319-55849-3_10}, doi = {10.1007/978-3-319-55849-3_10}, year = {2017}, date = {2017-01-01}, pages = {142--157}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Hidalgo, Ignacio J; Cervigón, Carlos; Velasco, Manuel J; Colmenar, Manuel J; García-Sánchez, Carlos; Botella, Guillermo Embedded Grammars for Grammatical Evolution on GPGPU Incollection pp. 789–805, Springer, Cham, 2017. @incollection{Hidalgo2017b, title = {Embedded Grammars for Grammatical Evolution on GPGPU}, author = {Ignacio J Hidalgo and Carlos Cervigón and Manuel J Velasco and Manuel J Colmenar and Carlos García-Sánchez and Guillermo Botella}, url = {http://link.springer.com/10.1007/978-3-319-55849-3_51}, doi = {10.1007/978-3-319-55849-3_51}, year = {2017}, date = {2017-01-01}, pages = {789--805}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Gértrudix Barrio, Manuel. ; Esteban Sánchez, Natalia. ; del Gálvez de la Cuesta, María Carmen. La innovación educativa como agente de transformación digital en la Educación Superior. Book Dykinson, 2017, ISBN: 9788491484417. Abstract | Links | BibTeX | Tags: @book{GertrudixBarrio2017, title = {La innovación educativa como agente de transformación digital en la Educación Superior.}, author = {Manuel. {Gértrudix Barrio} and Natalia. {Esteban Sánchez} and María Carmen. del {Gálvez de la Cuesta}}, url = {https://books.google.es/books?hl=en&lr=&id=tehGDwAAQBAJ&oi=fnd&pg=PA169&dq=info:dm0W7t2_af8J:scholar.google.com&ots=YplzkJftjs&sig=W2si8M-lyYu9o7Se-8N2mHLrXT8&redir_esc=y#v=onepage&q&f=false}, isbn = {9788491484417}, year = {2017}, date = {2017-01-01}, pages = {283}, publisher = {Dykinson}, abstract = {LA INNOVACIÓN EDUCATIVA COMO AGENTE DE TRANSFORMACIÓN DIGITAL (...); PÁGINA LEGAL; ÍNDICE; INTRODUCCIÓN; SECCIÓN 1; ESTRATEGIAS DE INNOVACIÓN EDUCATIVA (...); IMPLANTANDO EL GRADO EN CIENCIA (...); FORMACIÓN EN ATENCIÓN A NECESIDADES EDUCATIVAS (...); FORMACIÓN DE POSTGRADO ONLINE: UNA ALTERNATIVA AL CONOCIMIENTO PRESENCIAL EN LA UNIVERSIDAD REY JUAN CARLOS; LA INNOVACIÓN EDUCATIVA COMO AGENTE DE TRANSFORMACIÓN DIGITAL (...); ENSEÑAR ES NARRAR: EL RELATO AUDIOVISUAL DIDÁCTICO; SECCIÓN 2; LAS TECNOLOGÍAS COMO PALANCA DE TRANSFORMACIÓN (...); LA BIOMETRÍA COMO RESPUESTA A LA NECESIDAD (...). EDUCACIÓN EN LA ERA COGNITIVASERVICIOS AUDIOVISUALES (...); SECCIÓN 3; APRENDIZAJE Y REDES SOCIALES: UNA PERSPECTIVA DE ALUMNO; REPOSITORIOS PÚBLICOS DE GITHUB EN DOCENCIA DE PROGRAMACIÓN; DOCENCIA 3.0: TWITTER EN EL AULA; ESTUDIO DE LAS COMPETENCIAS EMOCIONALES BÁSICAS (...); EVALUACIÓN DE LAS PRÁCTICAS DEL LABORATORIO (...); GRANDES DATOS, GPS, GLITCHES Y OTROS RECURSOS (...); SECCIÓN 4; CREATIVIDAD DEL PROFESOR Y MOTIVACIÓN DEL ALUMNO (...); INTERACCIÓN CON ALUMNOS EN GRADOS SEMIPRESENCIALES: UNA EXPERIENCIA DE LA URJC; HERRAMIENTAS DE COMUNICACIÓN EN EL CONTEXTO (...).}, keywords = {}, pubstate = {published}, tppubtype = {book} } LA INNOVACIÓN EDUCATIVA COMO AGENTE DE TRANSFORMACIÓN DIGITAL (...); PÁGINA LEGAL; ÍNDICE; INTRODUCCIÓN; SECCIÓN 1; ESTRATEGIAS DE INNOVACIÓN EDUCATIVA (...); IMPLANTANDO EL GRADO EN CIENCIA (...); FORMACIÓN EN ATENCIÓN A NECESIDADES EDUCATIVAS (...); FORMACIÓN DE POSTGRADO ONLINE: UNA ALTERNATIVA AL CONOCIMIENTO PRESENCIAL EN LA UNIVERSIDAD REY JUAN CARLOS; LA INNOVACIÓN EDUCATIVA COMO AGENTE DE TRANSFORMACIÓN DIGITAL (...); ENSEÑAR ES NARRAR: EL RELATO AUDIOVISUAL DIDÁCTICO; SECCIÓN 2; LAS TECNOLOGÍAS COMO PALANCA DE TRANSFORMACIÓN (...); LA BIOMETRÍA COMO RESPUESTA A LA NECESIDAD (...). EDUCACIÓN EN LA ERA COGNITIVASERVICIOS AUDIOVISUALES (...); SECCIÓN 3; APRENDIZAJE Y REDES SOCIALES: UNA PERSPECTIVA DE ALUMNO; REPOSITORIOS PÚBLICOS DE GITHUB EN DOCENCIA DE PROGRAMACIÓN; DOCENCIA 3.0: TWITTER EN EL AULA; ESTUDIO DE LAS COMPETENCIAS EMOCIONALES BÁSICAS (...); EVALUACIÓN DE LAS PRÁCTICAS DEL LABORATORIO (...); GRANDES DATOS, GPS, GLITCHES Y OTROS RECURSOS (...); SECCIÓN 4; CREATIVIDAD DEL PROFESOR Y MOTIVACIÓN DEL ALUMNO (...); INTERACCIÓN CON ALUMNOS EN GRADOS SEMIPRESENCIALES: UNA EXPERIENCIA DE LA URJC; HERRAMIENTAS DE COMUNICACIÓN EN EL CONTEXTO (...). |
Blum, Christian; Blesa, Maria J; Duarte, Abraham; Sánchez-Oro, Jesús An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem Miscellaneous 2017. @misc{Blum2017, title = {An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem}, author = {Christian Blum and Maria J Blesa and Abraham Duarte and Jesús Sánchez-Oro}, url = {https://www.semanticscholar.org/paper/An-Alternative-ILP-Model-and-Algorithmic-Ideas-for-Blum-Blesa/6059d1c7be5e5f199a95cb3cb92e52cf3e7b5e7c}, year = {2017}, date = {2017-01-01}, keywords = {}, pubstate = {published}, tppubtype = {misc} } |
2016 |
Sánchez-Oro, Jesús; Laguna, Manuel; Martí, Rafael; Duarte, Abraham Scatter search for the bandpass problem Journal Article Journal of Global Optimization, 66 (4), pp. 769–790, 2016, ISSN: 0925-5001. @article{Sanchez-Oro2016, title = {Scatter search for the bandpass problem}, author = {Jesús Sánchez-Oro and Manuel Laguna and Rafael Martí and Abraham Duarte}, url = {http://link.springer.com/10.1007/s10898-016-0446-0}, doi = {10.1007/s10898-016-0446-0}, issn = {0925-5001}, year = {2016}, date = {2016-12-01}, journal = {Journal of Global Optimization}, volume = {66}, number = {4}, pages = {769--790}, publisher = {Springer US}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Quintana, J D; Sánchez-Oro, J; Duarte, A Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem Journal Article International Journal of Computational Intelligence Systems, 9 (6), pp. 1016–1027, 2016, ISSN: 1875-6891. Abstract | Links | BibTeX | Tags: generalized regenerator location problem, GRASP, metaheuristic, regenerator, telecommunications @article{Quintana2016, title = {Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem}, author = {J D Quintana and J Sánchez-Oro and A Duarte}, url = {http://www.atlantis-press.com/php/paper-details.php?id=25868746}, doi = {10.1080/18756891.2016.1256568}, issn = {1875-6891}, year = {2016}, date = {2016-11-01}, journal = {International Journal of Computational Intelligence Systems}, volume = {9}, number = {6}, pages = {1016--1027}, publisher = {Taylor & Francis}, abstract = {AbstractOver the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical signals. Therefore, it is really important to have a reliable connection among terminals in the network. However, the transmission of the signal deteriorates when increasing the distance among devices. There exists a special piece of equipment that we can deploy in a network, called regenerator, which is able to restore the signal transmitted through it, in order to maintain its quality. Deploying a regenerator in a network is generally expensive, so it is important to minimize the number of regenerators used. In this paper we focus on the Generalized Regenerator Location Problem (GRLP), which tries to find the minimum number of regenerators that must be deployed in a network in order to have a reli...}, keywords = {generalized regenerator location problem, GRASP, metaheuristic, regenerator, telecommunications}, pubstate = {published}, tppubtype = {article} } AbstractOver the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical signals. Therefore, it is really important to have a reliable connection among terminals in the network. However, the transmission of the signal deteriorates when increasing the distance among devices. There exists a special piece of equipment that we can deploy in a network, called regenerator, which is able to restore the signal transmitted through it, in order to maintain its quality. Deploying a regenerator in a network is generally expensive, so it is important to minimize the number of regenerators used. In this paper we focus on the Generalized Regenerator Location Problem (GRLP), which tries to find the minimum number of regenerators that must be deployed in a network in order to have a reli... |
Sánchez-Oro, J; Duarte, A; Salcedo-Sanz, S Robust total energy demand estimation with a hybrid Variable Neighborhood Search – Extreme Learning Machine algorithm Journal Article Energy Conversion and Management, 123 , pp. 445–452, 2016, ISSN: 0196-8904. Abstract | Links | BibTeX | Tags: @article{Sanchez-Oro2016a, title = {Robust total energy demand estimation with a hybrid Variable Neighborhood Search – Extreme Learning Machine algorithm}, author = {J Sánchez-Oro and A Duarte and S Salcedo-Sanz}, url = {https://www.sciencedirect.com/science/article/pii/S0196890416305398}, doi = {10.1016/J.ENCONMAN.2016.06.050}, issn = {0196-8904}, year = {2016}, date = {2016-09-01}, journal = {Energy Conversion and Management}, volume = {123}, pages = {445--452}, publisher = {Pergamon}, abstract = {Energy demand prediction is an important problem whose solution is evaluated by policy makers in order to take key decisions affecting the economy of a country. A number of previous approaches to improve the quality of this estimation have been proposed in the last decade, the majority of them applying different machine learning techniques. In this paper, the performance of a robust hybrid approach, composed of a Variable Neighborhood Search algorithm and a new class of neural network called Extreme Learning Machine, is discussed. The Variable Neighborhood Search algorithm is focused on obtaining the most relevant features among the set of initial ones, by including an exponential prediction model. While previous approaches consider that the number of macroeconomic variables used for prediction is a parameter of the algorithm (i.e., it is fixed a priori), the proposed Variable Neighborhood Search method optimizes both: the number of variables and the best ones. After this first step of feature selection, an Extreme Learning Machine network is applied to obtain the final energy demand prediction. Experiments in a real case of energy demand estimation in Spain show the excellent performance of the proposed approach. In particular, the whole method obtains an estimation of the energy demand with an error lower than 2%, even when considering the crisis years, which are a real challenge.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Energy demand prediction is an important problem whose solution is evaluated by policy makers in order to take key decisions affecting the economy of a country. A number of previous approaches to improve the quality of this estimation have been proposed in the last decade, the majority of them applying different machine learning techniques. In this paper, the performance of a robust hybrid approach, composed of a Variable Neighborhood Search algorithm and a new class of neural network called Extreme Learning Machine, is discussed. The Variable Neighborhood Search algorithm is focused on obtaining the most relevant features among the set of initial ones, by including an exponential prediction model. While previous approaches consider that the number of macroeconomic variables used for prediction is a parameter of the algorithm (i.e., it is fixed a priori), the proposed Variable Neighborhood Search method optimizes both: the number of variables and the best ones. After this first step of feature selection, an Extreme Learning Machine network is applied to obtain the final energy demand prediction. Experiments in a real case of energy demand estimation in Spain show the excellent performance of the proposed approach. In particular, the whole method obtains an estimation of the energy demand with an error lower than 2%, even when considering the crisis years, which are a real challenge. |
Colmenar, Manuel J; Greistorfer, Peter; Martí, Rafael; Duarte, Abraham Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem Journal Article European Journal of Operational Research, 252 (2), pp. 432–442, 2016, ISSN: 0377-2217. Abstract | Links | BibTeX | Tags: @article{Colmenar2016b, title = {Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem}, author = {Manuel J Colmenar and Peter Greistorfer and Rafael Martí and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S0377221716000928}, doi = {10.1016/J.EJOR.2016.01.047}, issn = {0377-2217}, year = {2016}, date = {2016-07-01}, journal = {European Journal of Operational Research}, volume = {252}, number = {2}, pages = {432--442}, publisher = {North-Holland}, abstract = {The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avoids applying the local search method to low quality constructed solutions. Empirical results indicate that the proposed implementation compares favorably to previous methods. This fact is confirmed with non-parametric statistical tests.}, keywords = {}, pubstate = {published}, tppubtype = {article} } The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avoids applying the local search method to low quality constructed solutions. Empirical results indicate that the proposed implementation compares favorably to previous methods. This fact is confirmed with non-parametric statistical tests. |
Díaz álvarez, Josefa ; Colmenar, Manuel J; Risco-Martín, José L; Lanchares, Juan; Garnica, Oscar Optimizing L1 cache for embedded systems through grammatical evolution Journal Article Soft Computing, 20 (6), pp. 2451–2465, 2016, ISSN: 1432-7643. @article{DiazAlvarez2016a, title = {Optimizing L1 cache for embedded systems through grammatical evolution}, author = {Josefa {Díaz álvarez} and Manuel J Colmenar and José L Risco-Martín and Juan Lanchares and Oscar Garnica}, url = {http://link.springer.com/10.1007/s00500-015-1653-1}, doi = {10.1007/s00500-015-1653-1}, issn = {1432-7643}, year = {2016}, date = {2016-06-01}, journal = {Soft Computing}, volume = {20}, number = {6}, pages = {2451--2465}, publisher = {Springer Berlin Heidelberg}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Sánchez-Oro, Jesús; Menéndez, Borja; Pardo, Eduardo G; Duarte, Abraham Parallel strategic oscillation: an application to the maximum leaf spanning tree problem Journal Article Progress in Artificial Intelligence, 5 (2), pp. 121–128, 2016, ISSN: 2192-6352. @article{Sanchez-Oro2016c, title = {Parallel strategic oscillation: an application to the maximum leaf spanning tree problem}, author = {Jesús Sánchez-Oro and Borja Menéndez and Eduardo G Pardo and Abraham Duarte}, url = {http://link.springer.com/10.1007/s13748-015-0076-7}, doi = {10.1007/s13748-015-0076-7}, issn = {2192-6352}, year = {2016}, date = {2016-05-01}, journal = {Progress in Artificial Intelligence}, volume = {5}, number = {2}, pages = {121--128}, publisher = {Springer Berlin Heidelberg}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
Ignacio Hidalgo, J; Fernández, Ricardo; Manuel Colmenar, J; Cioffi, Florencia; Risco-Martín, José L; González-Doncel, Gaspar Using evolutionary algorithms to determine the residual stress profile across welds of age-hardenable aluminum alloys Journal Article Applied Soft Computing, 40 , pp. 429–438, 2016, ISSN: 1568-4946. Abstract | Links | BibTeX | Tags: @article{IgnacioHidalgo2016, title = {Using evolutionary algorithms to determine the residual stress profile across welds of age-hardenable aluminum alloys}, author = {J {Ignacio Hidalgo} and Ricardo Fernández and J {Manuel Colmenar} and Florencia Cioffi and José L Risco-Martín and Gaspar González-Doncel}, url = {https://www.sciencedirect.com/science/article/pii/S1568494615007152}, doi = {10.1016/J.ASOC.2015.11.004}, issn = {1568-4946}, year = {2016}, date = {2016-03-01}, journal = {Applied Soft Computing}, volume = {40}, pages = {429--438}, publisher = {Elsevier}, abstract = {This paper presents an evolutionary based method to obtain the un-stressed lattice spacing, d0, required to calculate the residual stress profile across a weld of an age-hardenable aluminum alloy, AA2024. Due to the age-hardening nature of this alloy, the d0 value depends on the heat treatment. In the case of welds, the heat treatment imposed by the welding operation differs significantly depending on the distance to the center of the joint. This implies that a variation of d0 across the weld is expected, a circumstances which limits the possibilities of conventional analytical methods to determine the required d0 profile. The interest of the paper is, therefore, two-fold: First, to demonstrate that the application of an evolutionary algorithm solves a problem not addressed in the literature such as the determination of the required data to calculate the residual stress state across a weld. Second, to show the robustness of the approximation used, which allows obtaining solutions for different constraints of the problem. Our results confirm the capacity of evolutionary computation to reach realistic solutions under three different scenarios of the initial conditions and the available experimental data.}, keywords = {}, pubstate = {published}, tppubtype = {article} } This paper presents an evolutionary based method to obtain the un-stressed lattice spacing, d0, required to calculate the residual stress profile across a weld of an age-hardenable aluminum alloy, AA2024. Due to the age-hardening nature of this alloy, the d0 value depends on the heat treatment. In the case of welds, the heat treatment imposed by the welding operation differs significantly depending on the distance to the center of the joint. This implies that a variation of d0 across the weld is expected, a circumstances which limits the possibilities of conventional analytical methods to determine the required d0 profile. The interest of the paper is, therefore, two-fold: First, to demonstrate that the application of an evolutionary algorithm solves a problem not addressed in the literature such as the determination of the required data to calculate the residual stress state across a weld. Second, to show the robustness of the approximation used, which allows obtaining solutions for different constraints of the problem. Our results confirm the capacity of evolutionary computation to reach realistic solutions under three different scenarios of the initial conditions and the available experimental data. |
Colmenar, Manuel J; Hidalgo, Ignacio J; Lanchares, Juan; Garnica, Oscar; Risco, Jose-L.; Contreras, Iván; Sánchez, Almudena; Velasco, Manuel J Compilable Phenotypes: Speeding-Up the Evaluation of Glucose Models in Grammatical Evolution Incollection pp. 118–133, Springer, Cham, 2016. @incollection{Colmenar2016b, title = {Compilable Phenotypes: Speeding-Up the Evaluation of Glucose Models in Grammatical Evolution}, author = {Manuel J Colmenar and Ignacio J Hidalgo and Juan Lanchares and Oscar Garnica and Jose-L. Risco and Iván Contreras and Almudena Sánchez and Manuel J Velasco}, url = {http://link.springer.com/10.1007/978-3-319-31153-1_9}, doi = {10.1007/978-3-319-31153-1_9}, year = {2016}, date = {2016-01-01}, pages = {118--133}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Díaz álvarez, Josefa ; Risco-Martín, José L; Colmenar, Manuel J Multi-objective optimization of energy consumption and execution time in a single level cache memory for embedded systems Journal Article Journal of Systems and Software, 111 , pp. 200–212, 2016, ISSN: 0164-1212. Abstract | Links | BibTeX | Tags: @article{DiazAlvarez2016, title = {Multi-objective optimization of energy consumption and execution time in a single level cache memory for embedded systems}, author = {Josefa {Díaz álvarez} and José L Risco-Martín and Manuel J Colmenar}, url = {https://www.sciencedirect.com/science/article/pii/S0164121215002241}, doi = {10.1016/J.JSS.2015.10.012}, issn = {0164-1212}, year = {2016}, date = {2016-01-01}, journal = {Journal of Systems and Software}, volume = {111}, pages = {200--212}, publisher = {Elsevier}, abstract = {Current embedded systems are specifically designed to run multimedia applications. These applications have a big impact on both performance and energy consumption. Both metrics can be optimized selecting the best cache configuration for a target set of applications. Multi-objective optimization may help to minimize both conflicting metrics in an independent manner. In this work, we propose an optimization method that based on Multi-Objective Evolutionary Algorithms, is able to find the best cache configuration for a given set of applications. To evaluate the goodness of candidate solutions, the execution of the optimization algorithm is combined with a static profiling methodology using several well-known simulation tools. Results show that our optimization framework is able to obtain an optimized cache for Mediabench applications. Compared to a baseline cache memory, our design method reaches an average improvement of 64.43 and 91.69% in execution time and energy consumption, respectively.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Current embedded systems are specifically designed to run multimedia applications. These applications have a big impact on both performance and energy consumption. Both metrics can be optimized selecting the best cache configuration for a target set of applications. Multi-objective optimization may help to minimize both conflicting metrics in an independent manner. In this work, we propose an optimization method that based on Multi-Objective Evolutionary Algorithms, is able to find the best cache configuration for a given set of applications. To evaluate the goodness of candidate solutions, the execution of the optimization algorithm is combined with a static profiling methodology using several well-known simulation tools. Results show that our optimization framework is able to obtain an optimized cache for Mediabench applications. Compared to a baseline cache memory, our design method reaches an average improvement of 64.43 and 91.69% in execution time and energy consumption, respectively. |
Colmenar, Manuel J; Winkler, Stephan M; Kronberger, Gabriel; Maqueda, Esther; Botella, Marta; Hidalgo, Ignacio J Predicting Glycemia in Diabetic Patients By Evolutionary Computation and Continuous Glucose Monitoring Inproceedings Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion - GECCO '16 Companion, pp. 1393–1400, ACM Press, New York, New York, USA, 2016, ISBN: 9781450343237. Links | BibTeX | Tags: diabetes, genetic programming, grammatical evolution, symbolic regression @inproceedings{Colmenar2016a, title = {Predicting Glycemia in Diabetic Patients By Evolutionary Computation and Continuous Glucose Monitoring}, author = {Manuel J Colmenar and Stephan M Winkler and Gabriel Kronberger and Esther Maqueda and Marta Botella and Ignacio J Hidalgo}, url = {http://dl.acm.org/citation.cfm?doid=2908961.2931734}, doi = {10.1145/2908961.2931734}, isbn = {9781450343237}, year = {2016}, date = {2016-01-01}, booktitle = {Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion - GECCO '16 Companion}, pages = {1393--1400}, publisher = {ACM Press}, address = {New York, New York, USA}, keywords = {diabetes, genetic programming, grammatical evolution, symbolic regression}, pubstate = {published}, tppubtype = {inproceedings} } |
Cortés, J -C; Colmenar, J -M; Hidalgo, J -I; Sánchez-Sánchez, A; Santonja, F -J; Villanueva, R -J Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model Journal Article Physica A: Statistical Mechanics and its Applications, 442 , pp. 36–49, 2016, ISSN: 0378-4371. Abstract | Links | BibTeX | Tags: @article{Cortes2016, title = {Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model}, author = {J -C Cortés and J -M Colmenar and J -I Hidalgo and A Sánchez-Sánchez and F -J Santonja and R -J Villanueva}, url = {https://www.sciencedirect.com/science/article/pii/S0378437115006962}, doi = {10.1016/J.PHYSA.2015.08.032}, issn = {0378-4371}, year = {2016}, date = {2016-01-01}, journal = {Physica A: Statistical Mechanics and its Applications}, volume = {442}, pages = {36--49}, publisher = {North-Holland}, abstract = {Academic performance is a concern of paramount importance in Spain, where around of 30% of the students in the last two courses in high school, before to access to the labor market or to the university, do not achieve the minimum knowledge required according to the Spanish educational law in force. In order to analyze this problem, we propose a random network model to study the dynamics of the academic performance in Spain. Our approach is based on the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. Moreover, in order to consider the uncertainty in the estimation of model parameters, we perform a lot of simulations taking as the model parameters the ones that best fit data returned by the Differential Evolution algorithm. This technique permits to forecast model trends in the next few years using confidence intervals.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Academic performance is a concern of paramount importance in Spain, where around of 30% of the students in the last two courses in high school, before to access to the labor market or to the university, do not achieve the minimum knowledge required according to the Spanish educational law in force. In order to analyze this problem, we propose a random network model to study the dynamics of the academic performance in Spain. Our approach is based on the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. Moreover, in order to consider the uncertainty in the estimation of model parameters, we perform a lot of simulations taking as the model parameters the ones that best fit data returned by the Differential Evolution algorithm. This technique permits to forecast model trends in the next few years using confidence intervals. |
Sánchez-Oro, Jesús; Duarte, Abraham; Salcedo-Sanz, Sancho Estimating the Spanish Energy Demand Using Variable Neighborhood Search Incollection pp. 341–350, Springer, Cham, 2016. @incollection{Sanchez-Oro2016b, title = {Estimating the Spanish Energy Demand Using Variable Neighborhood Search}, author = {Jesús Sánchez-Oro and Abraham Duarte and Sancho Salcedo-Sanz}, url = {http://link.springer.com/10.1007/978-3-319-44636-3_32}, doi = {10.1007/978-3-319-44636-3_32}, year = {2016}, date = {2016-01-01}, pages = {341--350}, publisher = {Springer, Cham}, keywords = {}, pubstate = {published}, tppubtype = {incollection} } |
Martínez-Gavara, Anna; Sánchez, Jesús; Calvo, Oro; Laguna, Manuel; Duarte, Abraham Búsqueda dispersa para la minimización del número de cortes en grafos jerárquicos incrementales Technical Report 2016. @techreport{Martinez-Gavara2016, title = {Búsqueda dispersa para la minimización del número de cortes en grafos jerárquicos incrementales}, author = {Anna Martínez-Gavara and Jesús Sánchez and Oro Calvo and Manuel Laguna and Abraham Duarte}, url = {https://www.researchgate.net/publication/310697124}, year = {2016}, date = {2016-01-01}, keywords = {}, pubstate = {published}, tppubtype = {techreport} } |
Duarte, Abraham; Pantrigo, Juan J; Pardo, Eduardo G; Sánchez-Oro, Jesús Parallel variable neighbourhood search strategies for the cutwidth minimization problem Journal Article IMA Journal of Management Mathematics, 27 (1), pp. 55–73, 2016, ISSN: 1471-678X. @article{Duarte2016, title = {Parallel variable neighbourhood search strategies for the cutwidth minimization problem}, author = {Abraham Duarte and Juan J Pantrigo and Eduardo G Pardo and Jesús Sánchez-Oro}, url = {https://academic.oup.com/imaman/article-lookup/doi/10.1093/imaman/dpt026}, doi = {10.1093/imaman/dpt026}, issn = {1471-678X}, year = {2016}, date = {2016-01-01}, journal = {IMA Journal of Management Mathematics}, volume = {27}, number = {1}, pages = {55--73}, publisher = {Narnia}, keywords = {}, pubstate = {published}, tppubtype = {article} } |
2015 |
Duarte, Abraham; Sánchez-Oro, Jesús; Resende, Mauricio G C; Glover, Fred; Martí, Rafael Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization Journal Article Information Sciences, 296 , pp. 46–60, 2015, ISSN: 0020-0255. Abstract | Links | BibTeX | Tags: @article{Duarte2015, title = {Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization}, author = {Abraham Duarte and Jesús Sánchez-Oro and Mauricio G C Resende and Fred Glover and Rafael Martí}, url = {https://www.sciencedirect.com/science/article/pii/S0020025514009906}, doi = {10.1016/J.INS.2014.10.010}, issn = {0020-0255}, year = {2015}, date = {2015-03-01}, journal = {Information Sciences}, volume = {296}, pages = {46--60}, publisher = {Elsevier}, abstract = {We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of elite set solutions and the best solution found is returned. Exterior path relinking, or path separation, a variant of the more common interior path relinking, is first applied in this paper. In interior path relinking, paths in the neighborhood solution space connecting good solutions are explored between these solutions in the search for improvements. Exterior path relinking, as opposed to exploring paths between pairs of solutions, explores paths beyond those solutions. This is accomplished by considering an initiating solution and a guiding solution and introducing in the initiating solution attributes not present in the guiding solution. To complete the process, the roles of initiating and guiding solutions are exchanged. Extensive computational experiments on 190 instances from the literature demonstrate the competitiveness of this algorithm.}, keywords = {}, pubstate = {published}, tppubtype = {article} } We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of elite set solutions and the best solution found is returned. Exterior path relinking, or path separation, a variant of the more common interior path relinking, is first applied in this paper. In interior path relinking, paths in the neighborhood solution space connecting good solutions are explored between these solutions in the search for improvements. Exterior path relinking, as opposed to exploring paths between pairs of solutions, explores paths beyond those solutions. This is accomplished by considering an initiating solution and a guiding solution and introducing in the initiating solution attributes not present in the guiding solution. To complete the process, the roles of initiating and guiding solutions are exchanged. Extensive computational experiments on 190 instances from the literature demonstrate the competitiveness of this algorithm. |
Duarte, Abraham; Sánchez-Oro, Jesús; Resende, Mauricio G C; Glover, Fred; Martí, Rafael Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization Journal Article Information Sciences, 296 , pp. 46–60, 2015, ISSN: 0020-0255. Abstract | Links | BibTeX | Tags: @article{Duarte2015a, title = {Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization}, author = {Abraham Duarte and Jesús Sánchez-Oro and Mauricio G C Resende and Fred Glover and Rafael Martí}, url = {https://www.sciencedirect.com/science/article/pii/S0020025514009906}, doi = {10.1016/J.INS.2014.10.010}, issn = {0020-0255}, year = {2015}, date = {2015-03-01}, journal = {Information Sciences}, volume = {296}, pages = {46--60}, publisher = {Elsevier}, abstract = {We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of elite set solutions and the best solution found is returned. Exterior path relinking, or path separation, a variant of the more common interior path relinking, is first applied in this paper. In interior path relinking, paths in the neighborhood solution space connecting good solutions are explored between these solutions in the search for improvements. Exterior path relinking, as opposed to exploring paths between pairs of solutions, explores paths beyond those solutions. This is accomplished by considering an initiating solution and a guiding solution and introducing in the initiating solution attributes not present in the guiding solution. To complete the process, the roles of initiating and guiding solutions are exchanged. Extensive computational experiments on 190 instances from the literature demonstrate the competitiveness of this algorithm.}, keywords = {}, pubstate = {published}, tppubtype = {article} } We propose several new hybrid heuristics for the differential dispersion problem, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all pairs of elite set solutions and the best solution found is returned. Exterior path relinking, or path separation, a variant of the more common interior path relinking, is first applied in this paper. In interior path relinking, paths in the neighborhood solution space connecting good solutions are explored between these solutions in the search for improvements. Exterior path relinking, as opposed to exploring paths between pairs of solutions, explores paths beyond those solutions. This is accomplished by considering an initiating solution and a guiding solution and introducing in the initiating solution attributes not present in the guiding solution. To complete the process, the roles of initiating and guiding solutions are exchanged. Extensive computational experiments on 190 instances from the literature demonstrate the competitiveness of this algorithm. |
Cuesta-Infante, Alfredo; Manuel Colmenar, J; Bankovic, Zorana; Risco-Martín, José L; Zapater, Marina; Ignacio Hidalgo, J; Ayala, José L; Moya, José M Comparative study of meta-heuristic 3D floorplanning algorithms Journal Article Neurocomputing, 150 , pp. 67–81, 2015, ISSN: 0925-2312. Abstract | Links | BibTeX | Tags: @article{Cuesta-Infante2015, title = {Comparative study of meta-heuristic 3D floorplanning algorithms}, author = {Alfredo Cuesta-Infante and J {Manuel Colmenar} and Zorana Bankovic and José L Risco-Martín and Marina Zapater and J {Ignacio Hidalgo} and José L Ayala and José M Moya}, url = {https://www.sciencedirect.com/science/article/pii/S0925231214012429}, doi = {10.1016/J.NEUCOM.2014.06.078}, issn = {0925-2312}, year = {2015}, date = {2015-02-01}, journal = {Neurocomputing}, volume = {150}, pages = {67--81}, publisher = {Elsevier}, abstract = {Constant necessity of improving performance has brought the invention of 3D chips. The improvement is achieved due to the reduction of wire length, which results in decreased interconnection delay. However, 3D stacks have less heat dissipation due to the inner layers, which leads to increased temperature and the appearance of hot spots. This problem can be mitigated through appropriate floorplanning. For this reason, in this work we present and compare five different solutions for floorplanning of 3D chips. Each solution uses a different representation, and all are based on meta-heuristic algorithms, namely three of them are based on simulated annealing, while two other are based on evolutionary algorithms. The results show great capability of all the solutions in optimizing temperature and wire length, as they all exhibit significant improvements comparing to the benchmark floorplans.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Constant necessity of improving performance has brought the invention of 3D chips. The improvement is achieved due to the reduction of wire length, which results in decreased interconnection delay. However, 3D stacks have less heat dissipation due to the inner layers, which leads to increased temperature and the appearance of hot spots. This problem can be mitigated through appropriate floorplanning. For this reason, in this work we present and compare five different solutions for floorplanning of 3D chips. Each solution uses a different representation, and all are based on meta-heuristic algorithms, namely three of them are based on simulated annealing, while two other are based on evolutionary algorithms. The results show great capability of all the solutions in optimizing temperature and wire length, as they all exhibit significant improvements comparing to the benchmark floorplans. |
Sánchez-Oro, Jesús; Sevaux, Marc; Rossi, André; Martí, Rafel; Duarte, Abraham Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies Journal Article Electronic Notes in Discrete Mathematics, 47 , pp. 85–92, 2015, ISSN: 1571-0653. Abstract | Links | BibTeX | Tags: @article{Sanchez-Oro2015, title = {Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies}, author = {Jesús Sánchez-Oro and Marc Sevaux and André Rossi and Rafel Martí and Abraham Duarte}, url = {https://www.sciencedirect.com/science/article/pii/S1571065314000547}, doi = {10.1016/J.ENDM.2014.11.012}, issn = {1571-0653}, year = {2015}, date = {2015-02-01}, journal = {Electronic Notes in Discrete Mathematics}, volume = {47}, pages = {85--92}, publisher = {North-Holland}, abstract = {Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.}, keywords = {}, pubstate = {published}, tppubtype = {article} } Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time. |
Publications
2019 |
How to Locate Disperse Obnoxious Facility Centers? Incollection pp. 52–63, Springer, Cham, 2019. |
Finding Balanced Bicliques in Bipartite Graphs Using Variable Neighborhood Search Incollection pp. 114–124, Springer, Cham, 2019. |
Detecting Weak Points in Networks Using Variable Neighborhood Search Incollection pp. 141–151, Springer, Cham, 2019. |
How to Locate Disperse Obnoxious Facility Centers? Incollection pp. 52–63, Springer, Cham, 2019. |
GRASP and VNS for solving the p-next center problem Journal Article Computers & Operations Research, 104 , pp. 295–303, 2019, ISSN: 0305-0548. |
A variable neighborhood search approach for the vertex bisection problem Journal Article Information Sciences, 476 , pp. 1–18, 2019, ISSN: 0020-0255. |
2018 |
Automatic generation of models for energy demand estimation using Grammatical Evolution Journal Article Energy, 164 , pp. 183–193, 2018, ISSN: 0360-5442. |
On the Analysis of the Influence of the Evaluation Metric in Community Detection over Social Networks Journal Article Electronics, 8 (1), pp. 23, 2018, ISSN: 2079-9292. |
Iterated Greedy algorithm for performing community detection in social networks Journal Article Future Generation Computer Systems, 88 , pp. 785–791, 2018, ISSN: 0167-739X. |
A Metaheuristic Approach for the $$ $backslash$alpha $$$alpha$-separator Problem Incollection pp. 336–343, Springer, Cham, 2018. |
Heuristics for the Bi-Objective Diversity Problem Journal Article Expert Systems with Applications, 108 , pp. 193–205, 2018, ISSN: 0957-4174. |
Multi-objective memetic optimization for the bi-objective obnoxious p-median problem Journal Article Knowledge-Based Systems, 144 , pp. 88–101, 2018, ISSN: 0950-7051. |
Scatter search for the bi-criteria p-median p-dispersion problem Journal Article Progress in Artificial Intelligence, 7 (1), pp. 31–40, 2018, ISSN: 2192-6352. |
Tabu search for the dynamic Bipartite Drawing Problem Journal Article Computers & Operations Research, 91 , pp. 1–12, 2018, ISSN: 0305-0548. |
Glucose Prognosis by Grammatical Evolution Incollection pp. 455–463, Springer, Cham, 2018. |
Evolutionary design of the memory subsystem Journal Article Applied Soft Computing, 62 , pp. 1088–1101, 2018, ISSN: 1568-4946. |
Identification of Models for Glucose Blood Values in Diabetics by Grammatical Evolution Incollection Handbook of Grammatical Evolution, pp. 367–393, Springer International Publishing, Cham, 2018. |
A parallel variable neighborhood search approach for the obnoxious textlessitextgreaterptextless/itextgreater -median problem Journal Article International Transactions in Operational Research, 2018, ISSN: 09696016. |
Variable Neighborhood Descent Incollection Handbook of Heuristics, pp. 341–367, Springer International Publishing, Cham, 2018. |
GRASP with Path Relinking for 2D-Bandwidth Minimization Problem Inproceedings Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications - LOPAL '18, pp. 1–5, ACM Press, New York, New York, USA, 2018, ISBN: 9781450353045. |
2017 |
A general variable neighborhood search for solving the multi-objective open vehicle routing problem Journal Article Journal of Heuristics, pp. 1–30, 2017, ISSN: 1381-1231. |
Variable neighborhood scatter search for the incremental graph drawing problem Journal Article Computational Optimization and Applications, 68 (3), pp. 775–797, 2017, ISSN: 0926-6003. |
A general variable neighborhood search for solving the multi-objective open vehicle routing problem Journal Article Journal of Heuristics, pp. 1–30, 2017, ISSN: 1381-1231. |
Data Based Prediction of Blood Glucose Concentrations Using Evolutionary Methods Journal Article Journal of Medical Systems, 41 (9), pp. 142, 2017, ISSN: 0148-5598. |
General Variable Neighborhood Search for computing graph separators Journal Article Optimization Letters, 11 (6), pp. 1069–1089, 2017, ISSN: 1862-4472. |
Parallel variable neighborhood search for the min-max order batching problem Journal Article International Transactions in Operational Research, 24 (3), pp. 635–662, 2017, ISSN: 09696016. |
Improving the performance of embedded systems with variable neighborhood search Journal Article Applied Soft Computing, 53 , pp. 217–226, 2017, ISSN: 1568-4946. |
Variable neighborhood descent for the incremental graph drawing Journal Article Electronic Notes in Discrete Mathematics, 58 , pp. 183–190, 2017, ISSN: 1571-0653. |
Enhancing Grammatical Evolution Through Data Augmentation: Application to Blood Glucose Forecasting Incollection pp. 142–157, Springer, Cham, 2017. |
Embedded Grammars for Grammatical Evolution on GPGPU Incollection pp. 789–805, Springer, Cham, 2017. |
La innovación educativa como agente de transformación digital en la Educación Superior. Book Dykinson, 2017, ISBN: 9788491484417. |
An Alternative ILP Model and Algorithmic Ideas for the Maximum Edge-Disjoint Paths Problem Miscellaneous 2017. |
2016 |
Scatter search for the bandpass problem Journal Article Journal of Global Optimization, 66 (4), pp. 769–790, 2016, ISSN: 0925-5001. |
Efficient Greedy Randomized Adaptive Search Procedure for the Generalized Regenerator Location Problem Journal Article International Journal of Computational Intelligence Systems, 9 (6), pp. 1016–1027, 2016, ISSN: 1875-6891. |
Robust total energy demand estimation with a hybrid Variable Neighborhood Search – Extreme Learning Machine algorithm Journal Article Energy Conversion and Management, 123 , pp. 445–452, 2016, ISSN: 0196-8904. |
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem Journal Article European Journal of Operational Research, 252 (2), pp. 432–442, 2016, ISSN: 0377-2217. |
Optimizing L1 cache for embedded systems through grammatical evolution Journal Article Soft Computing, 20 (6), pp. 2451–2465, 2016, ISSN: 1432-7643. |
Parallel strategic oscillation: an application to the maximum leaf spanning tree problem Journal Article Progress in Artificial Intelligence, 5 (2), pp. 121–128, 2016, ISSN: 2192-6352. |
Using evolutionary algorithms to determine the residual stress profile across welds of age-hardenable aluminum alloys Journal Article Applied Soft Computing, 40 , pp. 429–438, 2016, ISSN: 1568-4946. |
Compilable Phenotypes: Speeding-Up the Evaluation of Glucose Models in Grammatical Evolution Incollection pp. 118–133, Springer, Cham, 2016. |
Multi-objective optimization of energy consumption and execution time in a single level cache memory for embedded systems Journal Article Journal of Systems and Software, 111 , pp. 200–212, 2016, ISSN: 0164-1212. |
Predicting Glycemia in Diabetic Patients By Evolutionary Computation and Continuous Glucose Monitoring Inproceedings Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion - GECCO '16 Companion, pp. 1393–1400, ACM Press, New York, New York, USA, 2016, ISBN: 9781450343237. |
Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model Journal Article Physica A: Statistical Mechanics and its Applications, 442 , pp. 36–49, 2016, ISSN: 0378-4371. |
Estimating the Spanish Energy Demand Using Variable Neighborhood Search Incollection pp. 341–350, Springer, Cham, 2016. |
Búsqueda dispersa para la minimización del número de cortes en grafos jerárquicos incrementales Technical Report 2016. |
Parallel variable neighbourhood search strategies for the cutwidth minimization problem Journal Article IMA Journal of Management Mathematics, 27 (1), pp. 55–73, 2016, ISSN: 1471-678X. |
2015 |
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization Journal Article Information Sciences, 296 , pp. 46–60, 2015, ISSN: 0020-0255. |
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization Journal Article Information Sciences, 296 , pp. 46–60, 2015, ISSN: 0020-0255. |
Comparative study of meta-heuristic 3D floorplanning algorithms Journal Article Neurocomputing, 150 , pp. 67–81, 2015, ISSN: 0925-2312. |
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies Journal Article Electronic Notes in Discrete Mathematics, 47 , pp. 85–92, 2015, ISSN: 1571-0653. |