## 2018 |

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 |

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} } |

## 2016 |

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 ﬁnd 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 ﬁnd the minimum number of regenerators that must be deployed in a network in order to have a reli... |

## 2014 |

Campos, Vicente; Martí, Rafael; Sánchez-Oro, Jesús; Duarte, Abraham GRASP with path relinking for the orienteering problem Journal Article Journal of the Operational Research Society, 65 (12), pp. 1800–1813, 2014, ISSN: 0160-5682. Abstract | Links | BibTeX | Tags: GRASP, Metaheuristics, orienteering problem, Path Relinking @article{Campos2014, title = {GRASP with path relinking for the orienteering problem}, author = {Vicente Campos and Rafael Martí and Jesús Sánchez-Oro and Abraham Duarte}, url = {https://www.tandfonline.com/doi/full/10.1057/jors.2013.156}, doi = {10.1057/jors.2013.156}, issn = {0160-5682}, year = {2014}, date = {2014-12-01}, journal = {Journal of the Operational Research Society}, volume = {65}, number = {12}, pages = {1800--1813}, publisher = {Taylor & Francis}, abstract = {AbstractIn this paper, we address an optimization problem resulting from the combination of the well-known travelling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sport, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travelling salesman problem, is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in routing and tourism. We propose a heuristic method—based on the Greedy Randomized Adaptive Search Procedure (GRASP) and the Path Relinking methodologies—for finding approximate solutions to this optimization problem. We explore different constructive methods and combine two neighbourhoods in the local search of GRASP. Our experimentation with 196 previously reported instances shows that the propos...}, keywords = {GRASP, Metaheuristics, orienteering problem, Path Relinking}, pubstate = {published}, tppubtype = {article} } AbstractIn this paper, we address an optimization problem resulting from the combination of the well-known travelling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sport, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travelling salesman problem, is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in routing and tourism. We propose a heuristic method—based on the Greedy Randomized Adaptive Search Procedure (GRASP) and the Path Relinking methodologies—for finding approximate solutions to this optimization problem. We explore different constructive methods and combine two neighbourhoods in the local search of GRASP. Our experimentation with 196 previously reported instances shows that the propos... |

# Publications

## 2018 |

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. |

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. |

## 2016 |

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. |

## 2014 |

GRASP with path relinking for the orienteering problem Journal Article Journal of the Operational Research Society, 65 (12), pp. 1800–1813, 2014, ISSN: 0160-5682. |