hrcak mascot   Srce   HID

Prethodno priopćenje
https://doi.org/10.17559/TV-20180501230511

A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem

Broderick Crawford   ORCID icon orcid.org/0000-0001-5500-0188 ; Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile
Ricardo Soto ; Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile
Wenceslao Palma ; Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile
Felipe Aballay ; Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile
Gino Astorga*   ORCID icon orcid.org/0000-0001-5500-0188 ; Universidad de Valparaíso, Prat 856, Valparaíso, Chile
José Lemus-Romani ; Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso, Chile
Sanjay Misra ; 1) Department of Computer and Information Science, Covenant University, Nigeria, KM 10 Idiroko Rd, Ota, Nigeria; 2) Atilim University, 06836 Incek/Ankara Turkey
Carlos Castro ; Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso, Chile
Fernando Paredes ; Escuela de Ingeniería Industrial, Universidad Diego Portales, Manuel Rodríguez Sur 415, Santiago, Chile
José-Miguel Rubio ; Universidad Bernardo O'Higgins, Av. Viel 1497, Santiago, Chile

Puni tekst: engleski, pdf (774 KB) str. 1678-1684 preuzimanja: 0* citiraj
APA 6th Edition
Crawford, B., Soto, R., Palma, W., Aballay, F., Astorga*, G., Lemus-Romani, J., ... Rubio, J. (2020). A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem. Tehnički vjesnik, 27 (5), 1678-1684. https://doi.org/10.17559/TV-20180501230511
MLA 8th Edition
Crawford, Broderick, et al. "A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem." Tehnički vjesnik, vol. 27, br. 5, 2020, str. 1678-1684. https://doi.org/10.17559/TV-20180501230511. Citirano 27.10.2020.
Chicago 17th Edition
Crawford, Broderick, Ricardo Soto, Wenceslao Palma, Felipe Aballay, Gino Astorga*, José Lemus-Romani, Sanjay Misra, Carlos Castro, Fernando Paredes i José-Miguel Rubio. "A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem." Tehnički vjesnik 27, br. 5 (2020): 1678-1684. https://doi.org/10.17559/TV-20180501230511
Harvard
Crawford, B., et al. (2020). 'A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem', Tehnički vjesnik, 27(5), str. 1678-1684. https://doi.org/10.17559/TV-20180501230511
Vancouver
Crawford B, Soto R, Palma W, Aballay F, Astorga* G, Lemus-Romani J i sur. A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem. Tehnički vjesnik [Internet]. 2020 [pristupljeno 27.10.2020.];27(5):1678-1684. https://doi.org/10.17559/TV-20180501230511
IEEE
B. Crawford, et al., "A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem", Tehnički vjesnik, vol.27, br. 5, str. 1678-1684, 2020. [Online]. https://doi.org/10.17559/TV-20180501230511

Sažetak
The need to make good use of resources has allowed metaheuristics to become a tool to achieve this goal. There are a number of complex problems to solve, among which is the Set-Covering Problem, which is a representation of a type of combinatorial optimization problem, which has been applied to several real industrial problems. We use a binary version of the optimization algorithm based on teaching and learning to solve the problem, incorporating various binarization schemes, in order to solve the binary problem. In this paper, several binarization techniques are implemented in the teaching/learning based optimization algorithm, which presents only the minimum parameters to be configured such as the population and number of iterations to be evaluated. The performance of metaheuristic was evaluated through 65 benchmark instances. The results obtained are promising compared to those found in the literature.

Ključne riječi
combinatorial optimization; metaheuristics; set-covering problem (SCP); teaching-learning-based optimization algorithm (TLBO)

Hrčak ID: 244863

URI
https://hrcak.srce.hr/244863

Posjeta: 0 *