OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A Comparative Study on Crossover Operators of Genetic Algorithm for Traveling Salesman Problem
Xin-Ai Dou, Qiang Yang, Xudong Gao, et al.
(2023), pp. 1-8
Closed Access | Times Cited: 7

Showing 7 citing articles:

Comparison of Genetic Crossover Operators for Traveling Salesman Problem
Şahin Burak Dalkılıç, Atilla Özgür, Hamit Erdem
GAZI UNIVERSITY JOURNAL OF SCIENCE (2025), pp. 1-1
Open Access

Comparative Study on Different Encoding Strategies for Multiple Traveling Salesmen Problem
Xin-Ai Dou, Qiang Yang, Peilan Xu, et al.
2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) (2023) Vol. 2, pp. 1437-1442
Closed Access | Times Cited: 2

Crossover Operator Inspired by the Selection Operator for an Evolutionary Task Sequencing Algorithm
Piotr Ciepliński, S. Golak
Applied Sciences (2024) Vol. 14, Iss. 24, pp. 11786-11786
Open Access

Enhancement of Genetic Algorithm by J.Zhang Applied to Tour Planning
Isabella Malonzo, Tracy Patacsil, Jonathan Morano, et al.
International Journal of Advanced Trends in Computer Science and Engineering (2024) Vol. 13, Iss. 2, pp. 92-96
Open Access

Gender-Sensitive EEG Channel Selection for Emotion Recognition Using Enhanced Genetic Algorithm
Dan-Ting Duan, Bing Sun, Qiang Yang, et al.
2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) (2023), pp. 3253-3258
Closed Access | Times Cited: 1

Page 1

Scroll to top