Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Filtrar
Mais filtros











Base de dados
Intervalo de ano de publicação
1.
PeerJ Comput Sci ; 9: e1728, 2023.
Artigo em Inglês | MEDLINE | ID: mdl-38192486

RESUMO

The one-dimensional cutting-stock problem (1D-CSP) consists of obtaining a set of items of different lengths from stocks of one or different lengths, where the minimization of waste is one of the main objectives to be achieved. This problem arises in several industries like wood, glass, and paper, among others similar. Different approaches have been designed to deal with this problem ranging from exact algorithms to hybrid methods of heuristics or metaheuristics. The African Buffalo Optimization (ABO) algorithm is used in this work to address the 1D-CSP. This algorithm has been recently introduced to solve combinatorial problems such as travel salesman and bin packing problems. A procedure was designed to improve the search by taking advantage of the location of the buffaloes just before it is needed to restart the herd, with the aim of not to losing the advance reached in the search. Different instances from the literature were used to test the algorithm. The results show that the developed method is competitive in waste minimization against other heuristics, metaheuristics, and hybrid approaches.

2.
Sensors (Basel) ; 21(21)2021 Oct 29.
Artigo em Inglês | MEDLINE | ID: mdl-34770515

RESUMO

This work is focused on the performance analysis and optimal routing of wireless technology for intelligent energy metering, considering the inclusion of micro grids. For the study, a geo-referenced scenario has been taken into account, which will form the structure of a graph to be solved using heuristic-based algorithms. In the first instance, the candidate site of the world geography to perform the case study is established, followed by deploying infrastructure devices and determining variables and parameters. Then, the model configuration is programmed, taking into account that a set of nodes and vertices is established for proper routing, resulting in a preliminary wireless network topology. Finally, from a set of restrictions, a determination of users connected to the concentrator and optimal routing is performed. This procedure is treated as a coverage set problem. Consequently, to establish the network parameters, two restrictions are specifically considered, capacity and range; thus, can be determined the best technology to adapt to the location. Finally, a verification of the resulting network topologies and the performance of the infrastructure is done by simulating the wireless network. With the model created, scenarios are tested, and it is verified that the optimization model demonstrates its effectiveness.


Assuntos
Redes de Comunicação de Computadores , Tecnologia sem Fio , Algoritmos , Eletricidade
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA