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 Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem
Mahdi Saadatmand‐Tarzjan, Morteza Khademi, Mohammad-R. Akbarzadeh-T, et al.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) (2007) Vol. 37, Iss. 4, pp. 754-770
Closed Access | Times Cited: 41

Showing 26-50 of 41 citing articles:

Evolving novel algorithm based on intellectual behavior of Wild dog group as optimizer
Avtar Singh Buttar, Ashok K. Goel, Shakti Kumar
(2014), pp. 1-7
Closed Access | Times Cited: 3
AN UNSUPERVISED LEARNING METHOD FOR AN ATTACKER AGENT IN ROBOT SOCCER COMPETITIONS BASED ON THE KOHONEN NEURAL NETWORK
Masoud Mirmomeni, Mohammad Javad Yazdanpanah
International Journal of Engineering (2008) Vol. 21, Iss. 3, pp. 255-268
Closed Access | Times Cited: 4
Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network
Yu Du, Shaochuan Fu, Changxiang Lu, et al.
Computational Intelligence and Neuroscience (2021) Vol. 2021, pp. 1-18
Open Access | Times Cited: 4
Comparative Study of Artificial Bee Colony Algorithms with Heuristic Swap Operators for Traveling Salesman Problem
Zhonghua Li, Zijing Zhou, Xuedong Sun, et al.
Lecture notes in computer science (2013), pp. 224-233
Closed Access | Times Cited: 3
Exploring the Solution Space of the Euclidean Traveling Salesman Problem Using a Kohonen SOM Neural Network
Ewa Skubalska-Rafajłowicz
Lecture notes in computer science (2017), pp. 165-174
Closed Access | Times Cited: 3
Computational comparison of GRASP and DCTSP methods for the Traveling Salesman Problem
Mingkang Zhu, Jianli Chen
(2017)
Closed Access | Times Cited: 3
A Mushy State Simulated Annealing
Mohammad Bagher Menhaj
(2011) Vol. 43, Iss. 2, pp. 59-70
Closed Access | Times Cited: 2
Kohonen SOM for Image Slides Sequencing
Ewa Skubalska-Rafajłowicz, Aneta Górniak
Lecture notes in computer science (2016), pp. 352-365
Closed Access | Times Cited: 1
The Wise Experiencing Traveling Salesman (WETS): Introduction to a simple evolutionary solution for the problem
Hamed Shakouri G., K. Shojaee, Mu T
(2009), pp. 771-776
Closed Access | Times Cited: 1
The Double Node Local Optimizer for Travelling Salesman Problem
Azhar Waleed Hammad
Journal of Al-Nahrain University-Science (2014) Vol. 17, Iss. 2, pp. 213-218
Open Access
Performance Analysis of Improved Glowworm Swarm Optimization Algorithm and the Application in Coverage Optimization of WSNs
Kewang Zhang
Chuangan jishu xuebao (2013)
Closed Access
Enhancement of SA algorithm by intelligent time schedule
Mohadeseh Rezaei
(2010), pp. 1768-1774
Closed Access
Global Minimum Elastic Net for the Euclidean Travelling Salesman Problem
Imaculate Mosha
(2017), pp. 122-125
Closed Access
Editorial
Bidyut Baran Saha, Kyaw Thu, Agung Tri Wijayanta
Evergreen (2018) Vol. 5, Iss. 3, pp. ii-iii
Open Access
Solve traveling salesman problem using EMF-CE algorithm
Meng Luo, Shiliang Gu
(2020)
Closed Access
Solve traveling salesman problem using EMF-CE algorithm
Meng Luo, Shiliang Gu
(2020)
Closed Access
Previous Page - Page 2

Scroll to top