DV-hop localisation algorithm with DDICS

DOI10.1504/IJCSM.2016.077857MaRDI QIDQ2224099zbMATH OpenOpenAlexFDO

Authors Feixiang Li, Zhihua Cui, Bin Sun

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijcsm.2016.077857

zbMATH Keywords

average position errorcuckoo searchDDICSdimension by dimension improvementdistance vectorDV-hop locationlocalisation algorithmssimulation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Dimension by dimension improvement-based cuckoo search algorithm (DDICS) is a recent proposed variant of cuckoo search algorithm. The experimental results illustrate DDICS is superior to several other evolutionary algorithms when solving un-constraint numerical benchmarks. In this paper, we employ it to improve the performance of distance vector-hop method (DV-hop). The simulation results show it achieves the best performance when compared with two other DV-hop algorithms.

Recommendations

• A cuckoo search algorithm with dimension by dimension improvement
• Weight convergence analysis of DV-hop localization algorithm with GA
• scientific article; zbMATH DE number 6401243
• A new local-enhanced cuckoo search algorithm
• An improved cuckoo algorithm for solving the problem of logistics distribution center location

Cited in

(1)

• DDICS

This page was built for publication: DV-hop localisation algorithm with DDICS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224099)