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

This work addresses a variant of the p-hubCenter (pHCP) problem, named the Unassigned Multi-Allocation Center p-Hub Problem (UMApHCP). The problem is to define p hubsin a complete graph so that the maximum transport cost of the graph is minimized. A Hybrid Genetic Algorit hm (GA) is used to solve the problem addressed, with the initial population generated by the GRASP metaheuristic construction phase. In addition to eac h hub configuration generated by the GA, a polynomial-time algorithm is app lied to determine the optimal allocation of the nodes of the graph. Two sets of i nstances with up to 300 nodes and40 hubsavailable in the literature were used to evaluate the GA. Computational tests are performed to prove the efficienc y of the proposal.

Algoritmo Genético Aplicado à Solução do Problema p-hub Centro Não Capacitado de Múltiplas Alocações