Evidence map›Paper›PMID 36673312›Full record

ArticleEntropy (Basel, Switzerland)2023

Willow Catkin Optimization Algorithm Applied in the TDOA-FDOA Joint Location Problem.

Jeng-Shyang Pan, Si-Qi Zhang, Shu-Chuan Chu, Hong-Mei Yang, Bin Yan

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Jeng-Shyang PanCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0002-3128-9025
Si-Qi ZhangCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0003-2818-692X
Shu-Chuan ChuCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0003-2117-0618
Hong-Mei YangCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China.
Bin YanCollege of Electronics, Communication and Physics, Shandong University of Science and Technology, Qingdao 266590, China.ORCID 0000-0003-2929-464X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The heuristic optimization algorithm is a popular optimization method for solving optimization problems. A novel meta-heuristic algorithm was proposed in this paper, which is called the Willow Catkin Optimization (WCO) algorithm. It mainly consists of two processes: spreading seeds and aggregating seeds. In the first process, WCO tries to make the seeds explore the solution space to find the local optimal solutions. In the second process, it works to develop each optimal local solution and find the optimal global solution. In the experimental section, the performance of WCO is tested with 30 test functions from CEC 2017. WCO was applied in the Time Difference of Arrival and Frequency Difference of Arrival (TDOA-FDOA) co-localization problem of moving nodes in Wireless Sensor Networks (WSNs). Experimental results show the performance and applicability of the WCO algorithm.

Indexed as

CEC2017metaheuristic optimization algorithmTDOA-FDOA location problemWillow Catkin OptimizationWSNs

Identifiers

PMID36673312
PMCPMC9858194

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.