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:

Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
Hung D. Nguyen, Ikuo Yoshihara, Kunihito Yamamori, et al.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) (2007) Vol. 37, Iss. 1, pp. 92-99
Closed Access | Times Cited: 172

Showing 1-25 of 172 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
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
Yuichi Nagata, Shigenobu Kobayashi
INFORMS journal on computing (2012) Vol. 25, Iss. 2, pp. 346-363
Closed Access | Times Cited: 179
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
Genetic algorithms and Darwinian approaches in financial applications: A survey
Anton Aguilar-Rivera, Manuel Valenzuela-Rendón, José Rodríguez-Ortiz
Expert Systems with Applications (2015) Vol. 42, Iss. 21, pp. 7684-7697
Closed Access | Times Cited: 151
Task scheduling for cloud computing using multi-objective hybrid bacteria foraging algorithm
Srichandan Sobhanayak, Turuk Ashok Kumar, Bibhudatta Sahoo
Future Computing and Informatics Journal (2018) Vol. 3, Iss. 2, pp. 210-230
Open Access | Times Cited: 135
ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles
Xue Yu, Wei‐Neng Chen, Tianlong Gu, et al.
IEEE Transactions on Evolutionary Computation (2018) Vol. 23, Iss. 4, pp. 617-631
Open Access | Times Cited: 122
A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem
Indadul Khan, Manas Kumar Maiti
Swarm and Evolutionary Computation (2018) Vol. 44, pp. 428-438
Closed Access | Times Cited: 121
Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing – tabu search algorithm to solve the symmetrical traveling salesman problem
Yu Lin, Zheyong Bian, Xiang Liu
Applied Soft Computing (2016) Vol. 49, pp. 937-952
Closed Access | Times Cited: 97
A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
Ting Huang, Yue‐Jiao Gong, Sam Kwong, et al.
IEEE Transactions on Evolutionary Computation (2019), pp. 1-1
Open Access | Times Cited: 80
Genetic algorithm for Traveling Salesman Problem
Haojie Xu, Yisu Ge, Guodao Zhang
(2022), pp. 33-40
Closed Access | Times Cited: 41
A proposition on memes and meta-memes in computing for higher-order learning
Ryan Meuth, Meng‐Hiot Lim, Yew-Soon Ong, et al.
Memetic Computing (2009) Vol. 1, Iss. 2, pp. 85-100
Closed Access | Times Cited: 125
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Yannis Marinakis, Magdalene Marinaki, Georgios Dounias
Information Sciences (2010) Vol. 181, Iss. 20, pp. 4684-4698
Closed Access | Times Cited: 117
A Modern Introduction to Memetic Algorithms
Pablo Moscato, Carlos Cotta
International series in management science/operations research/International series in operations research & management science (2010), pp. 141-183
Closed Access | Times Cited: 110
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Jayanta Majumdar, Asoke Kumar Bhunia
Journal of Computational and Applied Mathematics (2011) Vol. 235, Iss. 9, pp. 3063-3078
Closed Access | Times Cited: 96
Programmable Generation and Motion Control of a Snakelike Magnetic Microrobot Swarm
Hui Xie, Xinjian Fan, Mengmeng Sun, et al.
IEEE/ASME Transactions on Mechatronics (2019) Vol. 24, Iss. 3, pp. 902-912
Closed Access | Times Cited: 66
A reinforced hybrid genetic algorithm for the traveling salesman problem
Jiongzhi Zheng, Jialun Zhong, Menglei Chen, et al.
Computers & Operations Research (2023) Vol. 157, pp. 106249-106249
Open Access | Times Cited: 18
A memetic neural network for the Euclidean traveling salesman problem
Jean-Charles Créput, Abderrafìâa Koukam
Neurocomputing (2008) Vol. 72, Iss. 4-6, pp. 1250-1264
Closed Access | Times Cited: 86
Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)
Xiao-Feng Xie, Jiming Liu
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) (2008) Vol. 39, Iss. 2, pp. 489-502
Closed Access | Times Cited: 82
Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem
Fanggeng Zhao, Sujian Li, Jiangsheng Sun, et al.
Computers & Industrial Engineering (2008) Vol. 56, Iss. 4, pp. 1642-1648
Open Access | Times Cited: 78
A multiobjective memetic algorithm for PPI network alignment
Connor Clark, Jugal Kalita
Bioinformatics (2015) Vol. 31, Iss. 12, pp. 1988-1998
Open Access | Times Cited: 63
A hybrid cuckoo search-genetic algorithm for hole-making sequence optimization
Wei Chen Esmonde Lim, G. Kanagaraj, S. G. Ponnambalam
Journal of Intelligent Manufacturing (2014) Vol. 27, Iss. 2, pp. 417-429
Closed Access | Times Cited: 61
Hybrid biogeography-based evolutionary algorithms
Haiping Ma, Dan Simon, Minrui Fei, et al.
Engineering Applications of Artificial Intelligence (2014) Vol. 30, pp. 213-224
Closed Access | Times Cited: 49
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
Travelling Salesman Problem
Miguel Casquilho
(2012)
Closed Access | Times Cited: 42
Hybrid Bacterial Foraging Optimization Strategy for Automated Experimental Control Design in Electrical Drives
Nnamdi Okaeme, Pericle Zanchetta
IEEE Transactions on Industrial Informatics (2012) Vol. 9, Iss. 2, pp. 668-678
Closed Access | Times Cited: 41
Page 1 - Next Page

Scroll to top