Please use this identifier to cite or link to this item:
Title: A PSO-inspired architecture to hybridise multi-objective metaheuristics
Authors: Fernandes, Islame Felipe da Costa
Silva, Igor Rosberg de Medeiros
Goldbarg, Elizabeth Ferreira Gouvea
Maia, Silvia Maria Diniz Monteiro
Goldbarg, Marco César
Keywords: Multi-objective optimisation;Hybridisation of metaheuristics;Bi-objective spanning tree
Issue Date: 22-Jun-2020
Publisher: Springer
Citation: FERNANDES, I. F. C.; SILVA, I. R. M.; GOLDBARG, E. F. G.; MAIA, S. M. D. M.; GOLDBARG, M. C.. A PSO-inspired architecture to hybridise multi-objective metaheuristics. Memetic Computing, [S.L.], v. 12, n. 3, p. 235-249, 22 jun. 2020. Disponível em: Acesso em: 07 out. 2020.
Portuguese Abstract: Hybridisation is a technique that exploits and unites the best features of individual algorithms. The literature includes several hybridisation methodologies, among which there are general procedures, termed architectures, that provide generic functionalities and features for solving optimisation problems. Successful hybridisation methodologies have applied concepts of the multi-agent paradigm, such as cooperation and agent intelligence. However, there is still a lack concerning architectures for the hybridisation of multi-objective metaheuristics that fully explore these concepts. This study proposes a new architecture, named MO-MAHM, based on concepts from Particle Swarm Optimisation, to hybridise multi-objective metaheuristics. We apply the MO-MAHM to the Bi-objective Spanning Tree Problem. Four algorithms were hybridised within the MO-MAHM: three evolutionary algorithms and a local search method. We report the results of experiments with 180 instances, analyse the behaviour of the MO-MAHM, and compare to the results produced by algorithms proposed for the Bi-objective Spanning Tree Problem
ISSN: 1865-9292
Appears in Collections:CCET - DIMAP - Artigos publicados em periódicos
ECT - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
Restricted Access Until 2025-08-02
1,14 MBAdobe PDFThumbnail
View/Open    Request a copy

This item is licensed under a Creative Commons License Creative Commons