## 2018 |

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

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

## 0000 |

López-Sánchez, A D; Sánchez-Oro, J; Hernández-Díaz, A G; Laguna, M Where facility centers should be located? Technical Report 0000. Abstract | Links | BibTeX | Tags: Facility location problems, Index Terms-Scatter Search, Multi-objective optimization problems, Path Relinking @techreport{Lopez-Sanchezb, title = {Where facility centers should be located?}, author = {A D López-Sánchez and J Sánchez-Oro and A G Hernández-Díaz and M Laguna}, url = {https://sci2s.ugr.es/caepia18/proceedings/docs/CAEPIA2018_paper_193.pdf}, abstract = {Facility location problems aim to determine the best position to place facility centers. This task is not easy since many objectives may be taken into consideration to choose the best possibility and the locations can be substantially different. This paper presents a Scatter Search algorithm with Path Relinking to decide where facility centers should be located depending on the objective functions under consideration. The objectives considered in this study are to minimize the distance between demand points and their nearest facilities, to maximize the number of demand points covered by a facility center and to minimize the maximum distance between demand points and their nearest facilities. Then, this problem is addressed as a three-objective optimization problem and the algorithm proposed is compared against other competitors obtaining promising results according to three different performance metrics.}, keywords = {Facility location problems, Index Terms-Scatter Search, Multi-objective optimization problems, Path Relinking}, pubstate = {published}, tppubtype = {techreport} } Facility location problems aim to determine the best position to place facility centers. This task is not easy since many objectives may be taken into consideration to choose the best possibility and the locations can be substantially different. This paper presents a Scatter Search algorithm with Path Relinking to decide where facility centers should be located depending on the objective functions under consideration. The objectives considered in this study are to minimize the distance between demand points and their nearest facilities, to maximize the number of demand points covered by a facility center and to minimize the maximum distance between demand points and their nearest facilities. Then, this problem is addressed as a three-objective optimization problem and the algorithm proposed is compared against other competitors obtaining promising results according to three different performance metrics. |

# Publications

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

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

## 0000 |

Where facility centers should be located? Technical Report 0000. |