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 1-25 of 41 citing articles:

Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques
Shyi‐Ming Chen, Chih-Yao Chien
Expert Systems with Applications (2011) Vol. 38, Iss. 12, pp. 14439-14450
Closed Access | Times Cited: 247
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
Xiutang Geng, Zhihua Chen, Wei Yang, et al.
Applied Soft Computing (2011) Vol. 11, Iss. 4, pp. 3680-3689
Closed Access | Times Cited: 227
Energy-Efficient Industrial Internet of UAVs for Power Line Inspection in Smart Grid
Zhenyu Zhou, Chuntian Zhang, Chen Xu, et al.
IEEE Transactions on Industrial Informatics (2018) Vol. 14, Iss. 6, pp. 2705-2714
Open Access | Times Cited: 154
Parallelized genetic ant colony systems for solving the traveling salesman problem
Shyi‐Ming Chen, Chih-Yao Chien
Expert Systems with Applications (2010) Vol. 38, Iss. 4, pp. 3873-3883
Closed Access | Times Cited: 107
BEE COLONY OPTIMIZATION WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM
Li‐Pei Wong, Malcolm Yoke Hean Low, Chin Soon Chong
International Journal of Artificial Intelligence Tools (2010) Vol. 19, Iss. 03, pp. 305-334
Closed Access | Times Cited: 59
An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method
Musa Peker, Baha Şen, Pınar Yıldız
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES (2013) Vol. 21, pp. 2015-2036
Open Access | Times Cited: 48
A new population seeding technique for permutation-coded Genetic Algorithm: Service transfer approach
P. Victer Paul, A. Ramalingam, R. Baskaran, et al.
Journal of Computational Science (2013) Vol. 5, Iss. 2, pp. 277-297
Closed Access | Times Cited: 45
Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
ChangYing Wang, Min Lin, Yiwen Zhong, et al.
International Journal of Computing Science and Mathematics (2015) Vol. 6, Iss. 4, pp. 336-336
Closed Access | Times Cited: 35
Immune algorithm combined with estimation of distribution for traveling salesman problem
Zhe Xu, Yirui Wang, Sheng Li, et al.
IEEJ Transactions on Electrical and Electronic Engineering (2016) Vol. 11, Iss. S1
Closed Access | Times Cited: 31
A modified pulse coupled neural network for shortest-path problem
Xiaobin Wang, Hong Qu, Yi Zhang
Neurocomputing (2009) Vol. 72, Iss. 13-15, pp. 3028-3033
Closed Access | Times Cited: 26
An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem
Junying Zhang, Xuerong Feng, Bin Zhou, et al.
Neurocomputing (2012) Vol. 89, pp. 1-11
Closed Access | Times Cited: 22
An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities
Saeed Asadi Bagloee, Madjid Tavana
International Journal of Logistics Systems and Management (2011) Vol. 11, Iss. 1, pp. 114-114
Closed Access | Times Cited: 21
Investigation on the choice of the initial temperature in the Simulated Annealing: A mushy state SA for TSP
Hamed Shakouri G., Kambiz Shojaee, Mu T
2006 14th Mediterranean Conference on Control and Automation (2009) Vol. 6, pp. 1050-1055
Closed Access | Times Cited: 21
A novel method for solving the multiple traveling salesmen problem with multiple depots
Mengshu Hou, Daibo Liu
Chinese Science Bulletin (2012) Vol. 57, Iss. 15, pp. 1886-1892
Open Access | Times Cited: 18
Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem
Changying Wang, Min Lin, Yiwen Zhong, et al.
International Journal of Intelligent Systems Technologies and Applications (2016) Vol. 15, Iss. 1, pp. 74-74
Closed Access | Times Cited: 13
Discrete Hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem
Jiahai Wang
Expert Systems with Applications (2010) Vol. 37, Iss. 8, pp. 5758-5774
Closed Access | Times Cited: 12
On computational complexity of the constructive-optimizer neural network for the traveling salesman problem
Mahdi Saadatmand‐Tarzjan
Neurocomputing (2018) Vol. 321, pp. 82-91
Closed Access | Times Cited: 11
Improved Particle Swarm Optimization For Traveling Salesman Problem
Xinli Xu, Xu Cheng, Zhong-Chen Yang, et al.
(2013), pp. 857-862
Closed Access | Times Cited: 9
A heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ΔΣ modulation circuits
Sergio Callegari, Federico Bizzarri
(2010), pp. 1815-1818
Closed Access | Times Cited: 9
Domino algorithm: a novel constructive heuristics for traveling salesman problem
Asrul Harun Ismail
IOP Conference Series Materials Science and Engineering (2019) Vol. 528, Iss. 1, pp. 012043-012043
Open Access | Times Cited: 8
Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem
Changying Wang, Juan Lin, Min Lin, et al.
International Journal of Wireless and Mobile Computing (2016) Vol. 10, Iss. 2, pp. 166-166
Closed Access | Times Cited: 7
A Self-Organizing Map Algorithm for the Traveling Salesman Problem
Xin-Shun Xu, Zhiping Jia, Ma Jun, et al.
(2008), pp. 431-435
Closed Access | Times Cited: 8
Importance of the Initial Conditions and the Time Schedule in the Simulated Annealing
G. Kambiz Shojaee, Hamed Shakouri G., Mojtaba Behnam Taghadosi
(2010)
Closed Access | Times Cited: 7
A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application
Yan Pei, Hideyuki Takagi
(2011)
Open Access | Times Cited: 5
An efficient and scalable algorithm for the traveling salesman problem
Chen Ye, Zhongcheng Yang, Tianxing Yan
(2014), pp. 335-339
Closed Access | Times Cited: 4
Page 1 - Next Page

Scroll to top