A Lévy Flight-Inspired Random Walk Algorithm for Continuous Fitness Landscape Analysis

View Sample PDF

Author(s): Yi Wang (Guangdong University of Science and Technology, China)and Kangshun Li (South China Agricultural University, China)
Copyright: 2023
Volume: 17
Issue: 1
Pages: 18
Source title: International Journal of Cognitive Informatics and Natural Intelligence (IJCINI)
Editor(s)-in-Chief: Kangshun Li (South China Agricultural University, China)
DOI: 10.4018/IJCINI.330535

Keywords: Cognitive Informatics / Computer Science & IT / Information Science Reference

Purchase

View A Lévy Flight-Inspired Random Walk Algorithm for Continuous Fitness Landscape Analysis on the publisher's website for pricing and purchasing information.

Abstract

Heuristic algorithms are effective methods for solving complex optimization problems. The optimal algorithm selection for a specific optimization problem is a challenging task. Fitness landscape analysis (FLA) is used to understand the optimization problem's characteristics and help select the optimal algorithm. A random walk algorithm is an essential technique for FLA in continuous search space. However, most currently proposed random walk algorithms suffer from unbalanced sampling points. This article proposes a Lévy flight-based random walk (LRW) algorithm to address this problem. The Lévy flight is used to generate the proposed random walk algorithm's variable step size and direction. Some tests show that the proposed LRW algorithm performs better in the uniformity of sampling points. Besides, the authors analyze the fitness landscape of the CEC2017 benchmark functions using the proposed LRW algorithm. The experimental results indicate that the proposed LRW algorithm can better obtain the structural features of the landscape and has better stability than several other RW algorithms.

The IRMA Community

Research IRM

A Lévy Flight-Inspired Random Walk Algorithm for Continuous Fitness Landscape Analysis

Purchase

Abstract

Related Content

IRMA Sponsors