ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation.

Simple item page
dc.contributor.authorOliveira, Fabricio Alves
dc.contributor.authorSá, Elisangela Martins de
dc.contributor.authorSouza, Sergio Ricardo de
dc.contributor.authorSouza, Marcone Jamilson Freitas
dc.date.accessioned2023-07-26T19:42:30Z
dc.date.available2023-07-26T19:42:30Z
dc.date.issued2023pt_BR
dc.description.abstractThis study addresses a hub network design problem to maximize net profit. This problem considers an incomplete hub network with multiple allocation that does not impose capacity constraints, does not allow direct connections between non-hub nodes, and accepts the demand to be partially met, being satisfied only when profitable. To tackle this problem, which is NP-hard, we propose two heuristic algorithms based on the Iterated Local Search (ILS) metaheuristic, a standard ILS algorithm, and an Enhanced ILS algorithm, which increases the perturbation level only after a few unsuccessful attempts at improvement. Both algorithms use Random Variable Neighborhood Descent in the local search. Computational experiments were performed using benchmark instances for hub location problems, and statistical analyzes of the algorithms were presented. Numerical results confirm that both algorithms yield good-quality solutions with an acceptable runtime. In particular, the proposed algorithms obtain the optimal solution for most instances with up to 150 nodes, which have known optimal solutions. Furthermore, the proposed algorithms were able to handle instances with up to 500 nodes.pt_BR
dc.identifier.citationOLIVEIRA, F. A. et al. ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation. Computers & Operations Research, v. 157, artigo 106252, 2023. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0305054823001168>. Acesso em: 06 jul. 2023.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.cor.2023.106252pt_BR
dc.identifier.issn0305-0548
dc.identifier.urihttp://www.repositorio.ufop.br/jspui/handle/123456789/17070
dc.identifier.uri2https://www.sciencedirect.com/science/article/pii/S0305054823001168pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectIterated local searchpt_BR
dc.subjectVariable neighborhood descentpt_BR
dc.subjectMetaheuristicspt_BR
dc.titleILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_ILSBasedAlgorithsm.pdf
Size:
1009.74 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DECOM - Artigos publicados em periódicos