David Ríos
David Ríos has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Andrés Collazos Morales
Universidad Manuela Beltrán
1 shared publication - Joaquin Perez
Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET), Departamento de Ciencias Computacionales
1 shared publication - Laura Cruz-Reyes
Tecnológico Nacional de México/Instituto Tecnológico de Ciudad Madero
1 shared publication - Vanesa Landero-Nájera
Computer Systems, Universidad Politécnica de Apodaca, Apodaca 66600, Mexico
1 shared publication
Latest Publications
- 1 October 2020
- Published by Springer Nature
- Vol. 12249, 149-164
Characterizing and Analyzing the Relation Between Bin-Packing Problem and Tabu Search Algorithm
The relation between problem and solution algorithm presents a similar phenomenon in different research problems (optimization, decision, classification, ordering); the algorithm performance is very good in some cases of the problem, and very bad in other. Majority of related works have worked for predicting the most adequate algorithm to solve a new problem instance. However, the relation between problem and algorithm is not understood at all. In this paper a formal characterization of this relation is proposed to facilitate the analysis and understanding of the phenomenon. Case studies for Tabu Search algorithm and One Dimension Bin Packing problem were performed, considering three important sections of algorithm logical structure. Significant variables of problem structure and algorithm searching behavior from past experiments, metrics known by scientific community were considered (Autocorrelation Coefficient and Length) and significant variables of algorithm operative behavior were proposed. The models discovered in the case studies gave guidelines that permits to redesign algorithm logical structure, which outperforms to the original algorithm in an average of 69%. The proposed characterization for the relation problem-algorithm could be a formal procedure for obtaining guidelines that improves the algorithm performance.
- 1 October 2020
- Published by Springer Nature
- Vol. 12249, 149-164
Characterizing and Analyzing the Relation Between Bin-Packing Problem and Tabu Search Algorithm
The relation between problem and solution algorithm presents a similar phenomenon in different research problems (optimization, decision, classification, ordering); the algorithm performance is very good in some cases of the problem, and very bad in other. Majority of related works have worked for predicting the most adequate algorithm to solve a new problem instance. However, the relation between problem and algorithm is not understood at all. In this paper a formal characterization of this relation is proposed to facilitate the analysis and understanding of the phenomenon. Case studies for Tabu Search algorithm and One Dimension Bin Packing problem were performed, considering three important sections of algorithm logical structure. Significant variables of problem structure and algorithm searching behavior from past experiments, metrics known by scientific community were considered (Autocorrelation Coefficient and Length) and significant variables of algorithm operative behavior were proposed. The models discovered in the case studies gave guidelines that permits to redesign algorithm logical structure, which outperforms to the original algorithm in an average of 69%. The proposed characterization for the relation problem-algorithm could be a formal procedure for obtaining guidelines that improves the algorithm performance.