Open Access Helper

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 discrete tree-seed algorithm for solving symmetric traveling salesman problem
Ahmet Cevahir Çınar, Sedat Korkmaz, Mustafa Servet Kıran
Engineering Science and Technology an International Journal (2019) Vol. 23, Iss. 4, pp. 879-890
Open Access | Times Cited: 72

Showing 1-25 of 72 citing articles:

A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems
Ebubekir Kaya, Beyza Görkemli, Bahriye Akay, et al.
Engineering Applications of Artificial Intelligence (2022) Vol. 115, pp. 105311-105311
Closed Access | Times Cited: 106
Advances in Tree Seed Algorithm: A Comprehensive Survey
Farhad Soleimanian Gharehchopogh
Archives of Computational Methods in Engineering (2022) Vol. 29, Iss. 5, pp. 3281-3304
Closed Access | Times Cited: 80
Discrete sparrow search algorithm for symmetric traveling salesman problem
Zhen Zhang, Yang Han
Applied Soft Computing (2022) Vol. 118, pp. 108469-108469
Closed Access | Times Cited: 71
A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems
Bladimir Toaza, Domokos Esztergár-Kiss
Applied Soft Computing (2023) Vol. 148, pp. 110908-110908
Open Access | Times Cited: 52
An efficient harris hawk optimization algorithm for solving the travelling salesman problem
Farhad Soleimanian Gharehchopogh, Benyamın Abdollahzadeh
Cluster Computing (2021) Vol. 25, Iss. 3, pp. 1981-2005
Closed Access | Times Cited: 86
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
Changyou Wu, Xisong Fu, Junke Pei, et al.
IEEE Access (2021) Vol. 9, pp. 153456-153471
Open Access | Times Cited: 64
DJAYA: A discrete Jaya algorithm for solving traveling salesman problem
Mesut Gündüz, Murat Aslan
Applied Soft Computing (2021) Vol. 105, pp. 107275-107275
Closed Access | Times Cited: 62
An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem
Farhad Soleimanian Gharehchopogh, Benyamın Abdollahzadeh, Bahman Arasteh
Computer Modeling in Engineering & Sciences (2022) Vol. 135, Iss. 3, pp. 1981-2006
Open Access | Times Cited: 40
A Comprehensive Review of Bio-Inspired Optimization Algorithms Including Applications in Microelectronics and Nanophotonics
Zoran Jakšić, Swagata Devi, Olga Jakšić, et al.
Biomimetics (2023) Vol. 8, Iss. 3, pp. 278-278
Open Access | Times Cited: 35
Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems
Benyamın Abdollahzadeh, Farhad Soleimanian Gharehchopogh, Saeid Barshandeh
International Journal of Intelligent Systems (2020) Vol. 36, Iss. 3, pp. 1270-1303
Open Access | Times Cited: 56
Training Feed-Forward Multi-Layer Perceptron Artificial Neural Networks with a Tree-Seed Algorithm
Ahmet Cevahir Çınar
Arabian Journal for Science and Engineering (2020) Vol. 45, Iss. 12, pp. 10915-10938
Closed Access | Times Cited: 54
Development of Deer Hunting linked Earthworm Optimization Algorithm for solving large scale Traveling Salesman Problem
S.K. Rajesh Kanna, K. Sivakumar, N. Lingaraj
Knowledge-Based Systems (2021) Vol. 227, pp. 107199-107199
Closed Access | Times Cited: 46
Parameter extraction for photovoltaic models with tree seed algorithm
Ayşe Beşkirli, İdiris Dağ
Energy Reports (2022) Vol. 9, pp. 174-185
Open Access | Times Cited: 32
DAACO: adaptive dynamic quantity of ant ACO algorithm to solve the traveling salesman problem
Huijun Liu, Ao Lee, Wenshi Lee, et al.
Complex & Intelligent Systems (2023) Vol. 9, Iss. 4, pp. 4317-4330
Open Access | Times Cited: 13
Discrete komodo algorithm for traveling salesman problem
Gilang Kusuma Jati, Garry Kuwanto, Tahir Hashmi, et al.
Applied Soft Computing (2023) Vol. 139, pp. 110219-110219
Closed Access | Times Cited: 13
Multi-ant colony algorithm based on the Stackelberg game and incremental learning
Qihuan Wu, Xiaoming You, Sheng Liu
Soft Computing (2025)
Closed Access
Discrete differentiated creative search for traveling salesman problem
Qi Xu, Kewen Xia, Xiaoyu Chu
Applied Soft Computing (2025), pp. 112998-112998
Closed Access
DEBOHID: A differential evolution based oversampling approach for highly imbalanced datasets
Ersin Kaya, Sedat Korkmaz, Mehmet Akif Şahman, et al.
Expert Systems with Applications (2020) Vol. 169, pp. 114482-114482
Closed Access | Times Cited: 38
Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm
Majid Yousefikhoshbakht
Complexity (2021) Vol. 2021, Iss. 1
Open Access | Times Cited: 28
Transformation operators based grey wolf optimizer for travelling salesman problem
Karuna Panwar, Kusum Deep
Journal of Computational Science (2021) Vol. 55, pp. 101454-101454
Closed Access | Times Cited: 27
A hybrid binary grey wolf optimizer for selection and reduction of reference points with extreme learning machine approach on local GNSS/leveling geoid determination
Kemal Tütüncü, Mehmet Akif Şahman, Ekrem Tuşat
Applied Soft Computing (2021) Vol. 108, pp. 107444-107444
Closed Access | Times Cited: 25
Discrete cuckoo search algorithms for test case prioritization
Anu Bajaj, Om Prakash Sangwan
Applied Soft Computing (2021) Vol. 110, pp. 107584-107584
Closed Access | Times Cited: 23
A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems
Mustafa Servet Kıran, Mehmet Beşkirli
Biomimetics (2024) Vol. 9, Iss. 2, pp. 118-118
Open Access | Times Cited: 3
A tree–seed algorithm based on intelligent search mechanisms for continuous optimization
Mustafa Servet Kıran, Hüseyin Haklı
Applied Soft Computing (2020) Vol. 98, pp. 106938-106938
Closed Access | Times Cited: 26
Evolutionary Algorithm with Geometrical Heuristics for Solving the Close Enough Traveling Salesman Problem: Application to the Trajectory Planning of an Unmanned Aerial Vehicle
Christophe Cariou, Laure Moiroux-Arvis, François Pinet, et al.
Algorithms (2023) Vol. 16, Iss. 1, pp. 44-44
Open Access | Times Cited: 8
Page 1 - Next Page

Scroll to top