English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

espanolEste articulo tiene como objetivo formular y solucionar un problema de ruteo para la recogida de medicamentos sobrantes y suministros en el minimo tiempo posible. Para resolver el problema, dos metaheuristicos denominados recocido simulado (RS) y enjambre de particulas (PSO) son aplicados. Adicionalmente, factores como tamano de lista de recoleccion (TLR), tamano de flota de carros de recoleccion (TFCR), asi como cantidades de habitaciones en el hospital son modelados. De la validacion experimental se detecto que los niveles del metaheuristico PSO con el nivel TLR de 250 productos, genera menores tiempos de recogida con valores de 58,30 y 57,30 minutos / conjunto de rutas; en tanto, una combinacion de los niveles TLR de 400 productos, con el metaheuristico RS, produce el menor tiempo promedio de ruteo con valores de 99,33 y 101,24 minutos /conjunto de rutas. Estos resultados mostraron la efectividad de los metaheuristicos para solucionar el problema ruteo en logistica hospitalaria. EnglishThis article aims to formulate and solve a routing problem for the collection of surplus leftover medicines and supplies in the minimum possible time. To solve the problem, two metaheuristics called simulated annealing (RS) and particle swarm optimization (PSO) are applied. Additionally, factors such as collection list size (TLR), size of collection car fleet (TFCR), as well as hospital room quantities are modeled. From the experimental validation it was detected that the levels of the PSO metaheuristic with the TLR level of 250 products, generates shorter collection times with values of 58.30 and 57.30 minutes / set of routes. Meanwhile, a combination of the TLR levels of 400 products, with the RS metaheuristic, produces the lowest average routing time with values of 99.33 and 101.24 minutes / set of routes. These results showed the effectiveness of metaheuristics to solve the problem of routing in hospital logistics.

Metaheurísticos para Solución del Problema de Ruteo en la Recuperación de Medicamentos Sobrantes y Suministros en Hospitales