Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem
Author(s): Narvaez-Teran, Valentina
Ochoa, Gabriela
Rodriguez-Tello, Eduardo
Contact Email:
Keywords: Search trajectory networks
cyclic bandwidth sum problem
memetic algorithms
Issue Date: Dec-2021
Date Deposited: 15-Nov-2021
Citation: Narvaez-Teran V, Ochoa G & Rodriguez-Tello E (2021) Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem. IEEE Access, 9, pp. 151266-151277.
Abstract: Search trajectory networks (STNs) were proposed as a tool to analyze the behavior of metaheuristics in relation to their exploration ability and the search space regions they traverse. The technique derives from the study of fitness landscapes using local optima networks (LONs). STNs are related to LONs in that both are built as graphs, modelling the transitions among solutions or group of solutions in the search space. The key difference is that STN nodes can represent solutions or groups of solutions that are not necessarily locally optimal. This work presents an STN-based study for a particular combinatorial optimization problem, the cyclic bandwidth sum minimization. STNs were employed to analyze the two leading algorithms for this problem: a memetic algorithm and a hyperheuristic memetic algorithm. We also propose a novel grouping method for STNs that can be generally applied to both continuous and combinatorial spaces.
DOI Link: 10.1109/access.2021.3126015
Rights: This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see
Licence URL(s):

Files in This Item:
File Description SizeFormat 
Narvaez-Teran-etal-IEEEAccess-2021.pdfFulltext - Published Version7.6 MBAdobe PDFView/Open

This item is protected by original copyright

A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.