P-N-Suganthan/CEC2017-BoundContrained: papers linking to it

GitHub · 55 stars · 25 forks · created 2019 · github.com/P-N-Suganthan/CEC2017-BoundContrained

← Code and data repositories cited in research papers

Research papers in the 480 tracked journals that link to P-N-Suganthan/CEC2017-BoundContrained (https://github.com/P-N-Suganthan/CEC2017-BoundContrained), read from their Crossref records: by year, category and journal, the family tree of papers building on one another, and the linked repositories derived from it or that it derives from.

Key findings#

6 papers in the tracked journals link to the GitHub repository P-N-Suganthan/CEC2017-BoundContrained in their Crossref records, the first in 2021; most of them (3) in 2022.
By category: AI (6); the journals with the most are Neural Computing and Applications (2), Expert Systems with Applications (2) and Applied Intelligence (1).

By year#

20212026

Papers linking to P-N-Suganthan/CEC2017-BoundContrained by publication year
Year	Papers
2021	1
2022	3
2024	1
2026	1

Journals#

Journals whose papers link to P-N-Suganthan/CEC2017-BoundContrained most
Journal	Papers
Neural Computing and Applications	2
Expert Systems with Applications	2
Applied Intelligence	1
Artificial Intelligence Review	1

Papers linking to P-N-Suganthan/CEC2017-BoundContrained, most cited first
Published	Title	Journal	Authors	Citations	Link
2022-05-06	A reinforcement learning based artificial bee colony algorithm with application in robot path planning	Expert Systems with Applications	Yibing Cui, Wei Hu, Ahmed Rahmani	80	cites it
2021-10-04	Joint Opposite Selection (JOS): A premiere joint of selective leading opposition and dynamic opposite enhanced Harris’ hawks optimization for solving single-objective problems	Expert Systems with Applications	Florentina Yuni Arini, Sirapat Chiewchanwattana, Chitsutha Soomlek et al.	57	cites it
2022-08-18	PVS: a new population-based vortex search algorithm with boosted exploration capability using polynomial mutation	Neural Computing and Applications	Tahir Sağ	21	cites it
2024-06-03	Nonlinear crossing strategy-based particle swarm optimizations with time-varying acceleration coefficients	Applied Intelligence	Keigo Watanabe, Xiongshi Xu	16	cites it
2022-04-04	Self-organizing migrating algorithm: review, improvements and comparison	Artificial Intelligence Review	Lenka Skanderová	15	cites it
2026-08-01	The octopus–reef fish cooperative hunting optimizer: an efficient bio-inspired algorithm for global optimization and engineering applications	Neural Computing and Applications	Shiyu Liu, Zhanjiang Wang	0	cites it

How this is measured#

Links are read from each paper's Crossref record as its publisher deposited it: the URLs and repository DOIs in its reference list (the software and data it cites) and its supplementary links (“is-supplemented-by”: its own code or data). A paper that gives its code only in the text, a footnote or a data availability statement is not counted, and some publishers deposit reference lists without their URLs, so every count here is a lower bound. Repository details come from the GitHub REST API (stars, forks, and the repository a fork was made from), the Hugging Face Hub API (likes, downloads, and the base model a model was derived from) and DataCite (Zenodo and other data DOIs, and the GitHub release a Zenodo record archives), read again every month.

Cite this page

Scholar4AI. (2026). P-N-Suganthan/CEC2017-BoundContrained: papers linking to it. Journal and Conference Research Rankings. Retrieved November 3, 2026, from https://scholar4ai.com/code/github-p-n-suganthan-cec2017-boundcontrained

@misc{scholar4ai-code-github-p-n-suganthan-cec2017-boundcontrained,
  author = {{Scholar4AI}},
  title = {P-N-Suganthan/CEC2017-BoundContrained: papers linking to it},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/code/github-p-n-suganthan-cec2017-boundcontrained}},
  urldate = {2026-11-03},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).