Juan A. Diaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Juan A. Diaz has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Dolores Edwiges Luna Reyes
Universidad de las Américas Puebla, Cholula, Mexico
9 shared publications - Elena Fernández
Departamento de Estadística e Investigación Operativa Universidad de Cádiz Spain
8 shared publications Alejandro Santoyo
3 shared publicationsMauricio Osorio
3 shared publications- Roger Z. Ríos-Mercado
Universidad Autónoma de Nuevo León (UANL)
3 shared publications - Ivan Contreras
Dpt. d’Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Barcelona, Spain
2 shared publications
Latest Publications
- 1 May 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 146
An improved exact algorithm for a territory design problem with p-center-based dispersion minimization
- 1 May 2020
- Published by Elsevier in Expert Systems with Applications
- Vol. 146
An improved exact algorithm for a territory design problem with p-center-based dispersion minimization
- 20 April 2020
- Published by Springer Nature in TOP
- Vol. 28 (3) , 705-727
Integrated cross-dock door assignment and truck scheduling with handling times
- 20 April 2020
- Published by Springer Nature in TOP
- Vol. 28 (3) , 705-727
Integrated cross-dock door assignment and truck scheduling with handling times
- 5 February 2020
- Published by Springer Nature
- p. 77-103
Bounding Procedures and Exact Solutions for a Class of Territory Design Problems
- 5 February 2020
- Published by Springer Nature
- p. 77-103
Bounding Procedures and Exact Solutions for a Class of Territory Design Problems
- 5 January 2018
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 69 (9) , 1493-1511
GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence
In this study, a hybrid heuristic is proposed for the Manufacturing Cell Formation Problem considering part processing sequence. The hybrid heuristic is based on a GRASP heuristic and then it uses a path relinking strategy on a set of elite solutions obtained by GRASP. The proposed GRASP heuristic constructs feasible solutions using a two-stage randomised greedy procedure, that are improved with a local search procedure. This procedure explores two neighbourhoods: machine reassignments and machine interchanges. The path relinking is used as an intensification strategy to improve the GRASP solutions. The performance of the proposed heuristic is evaluated with data-sets from the literature and a set of larger size instances randomly generated. The obtained results show that the GRASP heuristic provides optimal or near optimal solutions with very small computational burden. These results are further improved with a Path Relinking strategy. The most remarkable features of the proposed heuristic are its simplicity and its ease of implementation.
- 5 January 2018
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 69 (9) , 1493-1511
GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence
In this study, a hybrid heuristic is proposed for the Manufacturing Cell Formation Problem considering part processing sequence. The hybrid heuristic is based on a GRASP heuristic and then it uses a path relinking strategy on a set of elite solutions obtained by GRASP. The proposed GRASP heuristic constructs feasible solutions using a two-stage randomised greedy procedure, that are improved with a local search procedure. This procedure explores two neighbourhoods: machine reassignments and machine interchanges. The path relinking is used as an intensification strategy to improve the GRASP solutions. The performance of the proposed heuristic is evaluated with data-sets from the literature and a set of larger size instances randomly generated. The obtained results show that the GRASP heuristic provides optimal or near optimal solutions with very small computational burden. These results are further improved with a Path Relinking strategy. The most remarkable features of the proposed heuristic are its simplicity and its ease of implementation.
- 20 October 2017
- Published by Springer Nature in Operational Research
- Vol. 20 (2) , 827-855
A bi-level maximal covering location problem
- 20 October 2017
- Published by Springer Nature in Operational Research
- Vol. 20 (2) , 827-855
A bi-level maximal covering location problem
- 1 October 2017
- Published by Elsevier in Expert Systems with Applications
- Vol. 82, 67-76
GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering
- 1 October 2017
- Published by Elsevier in Expert Systems with Applications
- Vol. 82, 67-76
GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering
- 29 September 2017
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 21 (3)
0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks
Dung's abstract argumentation has been object of intense study not just for its relationship with logical reasoning but also for its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We present a novel method, to the best of our knowledge, for computing semi-stable semantics using 0-1 integer programming. This approach captures the notions of conflict freeness, acceptability, maximality with regard to set inclusion, etc., by 0-1 integer constraints. Additionally, this work also presents an empirical experiment to compare this novel approach with an answer set programming approach. Our results indicate that this new method performed well, and it has a great opportunity space for improving.
- 29 September 2017
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 21 (3)
0-1 Integer Programming for Computing Semi-Stable Semantics of Argumentation Frameworks
Dung's abstract argumentation has been object of intense study not just for its relationship with logical reasoning but also for its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We present a novel method, to the best of our knowledge, for computing semi-stable semantics using 0-1 integer programming. This approach captures the notions of conflict freeness, acceptability, maximality with regard to set inclusion, etc., by 0-1 integer constraints. Additionally, this work also presents an empirical experiment to compare this novel approach with an answer set programming approach. Our results indicate that this new method performed well, and it has a great opportunity space for improving.
- 27 June 2016
- Published by Springer Nature in Annals of Operations Research
- Vol. 258 (2) , 613-638
Primal and dual bounds for the vertex p-median problem with balance constraints
- 27 June 2016
- Published by Springer Nature in Annals of Operations Research
- Vol. 258 (2) , 613-638
Primal and dual bounds for the vertex p-median problem with balance constraints